MU Computer Engineering (Semester 3)
Data Structures
May 2016
Total marks: --
Total time: --
(1) Assume appropriate data and state your reasons
(2) Marks are given to the right of every question
(3) Draw neat diagrams wherever necessary

1(a) Define ADT with an example
3 M
1(b) What are the advantages of using linked lists over arrays?
5 M
1(c) Describe Expression Tree with an example.
5 M
1(d) Write a program in C to implement Insertion Sort
7 M

2(a) Discuss file I/O in C language with different library functions.
10 M
2(b) Explain recursion as an application of stack with examples.
10 M

3(a) Write a menu driven program in C to implement QU/EUE ADT. The program should perform the following operations:
(i) Inserting an Element in the Queue
(ii) Deleting Element from the Queue
(iii) Displaying the Queue
(iv) Exiting the program
12 M
3(b) Write a function to implement indexed Sequential Search, Explain with an Example
8 M

4(a) Write a C program to implement a Doubly Linked List which performs the following operations:
(i) Inserting element in the beginning
(ii) inserting element in the end
(iii) Inserting element after an element
(iv) Deleting a particular element
(v) Displaying the list
12 M
4(b) Apply Huffman Coding for the word 'MALAYALAM'. Give the Huffman code for each symbol.
8 M

5(a) Explain any one application of linked with an example.
8 M
5(b) Write a program in C to delete a node from a Binary Search Tree. The program should consider all the possible cases.
12 M

6(a) Write a program in C to implement the BFS traversal of a graph. Explain the code with an example.
10 M
6(b) Hash the following in a table of size 11. Use any two collision resolution techniques:
23, 55, 10, 71, 67, 32, 100, 18, 10, 90, 44.
10 M

More question papers from Data Structures