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

• 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.     Write the syntax of multidimensional array of char.
b.     Write the application of pointer variable.
c.      What are the difficulties arise in processing a union?
d.     Compare features of linked list & sequential list?
e.      What are the characteristics of a binary tree?
f.       Describe the concept of modularization.
g.     When stack is called underflow?
h.     Define using example a null pointer?
i.       Write advantages of a list over an array/
j.       How many tree exist with n nodes and maximum level m?
k.     Write the techniques for compressing the left and right pointers of a node into a single field ? and why it is needed?
l.       Explain briefly traversing in Binary search trees.
m.  Explain the terms used in trees: ordered tree, oldest tree, descendent, ancestor .
n.     Write about straight selection sort.
o.     Compare linear & binary searching techniques.

Section –B

2.     Give different ways of inputting and outputting an array of number in terms of array and pointer notations.

3.     Give recursive & non – recursive algorithm of counting the number of nodes in a linked list,

4.     What are the condition under which operations on stack can take place? What is LIFO? What is its connection with queue?

5.      Elaborate the concept of a tree with reference to family tree. Describe different types of binary tree?

6.     Write a program to create a linked list with header & with out a header with the following numbers 44 95 36 112 369 7 9 & traverse both the list.

7.     Write a C function to traverse a circular –linked list visited every node.

8.     How would you implement a queue of stacks ?

9.     Write a set of routines for implementing several stacks and queue within a single array.

10.  Compare index sequential search and binary search . which one has a maximum  search efficiency?

11.   Write  about the followings and compare insertion sort and quick sort.

12.   Write a program for sorting of  n numbers.

13.   Write a C function that accepts a pointer to a node and return TRUE if that node  is the root of a valid binary tree and FALSE otherwise.