Pondicherry University 2006 B.Tech Computer Science and Engineering data structure - exam paper

Pondicherry university

(BTECH III semester)common to all branch

(UCC3201:MATHEMATICS-III)

(APRIL 2006)


unit I

1. a) Write algrothim to implement quick sort

b) discuss trend matching with example

or

2. a) explain different searching techniques in detail

b) analyze any 2 sorting algorithm in terms of time and space complexity

unit II

3a) write a program to implement queue operations

b) Implement circular linked list ?

or
4a) explain how polynomial addition is performed using linked list with necessary code?

b) explain garbage collection

Unit III

5a) explain the applications of binary trees

b) write notes on spanning trees with an example

or
6a) implement topological sorting

b) explain the depth 1st and breadth 1st traversal algorithm

unit IV

7a) elaborate symbol tables ? discuss

b) discuss the role of dynamic tables

or

8a) discuss static hashing with an example

b) Implement quatratic probing

Unit V

9a) Writye a detail note on indexed sequential files .

b) explain VSAM files

or

10a) how multiple keys are used to access the data ? discuss

b) explain about virtual hashing

Earning:   Approval pending.