# Cochin University of Science and Techology (CUST) 2008 B.Tech Information Technology data structures and algorithms - Question Paper

Monday, 27 May 2013 02:15Web

BTECH DEGREE IV SEMESTER exam APRIL 2008

DATA STRUCTURES & ALGORITHMS

**Time:**3 Hrs Max marks:100

**PART A**

1.

**a)**Differentiate b/w selection & bubble sorting techniques.

**b)**discuss various hashing functions.

**c)**Differentiate b/w singly linked list& doubly linked list.

**d)**discuss the procedure for the conversion of infix expressions to postfix expression.

**e)**elaborate significance of expression trees?

**f)**How trees are represented using linked lists?

g) discuss prims algorithm for the construction of minimum spanning tree.

h) elaborate adjacency matrices? What is its role in graph representation?

**PART B**

**2.**explain the different searching algorithms & discuss how complexity can be

determined.

OR

**3.**With a suitable eg show how quick sort & heap sort take place.

**4.**

**a)**Differentiate b/w queues dequeues.

**b)**discuss how priority queues are being implemented.

OR

**5.**Briefly discuss the procedure for the valuation of post fix expression.

**6.**Briefly explain about the different binary tree traversal techniques

OR

**7.**elaborate AVL trees? discuss how it is being represented in memory?

**8.**What is meant by ‘minimum spanning tree’? discuss any technique for the

implementation of minimum spanning tree.

OR

**9.**

**a)**explain the different graph transversal techniques.

**b)**discuss Dijkstras algorithm.

-----------------------------------------------

Earning: Approval pending. |