Download Question Paper of "Data Structures 2 BSC IT(D)" , Question Paper of BSC IT(D) 2nd Semester, Subject Code : DCA-201, Paper ID A0306, Paper 1

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

Total No. of Questions : 13]                                       

PAPER ID[A0306]

B.Sc. (IT-201/204)DCA(SEM.-2^nd)

DATA STRUCTURES

Time : 03 Hours                                                            

Instruction to Candidates:

1)             Section - A is  Compulsory.

2)             Attempt any Nine questions from Section -  B.

Section –A

1.      

a.     What do you mean by a data structure?

b.     What is an array? How memory is allocated to arrays?

c.      Define linked list?

d.     What are the advantages of linked lists over arrays ?

e.      What is  a pointer? How can you declare a pointer  to a structure?

f.       Write four applications of Stacks.

g.     What are queues? Give two examples of use of queues in computer system.

h.     What are priority queues?

i.       If we always make insertion and deletion only at the start of a linked list, then which data structure it will represent?

j.       Perform insert and delete operation on a circular Queue? Show the operations with the help of a diagram.

k.     What are the three Search trees?

l.       What are the three traversal techniques for Binary trees? In what sequence the nodes are traversed in them?

m.  What is recursion ? what are its application?

n.     What is the complexity of binary search. Insertion sort, bubble sort  and quick sort algorithms?

o.     What are the conditions under which binary search or liner search is applicable?

Section – B

2.     Write steps to insert an element ITEM at location LOC in an array A[]

3.     What is difference between call by value and call by reference ? explain with example.

4.     Write a procedure to search an element Key from a  sorted linked list.

5.     Write steps to delete an element from a linked list.

6.     What are the conditions for overflow and underflow for a circular queue?

7.     Write algorithm to reverse a string using stack.

8.     Write procedure to insert an element in a circular queue.

9.     Implement stack using linked list.

10.   Apply Quick sort algorithm to sort following elements:

 4,13,15,7,25,19,20,22,28,39

11.   Draw the binary tree corresponding to flowing traversal sequences:

 Inorder: D B F E A H G C  L J  H  K

 Postorder: D F E B G L J K H C A

12.  Construct the binary search tree if the following element are inserted in it in the   given sequence:

  14 45 16 22 12 65 43 33 18 30

13.  What are the steps to delete a node in BST? Explain with the help help of an example.