NIELIT A Level July, 2010 A6-R4: DATA STRUCTURE THROUGH C++

NIELIT A Level  July, 2010

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 “tear-off” answer sheet attached to the question paper, following instructions therein. (1x10)

1.1 Given two sorted list of size ‘m’ and ‘n’ respectively. The number of comparisons needed
in the worst case by the merge sort algorithm will be
A) m*n
B) maximum of m, n
C) minimum of m, n
D) m + n –1
1.2 The postfix equivalent of the prefix * + ab – cd is
A) ab + cd – *
B) abcd + – *
C) ab + cd* –
D) ab + – cd*

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

NIELIT A Level January, 2011

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 “tear-off” answer sheet attached to the question paper, following instructions therein. (1x10)

1.1 For linear search in an array of n elements the time complexity for best case is.
A)
2
n
O
B) O(n)
C) O(1)
D)
 −
2

NIELIT A Level July, 2011 A6-R4: DATA STRUCTURE THROUGH C++

NIELIT A Level July, 2011

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 “tear-off” answer sheet attached to the question paper, following instructions therein. (1x10)

1.1 Identify the incorrect statement.
A) The resources most relevant in relation to efficiency are CPU time and internal memory.
B) An algorithm cannot have same Big-O measure for the worst case and the best case.
C) Worst case complexity of an algorithm can be determined by choosing a set of input conditions
that force the algorithm to make the least possible progress towards its final goal at each step.
D) Algorithms having exponential complexity can be practically solved only for very small values
of n.
1.2 The correct ADT of pop operation of a stack is
A) Function: Adds newItem to the top of stack
Precondition: Stack has been initialized
Postcondition: If (stack is full), exception fullStack is thrown,
else newItem is at the top of the stack
B) Function: Adds newItem to the top of stack
Precondition: Stack has been initialized
Postcondition: If (stack is empty), exception emptyStack is thrown,
else top element is removed from the stack
C) Function: Removes top element from the stack
Precondition: Stack has been initialized
Postcondition: If (stack is empty), exception emptyStack is thrown,
else top element is removed from the stack
D) Function: Removes top element from the stack
Precondition: Stack has been initialized
Postcondition: If (stack is full), exception FullStack is thrown,
else newItem is at the top of the stack

NIELIT A Level January, 2012 A6-R4: DATA STRUCTURES THROUGH C++

NIELIT A Level January, 2012

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 “tear-off” answer sheet attached to the question paper, following instructions therein. (1x10)

1.1 Array M[5,6] is stored in memory in row-major order and base address of M =200. If there are
4 words per memory cell then address of M[2,3] is
A) 250
B) 252
C) 254
D) 256
1.2 Sparse matrices are the matrices with
A) Less proportion of zeros
B) High proportion of zeros
C) No zeros
D) None of the above