STUPIDSID
1 (a)
Explain linear and non-linear data structures with examples.
5 M
1 (b)
Explain various techniques of graph representation.
5 M
1 (c)
Write a 'C' program to convert decimal to binary using any approprite data structure you have studdied.
7 M
1 (d)
Define ADT with example.
3 M
2 (a)
What is Huffman Coding. Construct the Huffman Tree and determine the code for the following characters whose frequencies are as gien :-
| Charactes | A | B | C | D | E |
| Freqency | 20 | 10 | 10 | 30 | 30 |
10 M
2 (b)
Write a program in 'C' to evaluate a postfix expression.
10 M
3 (a)
Write a program in 'C' to implement a circular queue. The following operations should be performed by the program :-
(i) Creating the queue.
(ii) Deleting from the queue.
(iii) Inserting in the queue.
(iv) Displaying all the elements of the queue.
(i) Creating the queue.
(ii) Deleting from the queue.
(iii) Inserting in the queue.
(iv) Displaying all the elements of the queue.
12 M
3 (b)
Sort the following elements using Radix Sort :-
121, 70, 965, 432, 12, 577, 683.
What is the limitations of Radix Sort ?
121, 70, 965, 432, 12, 577, 683.
What is the limitations of Radix Sort ?
8 M
4 (a)
Write a 'C' program to create a "Single Linked List" ADT. The ADT shpuld support the following functions :-
(i) Creating a Linked List
(ii) Inserting a node after a specific node.
(iii) Deleting a node.
(iv) Displaying the list.
(i) Creating a Linked List
(ii) Inserting a node after a specific node.
(iii) Deleting a node.
(iv) Displaying the list.
12 M
4 (b)
Explain various graph traversal techniques with examples.
8 M
5 (a)
Discuss AVL trees. Insert the following elements in a AVL search tree :-
27, 25, 23, 29, 35, 33, 34.
27, 25, 23, 29, 35, 33, 34.
10 M
5 (b)
Using linear probing and quadratic probing insert the following values in a hash table of size 10. show how many collision occur in each techniques :-
99, 33, 23, 44, 56, 43, 19.
99, 33, 23, 44, 56, 43, 19.
10 M
6 (a)
Explain indexed sequential search with suitable example. What are the advantages and disadvantages of indexed sequential search ?
10 M
6 (b)
Write a program in 'C' for deletion of a node from a Binary Search Tree. The program should consider all the cases.
10 M
More question papers from Data Structures