Download Question Paper of "Data Structures Through C 2 BSC(IT)" , Question Paper of BSC(IT) 2nd Semester, Subject Code : BS-108, Paper ID B0408, Paper 5

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.     Explain the following :

a.     What do you mean by data structure ?

b.     What are the various applications of queue?

c.      Define garbage collection.

d.     What do you mean by depth, maximum level of tree? Explain with an example.

e.      What do you mean by Reverse polish notation?

f.       What are the drawbacks of doubly linked list?

g.     What is the use of header node in a link list?

h.     Why do we need recursion?

i.       Convert the following infix expression into postfix expression.

j.       What do  you mean by sequential search?

Section –B

2.     What is complexity of an algorithm? How is it measured ? discuss time space trade an with an example.

3.       

a.     What are the limitations of arrays ? How can you overcome the limitations of arrays.

b.     Write a sub Algorithm to find the largest Element in the Array.

4.     List the various operation possible on singly linked list. Explain with diagrams.

5.     Write the algorithm for insertion add deletion in a queue using array.

6.     Write the Program in  C to sort the numbers using selection sort.

7.     Show the steps to insert the following elements into an empty binary search tree

50,34,32,45,12,67,62,80

Also write the algorithm to insert the elements into binary search tree.