DSF QB

KONKAN GYANPEETH COLLEGE OF ENGG., KARJAT

DEPARTMENT OF COMPUTER ENGINEERING

QUESTION BANK FOR TERM TEST – II

SECOND YEAR : SEMESTER – III (2011 – 12)

SUBJECT : DATA STRUCTURES AND FILES

Date : 17/10/2011.

1.      Explain and WAP to implement Merge Sort.

2.      Write short note on indexed sequential search and implement core part of the same.

3.      WAP to implement selection sort w.r.t. minimum element in each pass.

4.      Explain Huffman Coding Algorithm and apply the same on the string   “MALAYALAM”.

5.      Implement inorder, preorder and postorder traversals of Binary Search Tree with example.

6.      Implement a method to delete node from Binary Search Tree w.r.t. all possible cases with example.

7.      Explain traversals of Graph with example.

8.      WAP to implement Heap Sort.

9.      What is Hashing? Explain various hashing methods and  collision avoiding Techniques.

10.  Explain Divide and conquer  method. Implement Binary search algorithm.

11.  Explain and WAP to implement Quick Sort.

12.  Construct a binary search tree which is visited traversals as follows –

                          Inorder      -  B D H J L N O Q R S W

                          Postorder -  B H D L N J R Q W S O

13.  Write short notes on –    a) AVL tree,         b) B -  tree

14.  Explain various methods for  representation  of graph with example.

15.  WAP to create tree and search element from Binary Search Tree.

16.  Construct a binary search tree which is visited traversals as follows –

                          Inorder      -  C E G H J K M O P Q U

                          Preorder   -  M H E C G K J Q O P U

17.  WAP to implement advanced bubble sort.

                               

          Subject  In-charge

                                                                                                                                   Mr. Patil S. M.