# MCQ's on Data Structure & Algorithm

You will find the correct answer of all the questions after you will submit the quiz. You will also get a report of your performance after you will submit the quiz.
Unlimited attempts possible to practice. On each attempts you will get a set of 25 questions.

MCQ 1:
When determining the efficiency of algorithm, the space factor is measured by

MCQ 2:

MCQ 3:
If the values of a variable in one module is indirectly changed by another module, this situation is called

MCQ 4:
In linear search algorithm the worst case occurs when?

MCQ 5:
For an algorithm the complexity of the average case is ?

MCQ 6:
The complexity of merge sort algorithm is _____________

MCQ 7:
When determining the efficiency of algorithm the time factor is measured by ______________________.

MCQ 8:
Why the elements of an array are stored successively in memory cells?

MCQ 9:
Which of the following data structure is not linear data structure?

MCQ 10:
The Average case occur in linear search algorithm.

MCQ 11:
Two main measures for the efficiency of an algorithm are _____________________.

MCQ 12:
Finding the location of the element with a given value is :

MCQ 13:
Which of the following case does not exist in complexity theory.

MCQ 14:
The operation of processing each element in the list is known as _______________.

MCQ 15:
Each array declaration need not give, implicitly or explicitly, the information about

MCQ 16:
Each data item in a record may be a group item composed of sub-items; those items which are indecomposable are called ?

MCQ 17:
Which of the following is two way list?

MCQ 18:
When inorder traversing a tree resulted E A C K F H D B G; the preorder traversal would return

MCQ 19:
The memory address of the first?element?of an array is called

MCQ 20:
What is the difference between linear array and a record?

MCQ 21:
Which of the following name does not relate to stacks?

MCQ 22:
The term push and pop is related to the

MCQ 23:
The memory address of fifth element of an array can be calculated by the formula

MCQ 24:
Two dimensional arrays are also called _____________________.

MCQ 25:
The situation when in a linked list START = NULL is _____________________.

MCQ 26:
A variable P is called pointer if

MCQ 27:
Which of the resulting data structure cannot store the non-homogeneous data elements?

MCQ 28:
Which of the following is not a limitation of binary search algorithm?

MCQ 29:
Binary search algorithm can not be applied to the

MCQ 30:
___________________ is not an operation performed on linear list

MCQ 31:
The complexity of Binary search algorithm is

MCQ 32:
Any node is the path from the root to the node is called?

MCQ 33:
The word "Stack" is also known as _________________.

MCQ 34:
An adjacency matrix representation of a graph cannot contain information of

MCQ 35:
A linear collection of data elements where the linear node is given by means of pointer is called

MCQ 36:
If A and A are 1000 and 1010 respectively are the address and each element occupies 2 bytes then the array has been stored in _________________ order

MCQ 37:
The property of binary tree is

MCQ 38:
A binary search tree whose left subtree and right subtree differ in height by at most 1 unit is called?

MCQ 39:
Representation of data structure in memory is known as _________________.

MCQ 40:
Which is/are the application(s) of stack?

MCQ 41:
________________ is a pile in which items are added at one end and removed from the other.

MCQ 42:
__________________ is not the component of data structure.

MCQ 43:
_________________ is very useful in situation when data have to stored and then retrieved in reverse order.

MCQ 44:
___________________ level is where the model becomes compatible executable code

MCQ 45:
Which of the following is true about the characteristics of abstract data types?
A) It exports a set of operations
B) It exports a type

MCQ 46:
Which of the following is not the part of ADT description?

MCQ 47:
Inserting an item into the stack when stack is not full is called _________________ Operation and deletion of item form the stack, when stack is not empty is called _______________ operation.

MCQ 48:
Which data structure allows deleting data elements from and inserting at rear?

MCQ 49:
Which of the following data structure can?t store the non-homogeneous data elements?

MCQ 50:
Process of inserting an element in stack is called __________________.

MCQ 51:
In a stack, if a user tries to remove an element from empty stack it is called ________________.

MCQ 52:
Process of removing an element from stack is called __________

MCQ 53:
A ________________ is a data structure that organizes data similar to a line in the supermarket, where the first one in line is the first one out.

MCQ 54:
Which of the following is non-liner data structure?

MCQ 55:
Herder node is used as sentinel in _________________.

MCQ 56:
Which data structure is used in breadth first search of a graph to hold nodes?

MCQ 57:
Identify the data structure which allows deletions at both ends of the list but insertion at only one end.

MCQ 58:
Which of the following data structure is non linear type?

MCQ 59:
Which of the following applications may use a stack?

MCQ 60:
Which of the following data structure is linear type?

MCQ 61:
To represent hierarchical relationship between elements, Which data structure is suitable?

MCQ 62:
Which of the statement(s) about stack data structure is/are NOT correct?

MCQ 63:
A directed graph is _________________ if there is a path from each vertex to every other vertex in the digraph.

MCQ 64:
In the _________________ traversal we process all of a vertex?s descendants before we move to an adjacent vertex.

MCQ 65:
Which one statement is True of False.
A) Network is a graph that has weights or costs associated with it.
B) An undirected graph which contains no cycles is called a forest.
C) A graph is said to be complete if there is no edge between every pair of vertices.

MCQ 66:
The number of comparisons done by sequential search is _____________________.

MCQ 67:
In _________________ search start at the beginning of the list and check every element in the list.

MCQ 68:
State True or False.
i) Binary search is used for searching in a sorted array.
ii) The time complexity of binary search is O(log n).

MCQ 69:
Which of the following is not the internal sort?

MCQ 70:
State True or False.
i) An undirected graph which contains no cycles is called forest.
ii) A graph is said to be complete if there is an edge between every pair of vertices.

MCQ 71:
A graph is said to be _________________ if the vertices can be split into two sets V1 and V2 such there are no edges between two vertices of V1 or two vertices of V2.

MCQ 72:
In a queue, the initial values of front pointer f rare pointer r should be ______________ and _____________ respectively.

MCQ 73:
In a circular queue the value of r will be _________________ .

MCQ 74:
Which of the following is not an inherent application of stack?

MCQ 75:
Which of the following statement is true?
i) Using singly linked lists and circular list, it is not possible to traverse the list backwards.
ii) To find the predecessor, it is required to traverse the list from the first node in case of singly linked list.

MCQ 76:
The advantage of ____________________ is that they solve the problem if sequential storage representation. But disadvantage in that is they are sequential lists.

MCQ 77:
What will be the value of top, if there is a size of stack STACK_SIZE is 5

MCQ 78:
_______________ is not the operation that can be performed on queue.

MCQ 79:
There is an extra element at the head of the list called a __________________.

MCQ 80:
A graph is a collection of nodes, called ________________ and line segments called arcs or ________________ that connect pair of nodes.

MCQ 81:
A _____________ is a graph that has weights of costs associated with its edges.

MCQ 82:
In general, the binary search method needs no more than ________________ comparisons.

MCQ 83:
Which of the following is not the type of queue?

MCQ 84:
State true or false.
i) The degree of root node is always zero.
ii) Nodes that are not root and not leaf are called as internal nodes.

MCQ 85:
Any node is the path from the root to the node is called?

MCQ 86:
Which statement is true or false.
A) A node is a parent if it has successor nodes.
B) A node is child node if out degree is one.

MCQ 87:
A _________________ is an acyclic digraph, which has only one node with indegree 0, and other nodes have in-degree 1.

MCQ 88:
_______________ is a directed tree in which outdegree of each node is less than or equal to two.

MCQ 89:
State true or false.
i) An empty tree is also a binary tree.
ii) In strictly binary tree, the out-degree of every node is either 0 or 2.

MCQ 90:
When new data are to be inserted into a data structure, but there is not available space; this situation is usually called _____________________.

MCQ 91:
A data structure where elements can be added or removed at either end but not in the middle is called ________________.

MCQ 92:
Operations on a data structure may be _________________.

MCQ 93:
The way in which the data item or items are logically related defines _____________________.

MCQ 94:
Which of the following are the operations applicable an primitive data structures?

MCQ 95:
The use of pointers to refer elements of a data structure in which elements are logically adjacent is _________________.

MCQ 96:
In a 2-tree, nodes with 0 children are called?

MCQ 97:
Arrays are best data structures

MCQ 98:
Which of the following statement is false?

MCQ 99:
The type of expression in which operator succeeds its operands is?

MCQ 100:
Which of the following data structure is non-linear type?

MCQ 101:
Which of the following is/are the levels of implementation of data structure

MCQ 102:
The logical or mathematical model of a particular organization of data is called a ___________.

MCQ 103:
The simplest type of data structure is _________________.

MCQ 104:
Which of the following data structures are indexed structures?

MCQ 105:
A ________________ does not keep track of address of every element in the list.

MCQ 106:
Which of the following data structure is linear type?

MCQ 107:
Linear arrays are also called ____________________.

MCQ 108:
Which of the following data structures are indexed structures?

MCQ 109:
Each node in a linked list has two pairs of ______________ and __________________.

MCQ 110:
When does top value of the stack changes?

MCQ 111:
Which of the following data structure is not linear data structure?

MCQ 112:

MCQ 113:
The complexity of selection sort is ______________.

MCQ 114:
A linear list in which each node has pointers to point to the predecessor and successors nodes is called as ..

MCQ 115:
A ________________ is a linear list in which insertions and deletions are made to from either end of the structure.

MCQ 116:
In a priority queue, insertion and deletion takes place at __________________

MCQ 117:
Which of the following is an application of stack?

MCQ 118:
The data structure which is one ended is _______________.

MCQ 119:
A list which displays the relationship of adjacency between elements is said to be

MCQ 120:
The time factor when determining the efficiency of algorithm is measured by

MCQ 121:
A singly linked list is also called as _____________.

MCQ 122:
The space factor when determining the efficiency of algorithm is measured by

MCQ 123:
The complexity of Bubble sort algorithm is

MCQ 124:
The indirect change of the values of a variable in one module by another module is called _________________.

MCQ 125:
Which of the following data structure is not linear data structure?

MCQ 126:
Which of the following data structure is linear data structure?

MCQ 127:
Other name for directed graph is _________________ .

MCQ 128:
Binary trees with threads are called as _____________.

MCQ 129:
If the elements A, B, C and D are placed in a stack and are deleted one at a time, what is the order of removal?

MCQ 130:
Graph G is _________________ if for any pair u, v of nodes in G there is a path from u to v or path from v to u.

MCQ 131:
In Binary trees nodes with no successor are called _________________.

MCQ 132:
A connected graph T without any cycles is called ________________.

MCQ 133:
Trees are said ___________________ if they are similar and have same contents at corresponding nodes.

MCQ 134:
Every node N in a binary tree T except the root has a unique parent called the ____________ of N.

MCQ 135:
In a graph if E = (u, v) means _____________

MCQ 136:
Sequential representation of binary tree uses _________________.

MCQ 137:
In a graph if e = [u, v], Then u and v are called _________________ .

MCQ 138:
TREE = NULL indicates tree is _____________________.

MCQ 139:
A binary tree whose every node has either zero or two children is called ________________.

MCQ 140:
Linked representation of binary tree needs _________________ parallel arrays.

MCQ 141:
The depth of complete binary tree is given by ________________.

MCQ 142:
Which indicates pre-order traversal?

MCQ 143:
In a extended-binary tree nodes with 2 children are called ?

MCQ 144:
A terminal node in a binary tree is called ?

MCQ 145:
Which of the following sorting algorithm is of divide and conquer type?

MCQ 146:
The queue in which the insertion takes place in the first position after of last element is a _____________________.

MCQ 147:
Before inserting into stack one must check the condition ________________.

MCQ 148:
The another name of dequeue is _____________.

MCQ 149:
Before deletion condition into stack __________________ has to be checked.

MCQ 150:
When does Top value of stack change in insertion process?

MCQ 151:
Deletion in the linked stack takes place by deleting ___________________.

MCQ 152:
The condition _________________ indicate the queue is empty.

MCQ 153:
Which of the following is not the type of queue?

MCQ 154:
The value of REAR is increased by 1 when ______________.

MCQ 155:
The operations that can be done in a circular queue is/are __________________.

MCQ 156:
The term dequeue is the contraction of the name ________________.

MCQ 157:
The various operations that can be performed on stacks is/are

MCQ 158:
_______________ is a collection of elements such that each element has been assigned a processing priority.

MCQ 159:
The deletion operation in stack is called _____________.

MCQ 160:
Link fields holds pointers to the _______________ element in the linked representation of stack.

MCQ 161:
The pointer associated with the stack is _____________.

MCQ 162:
Reversing a great deal of space for each stack in memory will be.

MCQ 163:
Finding the location of a given item in a collection of items is called _________________.

MCQ 164:
Which of the following is an external sorting?

MCQ 165:
Very slow way of sorting is _______________.

MCQ 166:
Which of the following is an internal sorting?

MCQ 167:
Sorting a file F usually refers to sorting F with respect to a particular key called _________________

MCQ 168:
The time complexity of quick sort is __________________.

MCQ 169:
The total number of comparisons in a bubble sort is _________________.

MCQ 170:
Selection sort first finds the ______________ element in the list and put it in the first position.

MCQ 171:
Quick sort is also known as _________________

MCQ 172:
The operation that combines the element is of A and B in a single sorted list C with n=r+s element is called _____________.

MCQ 173:
A tree sort is also known as _________________ sort.

MCQ 174:
_______________ sorting is good to use when alphabetizing large list of names.

MCQ 175:
The easiest sorting is ____________________.

MCQ 176:
Which of the following sorting algorithm is of divide and conquer type?

MCQ 177:
Merging k sorted tables into a single sorted table is called ________________.

MCQ 178:
The function used to modify the way of sorting the keys of records is called _____________.

MCQ 179:
If the number of record to be sorted large and the key is short, then ____________ sorting can be efficient.

MCQ 180:
If the number of record to be sorted large and the key is long, then ________________ sorting can be efficient.

MCQ 181:
The time complexity of heap sort is ________________.

MCQ 182:
If the number of records to be sorted is small, then _______________ sorting can be efficient.

MCQ 183:
The complexity of sorting algorithm measures the _______________ as a function of the number n of items to be sorter.

MCQ 184:
Complexity of linear search algorithm is _____________.

MCQ 185:
Sorting algorithm can be characterized as _________________.

MCQ 186:
For an internal sorting algorithms, which statement is True or False.
A) Internal sorting are applied when the entire collection if data to be sorted is small enough that the sorting can take place within main memory.
B) The time required to read or write is considered to be significant in evaluating the performance of internal sorting.

MCQ 187:
_____________ is putting an element in the appropriate place in a sorted list yields a larger sorted order list.

MCQ 188:
_____________ order is the best possible for array sorting algorithm which sorts n item.

MCQ 189:
_____________ is rearranging pairs of elements which are out of order, until no such pairs remain.

MCQ 190:
_____________ is the method used by card sorter.

MCQ 191:
_____________ sorting algorithm is frequently used when n is small where n is total number of elements.

MCQ 192:
Which of the following sorting algorithm is of priority queue sorting type?

MCQ 193:
Which of the following is not the required condition for binary search algorithm?

MCQ 194:
Partition and exchange sort is _________________ .