NIELIT A Level July, 2013 A6-R4: DATA STRUCTURES THROUGH ‘C++’

NIELIT A Level July, 2013

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 Given the sequence of numbers: 13, 52, 95, 26, 38
The sequence after the 3rd iteration of insertion sort is:
A) 13, 26, 52, 95, 38
B) 13, 52, 95, 26, 38
C) 13, 26, 38, 52, 95
D) 13, 26, 52, 95, 38
1.2 Given the following unbalanced tree:
Q
M
N
P
O
R

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

NIELIT A Level January, 2014

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 If given data is already in sorted then it will be a worst case of

A) Bubble sort

B) Selection sort

C) Insertion sort

D) Quick sort

1.2 Advantage of doubly linked list over singly linked list is in

A) Addition at head

B) Addition at tail

C) Deletion at head

D) Deletion at tail

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