22-mca-or-data Structures

OR

Code No: OR-22/MCA

MCA-II Semester Supplementary Examinations, July/Aug 2008. DATA STRUCTURES Time: 3hours

Max. Marks: 60 Answer any FIVE questions All questions carry equal marks ---

1.a) b)

Discuss the storage structures for arrays. What is meant by Sparse Matrix? Give one example, and discuss its importance.

2.a)

What is meant by a Queue? How to represent a queue by a vector? Write an algorithm for deleting an element from a queue. Draw the vector representation of a circular queue, and trace the operations on it.

b) 3.

What is polish notation? Explain expressions to polish notation.

4.a)

What is meant by a binary tree? Explain various binary tree traversals with an example. Discuss the recursive and nonrecursive traversals of binary trees.

b)

the

conversion

of

infix

5.

Write and explain with an example the depth first search algorithm.

6.a) b)

Write the algorithm for Bubble sort. Perform the Bubble sort for the following numbers: 42, 23, 74, 11, 65, 58, 94, 36, 99, 87.

7.a) b)

Discuss the binary search with an example. Explain the algorithm of merge sort with an example..

8.

Write short notes on any three of the following: a) Threaded binary trees b) Time complexity c) Quick sort d) Hashing. $$$