Roll No .................................. .

480/2003
B. E. EXAMINATION
(Third Semester)
COMPUTER ENGINEERING
CSE-205-C'

Data Structure

Time: Three Hours

Maximum Marks: toO

Note : Att.empt any Five questions. AIl questions carry equal

marks.
Before answering the question-paper candidates should
ensure that they have been supplied to correct and
complete question-paper. Complaints in this regard, if
any, will not be entertained after the examination.

1. (a) Differentiate between built-in and user-defined data types

with their relative advantages and
 (b) Define ordered list. List and explain the various
6. (a) Explain the various binary tree traversals with
operations on it through examples. 10
suitable examples of each. 10
2. (a) Define sparse matrix. For what purpose is it used ? Explain (b) Write short note on representation of infix, postfix
its importance through examples. 10 and prefix expressions using trees. 10
(b) Differentiate the following : 7. (a)
What is Minimum Spanning Tree ? For what purpose
(i) Two dimensional and Multi-dimensional IS it used ? Explian through an example. 10
arrays.
Describe the following with reference to graphs:
(ii) Structure and union data structures. 10 (b)
(i) Depth first traversal

3. Define Stack. Discuss its importance through various (ii) Transitive closure.

applications in Comput(~r Science in detail with suitable

Explain Heap sort with an algorithm. Also discuss
examples. 20 10
8. (a) its complexity. 10

4. (a) Differentiate between linear and circular queue Describe the following with their complexity :
with their relative merits and demerits. 10 (b) (i) Binary search

(b)' Develop an algorithm for applying ins'eItion and (ii) Merge sort. 10

. deletion operations on Ii circular queue. 10

5. (a) Develop an algorithm for inserting and deleting an element

at any position in a doubly linked list. 10
(b) Distinguish between array and dynamic implementation
of linkyd lists with their relative advantages and
disadvantages. 10
4&Q/2.00'30