I am searching here question paper for DOEACC A Level A6- R3 Data Structure Through C Language Examination ?

Here I am giving you question paper for DOEACC A Level A6- R3 Data Structure Through C Language Examination in PDF file attached with it so you can get it easily.

Each question below gives a multiple choice of answers. Choose the most
appropriate one and enter in the “tear-off” answer sheet attached to the question
paper, following instructions therein.
(1 x 10)

1.1
To make a queue empty, elements can be deleted, till
A)
Front = rear+1
B)
Front = rear-1
C)
Front = rear
D)
None of the above.

1.2 A tree is known as BST if
A)
each node is greater than every node to its left subtree.
B)
each node is greater than every node to its right subtree.
C)
each node is less than every node to its left subtree.
D)
none of the above

1.3
If there are total n nodes, then memory compaction requires
A)
O (log2 n) steps
B)
O (n) steps
C)
O (n2) steps
D)
None of the above

1.4
Merge sort is worse than heap sort
A)
from time point of view
B)
from storage point of view.
C)
from time as well as storage point of view.
D)
none of the above

1.5
If the file contains data (61, 41, 91, 11) then the most suitable sorting technique is–
A)
Quick sort
B)
Radix sort
C)
Insertion sort
D)
None of the above

2.
Each statement below is either TRUE or FALSE. Choose the most appropriate one
and ENTER in the “tear-off” sheet attached to the question paper, following
instructions therein.
(1 x 10)
2.1
In a linked list, we can use binary search efficiently to search an element in the list.
2.2
The algorithm to convert an infix expression into postfix takes time proportional to n2
where n is the no. of symbols in the expression.
2.3
Recursions are slow as compare to iterations.
2.4
In a binary search tree the value of the node n is greater than every node to it’s left
subtree.
2.5
A stack is data structure having a fixed size.
2.6
Passing argument by value in a function is useful when the function does not need to
modify the original variable in the calling program.
2.7
Quick sort is always better than merge sort.
2.8
Interpolation search requires log2nlog2n to search an element from a list having n data
elements.
2.9
If in hashing all the n element of a list are clustered in the same bucket, the searching
time of any element will be O(1).

DOEACC A Level A6- R3 Data Structure Through C Language Exam paper