## 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 2

• Wednesday, June 29, 2016
• • ,
• No comments

Roll No. ...........................
Total No. of Questions : 13]

# 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 is the need for using array in problem solving ?
b.     How can you initialize  an array?
c.      What is a pointer variable? What operations are permitted on a pointer variable?
d.     What is dynamic memory allocation?
e.      How can you declare an array of structures ? give one example.
f.       What are the various techniques to implement queues?
g.     Explain the Stack operations?
h.     What is  circular queue? What is its advantages ?
i.       What is  Dequeue? Where is it applicable ?
j.        Write four applications of Queues?
k.     What is difference between extended binary tree and Complete Binary tree?
l.       What is depth of a tree?
m.  Define preorder, inorder and postorder tree traversals .
n.     What are the various parameters to measure the efficiency of an algorithm?
o.     Comment on the statement” sorting is required for an efficient searching”

Section –B

2.     What are multidimensional arrays ? give example of some data for which a 3- dimensional array is needed.

3.     What do you mean by array of pointers? Explain its utility for storing two dimensional data.

4.     Write an algorithm to insert a node in a doubly linked list.

5.     Explain the concept of dynamic memory allocation and static memory allocation with the help of an example.

6.     Discuss how the stacks are used during tree traversals?

7.     Write steps to insert an element in a Dequeue.

8.     Write the linked list implementation of puch and Pop operations on stacks.

9.     Show the contents of a circular queue with capacity of holding 4 elements if following operations are performed in sequence:

D,C and B are added to queue.

One element  removed from queue.

E and  F Added to queue

One element removed from queue

G and D added to          queue.

10.  Define the following terms in context of binary trees”

(a)Height  (b) path length(c) leaf node (d)Root node (e) ancestor node

11.    How many comparisons are required in linear search and binary search to  search the number 45 in the following list:

12.    What is difference between binary search and linear search?

13.     Apply the insertion sort algorithm to sort the following elements :

12 43 11 20 42 35 53 23 18 40