Welcome to Scribd. Sign in or start your free trial to enjoy unlimited e-books, audiobooks & documents.Find out more
Download
Standard view
Full view
of .
Look up keyword
Like this
6Activity
0 of .
Results for:
No results containing your search query
P. 1
A6-R3

A6-R3

Ratings: (0)|Views: 477|Likes:
Published by api-3782519

More info:

Published by: api-3782519 on Oct 16, 2008
Copyright:Attribution Non-commercial

Availability:

Read on Scribd mobile: iPhone, iPad and Android.
download as PDF, TXT or read online from Scribd
See more
See less

05/09/2014

pdf

text

original

A6-R3: DATA STRUCTURES THROUGH \u2018C\u2019 LANGUAGE
NOTE:
1.
There are TWO PARTS in this Module/paper. PART ONE containsF OU R questions
and PART TWO containsF OUR questions.
2.
PART ONE is to be answered in the TEAR-OFFANSWER SHEET only, attached to
the question paper, as per the instructions contained therein. PART ONE isN OT to
be answered in the answer book.
3.

Maximum time allotted for PART ONE is ONE HOUR. Answer book for PART TWO will be supplied at the table when the answer sheet for PART ONE is returned. However, candidates who complete PART ONE earlier than one hour, can collect the answer book for PART TWO immediately after handing over the answer sheet for PART ONE.

TOTAL TIME: 3 HOURS
TOTAL
MARKS: 100
(PART ONE-40; PART
TWO \u2013 60)
PART ONE
(Answer all the questions)
1.

Each question below gives a multiple choice of answers. Choose the most appropriate one and enter in the \u201ctear-off\u201d answer sheet attached to the question paper, following instructions therein.

(1 x 10)
1.1
A linear collection of data elements where the linear node is given by means of
pointer is called:
A)
linked list
B)
node list
C)
primitive list
D)
none of these
1.2
\u201cp\u201d is a pointer to the structure. A member \u201cmem\u201d of that structure is referenced by
A)
*p.mem
B)
(*p).mem
C)
*(p.mem)
D)
none of these
1.3
Which of the following cannot be performed recursively?
A)
binary Search
B)
quick sort
C)
depth First Search
D)
none of the above
1.4
Which of the following data structure may give 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 information of
A)
nodes
B)
edges
C)
direction of edges
D)
parallel edges
1.6
Which of the following is a hash function?
A)
floding
B)
quadratic probing
C)
chaining
D)
open addressing
1.7
Number of all possible binary trees with 4 nodes is
A)
14
B)
34
C)
24
D)
none of the above
1.8
\u201cn\u201d elements of the queue are to be reversed using another queue. The number of
\u201cADD\u201d and \u201cREMOVE\u201d required 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 below is either TRUE or FALSE. Choose the most appropriate one and ENTER in the \u201ctear-off\u201d sheet attached to the question paper, following instructions therein.

(1 x 10)
2.1
The average-case timing analysis is generally more difficult than the worst-case
timing analysis
2.2
Binary search performs efficiently on a linked list.
2.3
Any general tree can be converted to a binary tree.
2.4
A pre-order the post-order traversal sequence uniquely defines a tree.
2.5
Merge sort is not a stable sorting algorithm.
2.6
A tree is also a graph.
2.7
Quick soft will be more efficient, if the table to be sorted in initially almost sorted.
2.8
Stack is useful for implementing breadth first search.
2.9
A graph represents many to many relationships between nodes.
2.10 Insertion of a new element in a priority queue always occurs at the rear of the quque,
irrespective of its priority.
3.

Match words and phrases in column X with the closest related meaning/ word(s)/phrases in column Y. Enter your selection in the \u201ctear-off\u201d answer sheet attached to the question paper, following instructions therein.

(1 x 10)X
Y
3.1
Partition exchange sort
A.
Fibonacci tree
3.2
Used in sparse matrix
B.
Rehashing
3.3
Data structure as defined at logical levelC.
Stack
3.4
Vertex with no incident edges
D.
Depth-first
3.5
Collision resolution
E.
Theta notation
3.6
Data structure for backtracking
F.
Quick sort
3.7
Most sparse AVL tree
G.
Isolated vertex
3.8
Graph representation
H.
Circular list
3.9
Complexity measurement
I.
Abstract data type
3.10 Pre-order traversal
J.
Adjacency multilist
K.
Radix sort
L.
Linked list
4.

Each statement below has blank space to fit one of the word(s) or phrases in the list below. Enter your choice in the \u201ctear-off\u201d answer sheet attached to the question paper, following instructions therein.

(1 x 10)
A.Insertion
B.deletion
C.stack
D.queue
E.linked list
F.12
G.2
H.1
I.Log2n
J.one by one
K.doubly linked list
L.n+2*e
M.2*d
N.2*d \u2013 1
O.2*d + 1
P.ordered set
Q.24
4.1
_______ data structure is used to implement dynamic storage management.
4.2
Copying all or part of a linked list is node by taking first null list and inserting
elements_ __ _ __ _.
4.3
Time complexity of inserting an element to heap of \u201cn\u201d elements is of the order of
_______.

Activity (6)

You've already reviewed this. Edit your review.
1 hundred reads
1 thousand reads
Lassissi Afissou liked this
Mugalula Edward liked this
dzaoneni liked this
dzaoneni liked this

You're Reading a Free Preview

Download
scribd
/*********** DO NOT ALTER ANYTHING BELOW THIS LINE ! ************/ var s_code=s.t();if(s_code)document.write(s_code)//-->