Roll No .... .

480/2004
B. E. (CSE) EXAMINATION
(Third Semester)

DATA STRUCTURE

CSE-205-C

Time: Three Hours

Maximum Marks: 100

Note: Attempt any Five questio·ns. All 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. Define Data Structure. Explain various built-in data

structures in deta"il with ex~mples. 20
 7. (a) •Differentiate between depth tirst and breadth fi~t
2. Explain the following briefly:
traversal of a graph \)')1h their relative adVantages
(a) Sparse Matrices
and disadvantages. 10
(b) Multi-dimensional arrays (b)
Explain the im~ortance of minimum spanning ·tree
(c) Fast Transpose methods. 20 thorough examples .• 10

3. (a) Define Stalk. Explain various operations on stack 8. (a) Develop an algorithm for Heapsort .. Also discuss

with one example of each. 10

(b) Explain the following with their com plexity : (i)
(b) Write and explain an algorithm for converting an
Merge Sort
infix expr~.ssion to postfix expression. 10

4. (a) What is linear queue? How is it implemented

through array ? Describe various operations
which can be implemented on it 10
(b) Develop an algorithm for inserting and deleting
an element from a circular queue. 10

5, Develop and describe an algorithm for inserting and

deleting an element from any position from a doubly
linked list. 20

6. Describe the following briefly :

(a) Dynamic implementation of a binarytree (b)
Binary Tree Traversal

r.'
(c) Representation of a list as a binary. 20
480/2004 . 2 0-480/2004 .. 3
,.~*,;·.:;.~k$."'·' ""f'o, .. Cr,.';~di.'C; .• jj~'irill'I'~~a~iii(Af·"I:- ~J;';.:.·It=- . J ''I ~)!ft(.~I~'~~IT'1'l··:·ir~')(; ,"-hi" '0Trf