STUPIDSID
1 (a)
Explain different types of data structures with example.
5 M
1 (b)
Write recursive & non-recursive functions to calculate GCD of 2 numbers.
5 M
1 (c)
Show with example how graph are represented in computer memory.
5 M
1 (d)
Discuss practical applications of trees.
5 M
2 (a)
What is hashing? What is mean by collision? Using modulo division method & linear probing, store the values given below in array with 10 elements.
99 33 23 44 56 43 19.
99 33 23 44 56 43 19.
10 M
2 (b)
Write a program in 'C' to convert infix expression to postfix expression using stacks.
10 M
3 (a)
Write a program in 'C' to perform Quick sort. Show steps with example.
10 M
3 (b)
Write a program in 'C' which will read a text and count all occurrences of a particular word.
10 M
4 (a)
Write a program in 'C' to implement circular queue using Link-List.
10 M
4 (b)
Construct Binary tree for the pre-order & Inorder traversal sequences :-
| Preorder : | A | B | D | G | C | E | H | I | F |
| Inorder : | D | G | B | A | H | E | I | C | F |
10 M
5 (a)
Write a program in 'C' to implement Doubly Link-List with methods insert, delete and search.
10 M
5 (b)
Write a program in 'C' to implement Binary search on sorted set of integers.
10 M
Write short note
6 (a)
Discuss Threaded Binary tree in detail.
10 M
6 (b)
Explain BFS algorithm with example.
10 M
More question papers from Data Structures