NIELIT A Level July, 2014 A6-R4: DATA STRUCTURES THROUGH C++

NIELIT A Level July, 2014

A6-R4: DATA STRUCTURES THROUGH C++

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 “OMR” answer sheet supplied with the question paper, following

instructions therein. (1x10)

1.1 If h is any hashing function and is used to hash n keys in to a table of size m, where n<=m, the

expected number of collisions involving a particular key x is :

A) less than 1

B) less than n

C) less than m x n

D) less than 2xn

1.2 Let A be an adjacency matrix of a graph G. The ijth entry in the matrix AK , gives

A) The number of paths of length K from vertex Vi to vertex Vj

B) Shortest path of K edges from vertex Vi to vertex Vj

C) Length of a Hamiltonian cycle from vertex Vi to vertex Vj

D) Length of a Eulerian path from vertex Vi to vertex Vj

NIELIT A Level January, 2015 A6-R4: DATA STRUCTURES THROUGH ‘C++’

NIELIT A Level January, 2015

A6-R4: DATA STRUCTURES THROUGH ‘C++’

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 “OMR” answer sheet supplied with the question paper, following instructions therein. (1x10)

1.1 Suppose a queue is implemented by a circular array QUEUE [0..11].The number of elements
in the queue ,if FRONT =10 and REAR =3,will be
A) 3
B) 4
C) 5
D) 6
1.2 +/-MNP^+QR-UV is the prefix equivalent of
A) M-N/P+Q+R^U-V
B) MN-P/QR+UV-^+
C) MNP/-Q+R^UV-+
D) None of the above

NIELIT A Level July, 2015 A6-R4: DATA STRUCTURES THROUGH C++

NIELIT A Level July, 2015

A6-R4: DATA STRUCTURES THROUGH C++

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 “OMR” answer sheet supplied with the question paper, following instructions therein. (1x10)

1.1 +/-ABC^+DE-FG is the prefix equivalent of
A) A-B/C+D+E^F-G
B) AB-C/DE+FG-^+
C) ABC/-D+E^FG-+
D) None of the above
1.2 The most efficient search technique used in an ordered array is
A) Sequential search
B) Binary search
C) Interpolation search
D) None of the above
1.3 What does the following code segment do?
void fn( )
{
char c;
cin.get(c);
if (c != ‘\n’)
{
fn( );
cout.put(c);
}
}
A) The string entered is printed as it is.
B) The string entered is printed in reverse order.
C) It will go in an infinite loop.
D) It will print an empty line.

NIELIT A Level January, 2016 A6-R4: DATA STRUCTURE THROUGH C++

NIELIT A Level January, 2016

A6-R4: DATA STRUCTURE THROUGH C++

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 “OMR” answer sheet supplied with the question paper, following instructions therein. (1x10)

1.1 A graph has M vertices and N edges. How many edges does a Minimum Spanning Tree
has?
A) (N + M) – 1
B) N – 1
C) M – 1
D) N × M
1.2 A sequence of operations performed on the stack of the size 4 is as follows:
push(5), push(3), pop, push(4), push(6), push(7), pop, push(8), pop, push(1)
What is the condition of the stack after all these operations?
A) Stack overflow message is displayed.
B) Stack finally contains: 5, 3, 4, 6, 7, 8, 1
C) Stack finally contains: 5, 4, 6, 1
D) Stack finally contains: 5, 4, 8, 1