Question Bank for Prelim Exam (4 Marks Question)

Solve any four                                                                           (4 Marks/each)

1) Explain queue as an ADT.

2) Explain Stack with operations.

3) Explain Circular Queue with example.

4) Explain Infix to Prefix algorithm with example.

5) Construct a binary search tree from the given list of letters inserted in order an empty binary search tree J, R, D, G, T, E, M, H, P, A, F, Q.

6) Explain singly linked list insertion cases.

7) Explain B Tree with example.

8) Explain graph and its terminologies with diagram.

9) Why there is a need of multiway tree ? Explain.

10) Explain the following terms related to graph :

a) Graph

b) Weighted Graph

c) Self loop

d) Complete graph

e) Pendant Vertex.

11) What is a stack ? Write the C function for push operation for a stack.

12) What is avail list ? Explain the algorithm for getnode and freenode using

diagram.

13) Evaluate the following postfix expression : 5 4 6 + * 4 9 3 / + * .

14) Define queue. Explain the different operations performed on a simple queue.

15) Explain the insertion algorithm for an ordered singly linked list.

16) Write a C program to search an element in an array using binary search method.

17) Explain the different methods of tree traversal.

18) Write a C program to sort an array of 5 elements using selection sort.

19) Explain any four types of graph with diagram.

20) Elaborate how to delete a key from a binary search tree

21) What is BFS explain with an example

22) What is DFS explain with an example

23) What is Linear Probing? Explain with an example

24) Sort the following array using quick sort

20 50 10 60 70 80 90 40 30

Write a note on

25) Circular list.

26) Insertion sort.

27) Recursion.

28) Algorithm for merge sort.

29) Deletion of node from singly linked list.

30) Represent a graph using adjacency matrix by taking example.