4.

351
B. E. (Comp. Engg.) Vth Semester Examination
DATA STRUCTURE & PROGRAMMING
METHODOLOGY
Paper-CSE-303-B
Time allowed: 3 hours Maximum Marks: lOa

Note: Attempt any five questions.

1. (a) What is meant by userdefined data structure? How it differs

from built in data structure? List the name of
userdefined data structure? 10
(b) How stack can be implemented? Explain. 10

2. How queues can be implemented using pointer? Write

overflow and underflow condition. Write an algorithm to
Insert a value in queue. 20

3. (a) What are the pointer variables? How pointer variables

can be declared in Pascal? 5

(b) What are the records? Ho',,- r1k;;;ners of a rcco:d C~il be

accessed? Define a record having member: Name, Date
of Birth, list of marks of five subjects. 15

5. Define the graphs and trees. What is meant by traversal.

Describe the various traversal techniques. 20

s. How graphs can be represented llSlnE adjacency matnx :lnd

adjacency list. Which one is best') Discuss in depth. 20
351-P2--(<.)--X) dB) PTO.
 ( 2)

6. Write Linear search and Binary search algorithm. What is the

constraint on Bi~ary search? Which one is the best? Discuss
in depth. 20

7. Differentiate between Internal Sorting and External Sorting.

Write an algorithm to sort elements in descending order.
20

8. (a) Justify the need of linked list. How they differ from array?

(b) Hashing.
10,10

351