Data Structures Question Paper of 3rd Semester BCA Download Previous Years Question Paper 4

Roll No.

Total No. of Questions : 07

BCA (Sem.–3rd)

DATA STRUCURES

Subject Code : BSBC-302

Paper ID : [B0229]

Time : 3 Hrs.      

INSTRUCTION TO CANDIDATES :

1. Section-A is compulsory.

2. Attempt any Four questions form Section-B.

SECTION-A

1.                   

a.                 Define data structures.

b.                 What are double linked list? Explain in brief with diagram.

c.                  Describe in brief about the various data structures operations.

d.                 What is Big O notation?

e.                  What is the  difference between stacks and queues?

f.                   Differentiate between stacks and queues?

g.                 Enlist various sorting algorithms?

h.                 Define push and pop operations.

i.                   What is depth of a tree?

j.                   What are priority queues?

Section –B

2.                   

        a.                 What is algorithm ? what are its characteristics?

        b.                 How to find complexity of an algorithm? What is relation between time and complexity                      of an algorithm.

3.  What are linked lists? How are linked lists stored in memory? Explain various types of linked lists     with examples.

4.  What is selection sort technique? Give algorithm and example in support of your answer,

5.  What are stacks? How are stacks implemented in memory? What are the various stack operations?     Write algorithms for each.

6.  Differentiate between linear and binary search techniques. Explain with examples. Write an      

    algorithm to perform linear search on a list of N number.

7.  What are binary tree? Enlist various binary tree traversal techniques. Apply these techniques to     

    traverse the following tree: