Question Bank for Prelim Exam (6 Marks Questions)

Solve any Two                                                                              (6 Marks/each)

1) Explain how to insert and delete nodes in Doubly Linked List ?

2) Enlist the types of binary tree and give their meanings. With help of example

describe the process of various traversal of binary tree.

3) Explain B trees. Show the growth of B tree of order 5 by inserting following keys :

10, 5, 3, 7, 6, 4, 37, 11, 13, 15, 67, 53, 12, 16, 2.

Show the status of B+ tree after every insertion. Also show the status after delete 11.

4) Write C functions for DFS and BFS traversal of graph.

5) Explain call by value and call by reference with example.

6) What is Selection sort?  Sort following elements using selection sort.

2 33 76 55 34 90 1

7) Write a note on STACK, operations on STACK with suitable example.

8) Write C program to implement circular linked list for Josephus problem.

9) Write a C program to implement simple queue using array.

10) Write the general algorithm for recursion. Also explain why dynamic storage

allocation is used for implementing recursion using flowchart.

11) What are the graph traversal methods ? Explain any one traversal method

with flowchart.

12) The following sequence gives the postorder and inorder traversal of binary

tree :

Postorder : DFEBGLJKHCA

Inorder : DBFEAGCLJHK

Construct the binary tree. Show the intermediate steps.

13) What is hash collision ? Justify how closed hashing technique is used to

resolve has clashes.

14) Write a an algorithm to insert, delete a node from doubly linked list.

15) What is binary search ? Explain with example.

16) Explain hashing techniques in detail.

17) Explain Recursive flow chart

18) Write a program of Multiplication of two numbers using recursion.