Dr Bhim Rao Ambedkar University 2007 B.Tech Information Technology Discrete Mathmatical structure - exam paper

H-419
SECOND YEAR OF COMPUTER SCIENCE AND ENGINEERING (PART-1) EXAMINATION, 2007

DATA STRUCTURE

Total Marks: 100
Time: 2.30pm to 5.30pm

Instructions: 1) Attempt any 3 ques. from every part.

2) Figures to right indicate full marks


SECTION-1

Q.1. a) Show the status of array after every step in sorting the subsequent elements using heap sort:
95, 19, 44,8,32,75,25,65

b) discuss the subsequent with suitable examples: [Marks 8]

1) Linear search

2) Binary search

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) describe a data structure stack and discuss PUSH and POP operations of a stack.[Marks 8]

b) discuss a C program to implement Circular Queue using arrays.[Marks 10]


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) discuss closed hashing and open hashing.[Marks 8]


b) Write an algorithm for insertion and deletion into binary search tree.[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) 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.8. Write short notes on: [Marks 18=6*3]

a) B tree and B+ tree

b) Heaps, operations and its application

Earning:   Approval pending.