UNITED COLLEGE OF ENGINEERING & REARCH, GREATER NOIDA DEPARTMENT OF COMPUTER SCIENCE DATA STRUCTURE USING C [DS (CS

-301)]
IMPORTANT QUESTIONS FOR B.TECH (CS/IT) SECOND YEAR (III-SEM) ODD SEMSESTER 2013-14
Note: Model paper consists of Five sections you have to solve all the Sections and submit on date-20-11-2013

Section-A
Section A consists of Short answer questions. The answers are expected 50-75 words. 1. What is stack? 2. Why stack is called LIFO data structure? 3. Difference between prefix and postfix expression. 4. Distinguished b/w LIFO and FIFO. 5. Define the following term in Tree.
(i) Degree (ii) Depth (iii) Path 6. Difference b/w terminal node and non terminal node. 7. What is complete binary tree? 8. What is graph? 9. What Adjacency Matrices? 10. What is searching and sorting? 11. What is spanning Tree? 12. Write an algorithm to find out product of two matrices. 13. What is Link list? Describe its representation. 14. Define Heap data structure and maximum and minimum heap.

Section-B
Section B consists of Medium answer type questions. The answers are expected 100-200 words.
1. Describe asymptotic notation and Time and Space complexity.

VIVEK SRIVASTAVA(UCER-DATA STRUCTURE MODEL PAPER)

2. What is circular queue? How do you represent it? Write a C function to insert an item in the circular queue. 3. Write and explain the algorithm to find the 7th smallest element in array. 4. WAP in C to create an array of 10 elements. Take 10 element s in the array pass them to a function which prints the elements in reverse order. 5. Write an algorithm to evaluate an expression given in postfix notation. 6. Explain the following (i)Heap sort (ii) Radix sort (ii) B+Tree 7. Show the implementation of Stack as data structure using Linked List. 8. Write a function in C to sort given numbers using bubblesort. 9. Explain the merits and demerits of static and dynamic memory allocation techniques. 10. Discuss the queue data structure .What are the different types of queues? Explain them. 11. Explain the term Garbage collection and Compaction. 12. Write a program in C to perform this operation on queue and circular queue. (i) Insertion (ii) deletion (iii) display, with the help of both static and dynamic. 13. WAP in C to implement the Binary Search. 14. WAP in C to implement the Insertion Sort.

Section-C
Section C consists of Long answer type questions. The answers are expected 300-500 words.

1. Write an algorithm for Tower of Hanoi problem. Explain the solutions of the Tower of Hanoi problem where the number of disks is 5 and number is peg are 3. 2. Convert infix expression to their equivalent postfix expression. (a) A-B/C (b) ABC*D (c) (A+B)*D+E/ (F+G+D) 3. How a node deleted from the binary search tree? Explain the methods. 4. Write and Explain the BFS and DFS traversal algorithm. 5. Define the spanning tree. Write the prim`s algorithm to find the minimum cost spanning tree of the Following.

VIVEK SRIVASTAVA(UCER-DATA STRUCTURE MODEL PAPER)

6. Describe the Dijikstra`s algorithm for finding shortest path with the help of suitable example. 7. Write an algorithm for merge sort. Explain its complexities. Sort the following using merge sort: 75 10 20 70 80 90 100 40 30 50

8. Write an algorithm which does insertion and deletion in a Queue. 9. What do understand by hashing? What is the need of using it? Explain the collision resolution strategies used in hashing. 10. Write an algorithm for quick sort. Using your algorithm sort the given list of numbers. 24 13 58 169 47 3 58 12 98 65 6 10 18

11. Describe an AVL tree. How it is different from BST? Also discuss the different rotation done in AVL Tree. 12. Suppose the following sequence. Preorder Inorder G Q B B Q K A C C F K A F G P P D E E D R H H R

Draw the Binary tree. 13. Build Heap H from the following list of numbers. 9 2 1 5 3 4 3 6

14. Define Binary Search Tree (BST), and insert node of the following list of array and delete node 6. 7 3 9 1 4 8 10 2 5 6

15. Explain Huffmans Algorithm. Dataitem Weight A 22 B 5 C 11 D 19 E 2 F 11 G 25 H 5

Using Huffmans algorithm to create a tree. 16. WAP in C to perform following operations in Singly Linked List. (i) add (ii) delete (iii) display (iv) search (v) insert

VIVEK SRIVASTAVA(UCER-DATA STRUCTURE MODEL PAPER)