Babasaheb Bhimrao Ambedkar University 2007 B.E Computer Science Data structure - exam paper
Thursday, 17 January 2013 03:30Web
Q-82
SECOND YEAR OF COMPUTER SCIENCE AND ENGINEERING (PART-1) EXAMINATION, 2007
DATA STRUCTURE
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 program to implement Insertion and Deletion in doubly linked list.[Marks 8]
b) discuss an algorithm for merge sort.[Marks 8]
Q.2. 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.3. a) Write a C program to implement insertion and deletion in a singly linked list.[Marks 8]
b) discuss the Radix Sort with an example. [Marks 8]
Q.4. Write a short notes on any two: [Marks 18=9*2]
1.Comparison of sorting methods.
2.Traversals techniques in binary trees.
3.AVL tree.
SECTION-2
Q.5. a) what is hashing? discuss open Hashing and Closed Hashing. [Marks 8]
b) Write a C program to implement searching of numbers in a table using Hashing technique.[Marks 8]
Q.6. a) what is a binary tree? discuss its traversal methods.[Marks 8]
b) Write a ‘C’ program to implement deletion of node in a binary tree.[Marks 8]
Q.7. a) discuss collision resolution technique in hashing.[Marks 8]
b) discuss Heaps, its operations and its application.[Marks 8]
Q.8. 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]
| Earning: Approval pending. |
