Roll No..............
Total No.
of Questions : 07
B.Sc. (IT)
(Sem.–2nd)
DATA STRUCTURES
THROUGH C
Subject Code :
BS-108
Paper ID
: [B0408]
Time :
3 Hrs.
INSTRUCTION TO
CANDIDATES :
1) Section - A is Compulsory.
2) Attempt any Four questions from Section–B.
Section
–A
1. Write
short not e on:
a. What is an Algorithm?
b. What
is array of pointers?
c. What
are various operations on Strings ?
d. What
are linked List?
e. What
is linked representation of sparse Matrix?
f. Differentiate
between Postfix and Prefix notation .
g. What
is a priority Queue?
h. What
is dequeue?
i. What
are Binary search Tree?
j. What
is sorting?
Section
–B
2. Discus
the various common matrix operations . Elaborate your answer with suitable
programs in C.
3. What
is relationship between pointers and Strings?
Explain two dimensional array of strings
4. What
are circular linked lists? Explain the dulcet(), cirq-display function
associated with circular linked lists.
5. What
are Stacks ? what are the various application of stacks?
6. Explain
in detail the linked representation and Array representation of Binary tree.
7. Explain
in detail linear search and binary search.
0 comments:
Post a Comment
North India Campus