Dr Bhim Rao Ambedkar University 2005 B.Tech Information Technology Data Structure - exam paper

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

DATA STRUCTURE

Day and Date: Tuesday, 6-12-2005 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) 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.2. a) discuss the differences ranging from an ordinary tree and binary tree.[Marks 4]


b) Write an algorithm for detection of a node in binary tree.[Marks 8]


c) discuss HASH function.[Marks 4]




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) what is graph? discuss storage representation of a graph.[Marks 8]

b) Write an algorithm for depth 1st traversal of a graph.[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.