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

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

Total No. of Questions : 07

Paper ID [B0208]

(Please fill this Paper ID in OMR, Sheet)

BCA (Sem. – 2nd)

DATA STRUCTURES (BC - 204)

Time : 03 Hours

Instruction to Candidates:

1) Section - A is Compulsory.

2) Attempt any Four questions from Section - B.

Section - A

Ql)

a)     What is a big O notation?

b)    What is a top pointer of stack?

c)     What is a post order traversal?

d)    What is the difference between data and information?

e)     What is the complexity of linear search?

f)      What is a threaded binary tree?

g)     What are the front and rear pointers of queue?

h)    What is need for garbage collection?

i)       What is an algorithm?

j)       How binary tree is represented as an doubly link list

Section - B

Q2) Suppose the names of few students of a class are as below :

Ram

Sham

Mohan

Sohan

Vimal

Komal

It is assumed that the names of the students is represented as a single link

list. Write an algorithm to insert the name of a student RAMAN between

Sham and Mohan. Represent it graphically also.

Q3)    What is the postfix and prefix representation of the following expression

(A* (b + c)) + (b/d) * a* z

        (a+(b+c*(d+e)))+f

Q4)    What are the various operations possible on stacks. Explain the algorithm for each of them?

QS)   Show the result of insertion E 6,3, 5,8, 12, 15, 18, 19,20,24 into an empty binary search tree.

Q6)    What are the various binary tree traversal techniques?

          Discuss with example and algorithm.

Q7)    Suppose a sequence of numbers is given like : 5, l, 6, 7,9, 22, 10, 55, 45, 34, how this numbers will be sorted in

(a) Insertion sorting.

(b) Bubble sorting.

(c) Quick sorting.