DOEACC Society 2006 DOEACC C Level C2 Data Structure through 'C' Language ( ) - Question Paper

C2-R3: DATA STRUCTURE THROUGH ‘C’ LANGUAGE
NOTE:
1. There are 2 PARTS in this Module/Paper. PART 1 contains 4 ques.
and PART 2 contains 5 ques..
2. PART 1 is to be answered in the TEAR-OFF ans SHEET only, attached to
the ques. paper, as per the instructions contained therein. PART 1 is NOT to
be answered in the ans book.
3. Maximum time allotted for PART 1 is 1 HOUR. ans book for PART TWO
will be supplied at the table when the ans sheet for PART 1 is returned.
However, candidates, who complete PART 1 earlier than 1 hour, can collect the
ans book for PART 2 immediately after handing over the ans sheet for
PART ONE.
TOTAL TIME: three HOURS TOTAL MARKS: 100
(PART 1 – 40; PART 2 – 60)
PART ONE
(Answer all the questions)
1. every ques. beneath provide a multiple option of answers. select the most
improper 1 and enter in the “tear-off” ans sheet attached to the ques.
paper, subsequent instructions therein. (1 x 10)
1.1 Maximum number of nodes in a binary tree of depth K
A) 2K-1
B) 2K
C) 2K -1
D) 2K +1
1.2 If the records to be sorted are in auxiliary storage, sorting is called
A) Internal
B) External
C) Stable
D) None of the above
1.3 An ordered set of items from which items may be deleted at either end and into which
items may be inserted at either end is called.
A) Queue
B) Stack
C) Heap
D) Dequeue
1.4 The property of hash function is that
A) it minimizes the rate of overflow
B) it preserves the order of key values.
C) it minimizes number of collisions.
D) none of the above.
1.5 Binary Search Tree is a
A) tree whose right and left sub-tree has value less than root.
B) tree whose right and left sub-tree has value more than root.
C) tree whose left sub-tree has value less than root and right sub-tree has value more than
root.
D) none of the above.
C2-R3 Page one of five July, 2006
1.6 A forest is found from a tree when
A) its children are removed
B) a sub-tree is removed
C) root of the tree is removed
D) none of the above
1.7 To implement the issue which checks whether parentheses, braces and brackets are in
proper position or not, stack has been used. If ((H)*{([J+K])}) is the expression, what will be
the content of stack from bottom when input pointer is at J.
A) ({([
B) (( ){([
C) {([( )
D) ( )({([
1.8 Which of the subsequent statements are true:
A) binary search is always better than sequential search.
B) binary search is better than sequential search when number of elements is small.
C) binary search is better than sequential search when number of elements is very large.

Earning:   Approval pending.