You are on page 1of 1

# BTS(C) IV 10 015 B Cusat Digital Library Service http://dspace.cusat.ac.

in/

## B. Tech Degree IV Semester Examination, April 2010

CS/IT 405 DATA STRUCTURES AND ALGORITHMS
(2006 Scheme)
Maximum Marks : 100
Time : 3 Hours
PART- A
(Answer ALL questions) (8 x 5 = 40)

## I. (a) What are multidimensional arrays?

List the time complexity of different sorting algorithms.
Explain how insertion and deletion are done in a Doubly Linked List.
Explain the role of Stack in postlix expression evaluation.
What is a complete binary tree?
Write the non-recursive algorithm for pre-order tree traversal.
What are the different ways to represent a graph in memory?
(h) What are B-trees?
PART B (4 x 15 = 60)

## Illustrate the working of quick sort algorithm.

OR
Ill. Explain Hashing in detail.

What is a Circular Queue? Write and explain the basic operations on a circular queue.
OR
Write notes no :
Tree
Binary Tree
(iii) AVL Tree

## Explain the different kinds of traversals on trees.

OR
Explain how searching and inserting are done in binary search trees.

## Explain the graph taversak methods.

OR
W..ite and illustrate the algorithans used to implement minimum spanning tree.
was

goe RING
44> A ot SC/EiVa
yrs.
Off;.2 'rvAvrt,
1Q1,734
/,:)tr