Download Question Paper of "Data Structure 2" , Question Paper of BCA 2nd Semester, Subject Code : BC - 204, Paper ID B0208, Paper 10

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

Total No. of Questions : 07

BCA (Sem. – 2nd)

DATA STRUCTURES

Subject Code: (BC - 204)

Paper ID [B0208]

Time : 03 Hours

Instruction to Candidates:

1) Section - A is Compulsory.

2) Attempt any Four questions from Section - B.

Section - A

1.        

a.     What do you mean boy algorithm?

b.     What are the advantages of arrays over linked list?

c.     What do you mean by priority queen?

d.     What do you mean by binary trees? How they differ   

         from ordinary basic trees?

e.      Explain with example the polish notation.

f.       Describe the various operations that can be performed      on various data structures.

g.     Explain the concept  of a  heap.

h.     What is the concept of threading in trees.

i.      What is the concept of threading in trees?

j.      What are the applications of stacks?

Section- B

2.     In finding out the complexity of any algorithm, explain the time       space trade- off.

3.     What is the difference between a stack and Queue? Write an  

        algorithm to insert an item into a circular queue.

4.     Write an algorithm to sort a list of data items using bubble sort.

5.     Explain the difference between array and linked list in terms of       insertion and searching of any data items.

6.     How are binary trees represented in memory ? write an algorithm     for pre-order traversals of a binary tree.

7.     Give two examples of each linear and non-linear data structure.       Also give two applications for each example given by you.