DOEACC Society 2007 DOEACC B Level B2.1 Data Structure through 'C' Language - Question Paper

B2.1-R3: DATA STRUCTURES 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 Referring to the sample code provided beneath what will be new contents of array x.
int x[10] = {1,2,3,4,5,6,7,8,9,10};
int y = 20; int i = 10;
x[ - - i ] = y;
A) {1,2,3,4,5,6,7,8,9,10}
B) {20,2,3,4,5,6,7,8,9,10}
C) {1,2,3,4,5,6,7,8,9,20}
D) {1,2,3,4,5,6,7,8,20,10}
1.2 Depth 1st traversal of a graph produces
A) a spanning tree of the graph
B) a spanning forest of the graph
C) a minimal spanning tree
D) none of the above
1.3 int *p;
Refer to the above declaration which 1 of the subsequent statements are actual regarding
the expression ((char *)p)++?
A) It provide the 1st byte of the value pointed by p and increments p by 1.
B) It increases p by 1
C) This expression is not portable
D) It increments the 1st byte of the value pointed by p by 1.
B2.1-R3 Page one of five January, 2007
1.4 To insert a node at the end of the singly connected linked list having ‘p’ nodes, how
many nodes are to be traversed for this insertion operation?
A) p/2
B) p
C) 1
D) none of the above
1.5 In the text of the divide and conquer algorithm must contain at lowest
A) 1 recursive call
B) 2 recursive calls
C) Either 1 or zero calls
D) None of the above
1.6 Which of the subsequent statements is true?
A) A binary tree is always a heap
B) A heap is a full binary tree
C) A heap is a complete binary tree
D) Root of the heap is always the smallest element in the heap
1.7 The number of null pointers in a binary tree with k internal nodes is
A) k + 1
B) k – 1
C) k
D) The number depends on the slope of the tree
1.8 Which of the subsequent statement is false?
A) In a circular queue, overflow occurs less frequently than in a simple queue

Earning:   Approval pending.