Mohan Lal Sukhadia University (MLSU) 2001 COMPUTER SCIENCE - -III (Data Structure Using Pascal) - Question Paper

Second Year exam of the
Three Year Degree Course, 2001
(Faculty of science )
COMPUTER SCIENCE
Paper-III
(Data Structure Using Pascal)
Time : three Hours
[ Maximum Marks :50]
Attempt any 5 questions,
selecting at lowest 1 ques. from every unit,
All ques. carry equal marks.

UNIT-I
1. (a) Compare Stack with Queue structure and also list their
applications.
(b) Write 2 functions Push and Pop for adding and removing an
element from the Stack.

2. (a) discuss how circular queue is a better structure compared to
linear queue.
(b) Write a procedure to print the largest increasing sequence from
the provided N numbers.

UNIT-II

3. (a) What do you understand by linked list? Compare its
advantages and disadvantages with respect to array.
(b) Write 2 functions for a linked list for creating a new node and
releasing a node.

4. (a) Draw the structure of a doubly linked list and discuss the utility
of head node.
(b) presume you are provided a sorted doubly linked list. Write two
procedures to print the values in ascending and descending order.


UNIT-III
5. (a) Draw a Binary Search Tree if the subsequent values are added in
an empty tree.:


(b) Write the output of the pre-order, in-order and post-order
traversal of the above tree created in (a).

6. (a) Write a function to obtain the successor of a node in a binary
search.
(b) Write a function to count number of nodes in a binary search
tree.

UNIT-IV
7. (a) Show the representation of the subsequent graph using
adjacency matrix and adjacency list: (b) Write an algorithm to determine whether the graph is
connected.

8. Write the algorithm to determine shortest path (distances) from
one source to all destinations and discuss it by taking an example.
UNIT-V

9. (a) Compare different searching methods.
(b) Write a resucursive function for binary search.

Earning:   Approval pending.