DOEACC Society 2007 Advanced Level Course In Computer Science A6-R3: DATA STRUCTURES THROUGH ‘C’ LANGUAGE - Question Paper

A6-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 4 ques..

2. PART 1 is to be answered in the TEAR-OFFANSWER 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 2 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 ONE-40; PART 2 – 60)

PART ONE
(Answer all the questions)

1. Each 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 A linear collection of data elements where the linear node is provided by means of pointer is called:
A) linked list
B) node list
C) primitive list
D) none of these

1.2 “p” is a pointer to the structure. A member “mem” of that structure is referenced by
A) *p.mem
B) (*p).mem
C) *(p.mem)
D) none of these

1.3 Which of the subsequent cannot be performed recursively?
A) binary Search
B) quick sort
C) depth 1st Search
D) none of the above

1.4 Which of the subsequent data structure may provide overflow error, even though the current number of elements in it is less than its size?
A) stack
B) circular queue
C) simple queue
D) none of the above









1.5 An adjacency matrix representation of a graph cannot contain info of
A) nodes
B) edges
C) direction of edges
D) parallel edges

1.6 Which of the subsequent is a hash function?
A) floding
B) quadratic probing
C) chaining
D) open addressing

1.7 Number of all possible binary trees with four nodes is
A) 14
B) 34
C) 24
D) none of the above

1.8 “n” elements of the queue are to be reversed using a different queue. The number of “ADD” and “REMOVE” needed to do so is
A) 2*n
B) 4*n
C) n
D) the task can not be accomplished

1.9 If the in-order pre-order traversal of a binary tree are D,B,F,E,G,H,A,C and A,B,D,E,F,G,H,C respectively then
A) D,F,G,A,B,C,H,E
B) F,H,D,G,E,B,C,A
C) D,F,H,G,E,B,C,A
D) C,G,H,F,E,D,B,A

1.10 A stack cannot be used to
A) evaluate an arithmetic expression in postfix form
B) implement recursion
C) convert infix form to postfix from of an expression
D) allocate resources by operating system





















2. Each statement beneath is either actual or FALSE. select the most improper 1 and ENTER in the “tear-off” sheet attached to the ques. paper, subsequent instructions therein. (1 x 10)

Earning:   Approval pending.