Questionbanks  DS 
A quick guide to Bh.QuestionbanksBrainheaters Questionbanks is the collection of handpicked set of questions which are mostly repeated, important and recommended. Learning this set of questions can easily help you top or even just clear the exams. Given below are Expected Questionbanks for semester.
Explore Questionbanks
MODULE1 1. Explain linear and non linear data structure with example. 2. Iteration VS Recursion 3. Explain different types of Data Structures with example. MODULE2 1. Write ADT for stack. Give application of stack. 2. Write a program to convert an expression from infix to postfix using stack. 3. What is recursion? Write a recursive function in ‘C’ to find sum of digits of a number. 4. Convert the following expression to postfix. (Given with Question) 5. Give ADT for the queue data structure. Discuss any two applications of queue data structure. 6. Write a program to implement linear queue using array. 7. Write a program in 'C' to evaluate postfix expression using STACK ADT. 8. Write a program in 'C' to implement Circular queue using arrays. MODULE3 1. Explain Circular queue and Double ended queue with example. 2. Write a program in C to create a singly linked list and perform the following operations. (i) Insert into list (ii) Search for data (ii) Delete from list (iv) Display data. (i) Insert a node in the beginning (ii) Insert a node in the end (iii) Insert a node after a specific node (iv) Deleting element from the beginning (v) Displaying the list (vi) Exit 3. Write a Program in 'C’ to implement : Doubly linked list with methods insert, delete and Search. (i) Insert a node in the beginning (ii) Insert a node in the end. (iii) Delete a node from the end (iv) Display the list 4. Write a program in 'C’ to implement QUEUE ADT using LinkedList. Perform the following operations: (i) Insert a node in the Queue. (ii) Delete a node from the Queue (iii) Display Queue elements 5. State advantages of LinkedList over arrays. Explain different applications of Linkedlist MODULE4 1. Explain practical applications of trees. 2. Insert the following elements in a AVL search tree: 40, 23, 32, 84, 55, 88, 46, 71, 57 Explain different rotations used in AVL trees 3. Write a program to construct binary tree for the following preorder and inorder traversal sequences. PreOrder: A B D G C E H I F InOrder: D G E A H E I C F 4. What is Huffman coding? Construct the Huffman Tree and determine the code for each symbol in the sentence "ENGINEERING". 5. Threaded binary tree 6. Explain B tree and B+ Tree. 7. Expression Trees 8. Splay Tree and Trie. MODULE5 1. Write a function for BFS traversal of graph. 2. Various techniques of Graph representation MODULE6 1. Write a program in C to perform Quick sort. Show steps with example. 2. What is hashing? What is meant by collision? Using modulo division method insert the following values in a hash table of size 10. Show how many collisions occurred. 99, 33, 23, 44, 56 , 43, 19 3. Heap Sort 4, Using Linear probing and Quadratic Probing insert the following values in a hash table of Size 10. Show how many collisions occur in each iteration: 28, 55, 71, 67, 11, 10 90, 44. 5. Compare Quick Sort and Radix Sort based on their advantages and disadvantages. 6. Write a ‘C’ program to search a list using Indexed Sequential Search. What are the advantages of using Indexed Sequential Search over Sequential Search. 7. Write a program to implement binary search on sorted set of integers. 8. Explain Topological sorting with example. 9. Write a program in 'C' to implement Merge sort 
