Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Scribd Logo
Upload

Welcome to Scribd!

  • 13 views

    6337

    Uploaded by

    VD King Brothers
    Questions programming paper annau

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd

    6337

    Uploaded by

    VD King Brothers
    13 views2 pages
    Questions programming paper annau

    Copyright

    © © All Rights Reserved

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Questions programming paper annau

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Download as pdf or txt
    13 views2 pages

    6337

    Uploaded by

    VD King Brothers
    Questions programming paper annau

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Download as pdf or txt
    of 2

    Regd. No.

    18-N-1236
    B.E. (BIOMEDICAL ENGINEERING) DEGREE EXAMINATIONS, NOVEMBER / DECEMBER 2021
    THIRD SEMESTER
    318BMT06 / 318ECT03 / 318EET06 - FUNDAMENTALS OF DATA STRUCTURES IN C
    (REGULATIONS 2018)
    (Common to B.E. – Electronics and Communication Engineering & Electrical and Electronics Engineering)

    Time: 3 Hours Maximum: 100 Marks


    Answer ALL the questions

    PART – A (10 X 2 = 20 Marks)


    1. List the various data types used in C. CO1 K1
    2. Mention any two string functions in C. Give example. CO1 K2
    3. What is meant by function prototype with example? CO2 K1
    4. State the various operations on file. CO2 K1
    5. Differentiate between doubly and circular linked list. CO3 K2
    6. State the disadvantages of queue which is implemented using array and how to CO3 K2
    overcome it?
    7. Write the properties of binary tree. CO4 K1
    8. Define the term complete graph. CO4 K1
    9. Sort the given number using selection sort 8, 3, 9, 23, 12, 5, 4, 1, 6. CO5 K3
    10. What is the worst and best case of binary search? CO5 K1

    PART – B (5 X 16 = 80 Marks)
    11. a) Elucidate the compilation and linking process in C. Write a C program to find CO1 K3
    the factors of the number.
    (OR)
    11. b) Describe the syntax of any two looping statements in C. Write a C program to CO1 K3
    find the string is palindrome or not.

    12. a) Describe the working of structure within structure with suitable example. CO2 K3
    Write a program to create the array of structures and display the data.
    (OR)
    12. b) Discuss about memory management .Write a C program to read and write CO2 K3
    the contents in a file.

    13. a) Elucidate the working of double linked list. Write an algorithm to insert an CO3 K4
    item in the middle, beginning and end position in the double linked list.
    (OR)
    13. b) Narrate the algorithm of balancing the symbols. Convert the given infix CO3 K4
    expression into postfix (A-B)* (D/E).

    14. a) Explain the concept of binary search tree. Write an algorithm to insert an item CO4 K3
    in binary search tree with example.
    (OR)
    14. b) Describe the different ways of representing the graph. Discuss the algorithms CO4 K2
    of graph traversals with example.

    15. a) Describe the algorithm of merge sort. Rearrange the given numbers using CO5 K4
    merge sort 21, 11, 5, 78, 49,54,72,88,67,53,44,101,109,103,114,102.
    (OR)
    15. b) Write the algorithm of linear search on n data elements for a given key k. CO5 K3
    What is the worst case and average case time complexities?

    You might also like