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

Total No. of Questions : 13] [Total No. of Pages : 02

J-3842[S-8007] [2037]
B.Sc. (IT)
DATA STRUCTURE IN C (B.Sc. (IT) - 202/204)
Time : 03 Hours Maximum Marks : 75
Instruction to Candidates:
1) Section - A is compulsory.
2) Attempt any Nine questions from Section - B.

Section - A

Q1) (15 x 2 = 30)

a) Which are the five standard streams of C language.
b) Explain the use of address operator?
c) Describe the restriction on processing of enumerated data type?
d) Which are the three methods of traversing a binary search tree?
e) Why sometimes stack is called pushdown list?
f) In what situation stack is called overflow? Show by example.
g) What is difference between ascending and descending priority queue?
h) What is the use of header node?
i) Why dynamic nodes are used in array?
j) How many trees exist with n nodes?
k) How a doubly linked list represents long integers of different signs?
l) What is Preorder, Postorder & Inorder.
m) In how many ways trees can be represented?
n) Show diagrammatically about the terms used in trees: father, son, brother,
degree, level.
o) Write briefly Recursive functions for finding a node in binary search
tree.

P.T.O.
 Section - B

(9 x 5 = 45)
Q2) Describe the process of allocation of memory by malloc and calloc functions.

Q3) What is the difference between circular linked list & singly linked list &
double linked list?

Q4) What are the conditions under which operations on queue can take place?
What is FIFO? What is its connection with stack?

Q5) Define : (i) root & subtree (ii) parent & children (iii) ancestors & descendants
(iv) leaf & siblings (v) internal & external nodes.

Q6) What is a path? How do you find the length, height & depth of the path?

Q7) Write a C function to delete a node from a circular-linked list.

Q8) How would you implement of stack of queues?

Q9) What are the advantages and disadvantages of representing a group of items
as an array verses a linear linked list?

Q10) How could we improve the search efficiency of basic search techniques?

Q11) Write about the followings and compare them: bubble sort and selection
sort.

Q12) Write a C function that accepts a pointer to a binary tree and a pointer to a
node of the tree and returns the level of the node in the tree.

Q13) Write a routine bubble in such a way so that successive passes go in opposite
directions.
!!!!!

J-3842[S-8007] -2-
Q.No.5
Q.No.6
Q.No.7
Q.No.8
Q.No.9
Q.No.lO Q.No.ll Q.No.12 -
Q.No.13