Dr Bhim Rao Ambedkar University 2006 B.Tech Information Technology Data Structure - Question Paper
Sunday, 20 January 2013 10:15Web
Q-82
SECOND YEAR OF COMPUTER SCIENCE AND ENGINEERING (PART-1) EXAMINATION, 2006
Total Marks: 100
Time: 3.00pm to 6.00pm
Instructions: 1) Attempt any 3 ques. from every part.
2) Figures to right indicate full marks.
SECTION-1
Q.1. a) Write a ‘C’ program to implement priority queues.[Marks 8]
b) Write an algorithm to implement conversion of infix to postfix using stack.[Marks10]
Q.2. a) Write a program to implement Insertion and Deletion in doubly linked list.[Marks 8]
b) discuss an algorithm for merge sort.[Marks 8]
Q.3. a) Write a C program to implement Bubble sort on array of string.[Marks 8]
b) discuss linear search and Binary Search with an example.[Marks 8]
Q.4. Write a short notes on any two: [Marks 18=9*2]
1 Hashing Techniques.
2.Circular Linked List.
3.Heap Sort.
SECTION-2
Q.5. a) discuss collision resolution technique in hashing.[Marks 8]
b) discuss Heaps, its operations and its application.[Marks 8]
Q.6. a) Write a ‘C’ program to Implement Insertion in a Binary Search Tree.[Marks 8]
b) What causes deletion of a node in a binary search tree more difficult than insertion? discuss with example.[Marks 8]
Q.7. a) discuss the graph data structure and its storage representation.[Marks 10]
b) Write an algorithm for breadth 1st traversal of a graph.[Marks 6]
Q.8. Write short notes on: [Marks 18=6*3]
a) Advantages and disadvantages of Recursion.
b) B tree and B+ tree
c) Rehashing Techniques
| Earning: Approval pending. |
