MCQOPTIONS
Saved Bookmarks
MCQOPTIONS
This section includes 721 Mcqs, each offering curated multiple-choice questions to sharpen your Technical Programming knowledge and support exam preparation. Choose a topic below to get started.
| 151. |
The length of the string can be listed as an additional item in _____________. |
| A. | base pointer. |
| B. | pointer array. |
| C. | node. |
| D. | record. |
| Answer» C. node. | |
| 152. |
The comparison tree is also called as________. |
| A. | decision tree. |
| B. | binary tree. |
| C. | sequential tree. |
| D. | b+ tree. |
| Answer» B. binary tree. | |
| 153. |
What is the average case complexity of selection sort? |
| A. | O(nlogn) |
| B. | O(logn) |
| C. | O(n) |
| D. | O(n2) |
| Answer» E. | |
| 154. |
____________ has certain attributes or properties which may be assigned values. |
| A. | field system. |
| B. | record. |
| C. | entity. |
| D. | files. |
| Answer» D. files. | |
| 155. |
Breadth First search is used in____________. |
| A. | binary tree. |
| B. | stacks. |
| C. | graphs. |
| D. | both a and c. |
| Answer» D. both a and c. | |
| 156. |
For a given graph G having v vertices and e edges which is connected and has no cycles, which ofthe following statements is true? |
| A. | v=e |
| B. | v = e+1 |
| C. | v + 1 = e |
| D. | v = e-1 |
| Answer» C. v + 1 = e | |
| 157. |
The situation in linked list START = NULL is called_________ |
| A. | Overflow |
| B. | Underflow |
| C. | Zero |
| D. | None of the above |
| Answer» C. Zero | |
| 158. |
STACK is also called as ______________. |
| A. | FIFO |
| B. | LIFO |
| C. | FOLI |
| D. | FOFI |
| Answer» C. FOLI | |
| 159. |
If a simple graph G, contains n vertices and m edges, the number of edges in the GraphG'(Complement of G) is |
| A. | (n*n-n-2*m)/2 |
| B. | (n*n+n+2*m)/2 |
| C. | (n*n-n-2*m)/2 |
| D. | (n*n-n+2*m)/2 |
| Answer» B. (n*n+n+2*m)/2 | |
| 160. |
The maximum number of nodes in a tree for which post-order and pre-order traversals may beequal is |
| A. | 3 |
| B. | 1 |
| C. | 2 |
| D. | any number |
| Answer» C. 2 | |
| 161. |
The complexity of Bubble sort algorithm is _________. |
| A. | O(n). |
| B. | O(log n). |
| C. | O(n2). |
| D. | O(n log n). |
| Answer» D. O(n log n). | |
| 162. |
The number of edges from the root to the node is called of the tree. |
| A. | Height |
| B. | Depth |
| C. | Length |
| D. | Width |
| Answer» C. Length | |
| 163. |
In a stack, if a user tries to remove an element from empty stack it is called |
| A. | Underflow |
| B. | Empty collection |
| C. | Overflow |
| D. | Garbage Collection |
| Answer» B. Empty collection | |
| 164. |
Which of the following c code is used to create new node? |
| A. | ptr = (NODE*)malloc(sizeof(NODE)); |
| B. | ptr = (NODE*)malloc(NODE); |
| C. | ptr = (NODE*)malloc(sizeof(NODE*)); |
| D. | ptr = (NODE)malloc(sizeof(NODE)); |
| Answer» B. ptr = (NODE*)malloc(NODE); | |
| 165. |
Find the postorder traversal of the binary tree shown below. |
| A. | P Q R S T U V W X |
| B. | W R S Q P V T U X |
| C. | S W T Q X U V R P |
| D. | none |
| Answer» D. none | |
| 166. |
The OS of a computer may periodically collect all the deleted space onto the free storage list. Thistechnique is called______________. |
| A. | buffering. |
| B. | garbage collection. |
| C. | deal location. |
| D. | buffer collection. |
| Answer» C. deal location. | |
| 167. |
Given a plane graph, G having 2 connected component, having 6 vertices, 7 edges and 4 regions.What will be the number of connected components? |
| A. | 1 |
| B. | 2 |
| C. | 3 |
| D. | 4 |
| Answer» C. 3 | |
| 168. |
The time factor when determining the efficiency of algorithm is measured by____________. |
| A. | counting microseconds. |
| B. | counting the number of key operations. |
| C. | counting the number of statements. |
| D. | counting the kilobytes of algorithm. |
| Answer» C. counting the number of statements. | |
| 169. |
Graph traversal is different from a tree traversal, because |
| A. | trees are not connected. |
| B. | graphs may have loops. |
| C. | trees have root. |
| D. | None is true as tree is a subset of graph. |
| Answer» D. None is true as tree is a subset of graph. | |
| 170. |
Statement 1: Shell sort is a stable sorting algorithm.Statement 2: Shell sort is an in-place sorting algorithm. |
| A. | Both statements are true |
| B. | Statement 2 is true but statement 1 is false |
| C. | Statement 2 is false but statement 1 is true |
| D. | none |
| Answer» C. Statement 2 is false but statement 1 is true | |
| 171. |
In a directed tree if the ordering of the nodes at each level is prescribed then such a tree is called_______tree. |
| A. | directed. |
| B. | structure. |
| C. | ordered. |
| D. | degree of. |
| Answer» D. degree of. | |
| 172. |
Process of inserting an element in stack is called |
| A. | Create |
| B. | Push |
| C. | Evaluation |
| D. | Pop |
| Answer» C. Evaluation | |
| 173. |
The advantage of a two-way list and a circular header list is combined into a ________. |
| A. | two-way circular header list. |
| B. | two-way circular list. |
| C. | two-way header circular list. |
| D. | None. |
| Answer» B. two-way circular list. | |
| 174. |
In which of the following self – balancing binary search tree the recently accessed element can beaccessed quickly? |
| A. | AVL tree |
| B. | AA tree |
| C. | Splay tree |
| D. | Red – Black tree |
| Answer» D. Red – Black tree | |
| 175. |
A linked list whose last node points back to the list node instead of containing the null pointer________. |
| A. | circular list. |
| B. | linked list. |
| C. | circular doubly linked list. |
| D. | doubly linked list. |
| Answer» B. linked list. | |
| 176. |
Consider the usual algorithm for determining whether a sequence of parentheses is balanced. Suppose that you run the algorithm on a sequence that contains 2 left parentheses and 3 right parentheses (in some order). The maximum number of parentheses that appear on the stack AT ANY ONE TIME during the computation? |
| A. | 1 |
| B. | 2 |
| C. | none |
| D. | none |
| Answer» C. none | |
| 177. |
______________ a tree means processing it in such a way that each node is visited only once. |
| A. | Traversing. |
| B. | Implement. |
| C. | Partition. |
| D. | Node. |
| Answer» B. Implement. | |
| 178. |
In linked list each node contain minimum of two fields. One field is data field to store the datasecond field is? |
| A. | Pointer to character |
| B. | Pointer to integer |
| C. | Pointer to node |
| D. | Node |
| Answer» D. Node | |
| 179. |
Which of the application may use a stack? |
| A. | Expression Evaluation |
| B. | Keeping track of local variables at run time. |
| C. | Syntax analyzer for a compiler |
| D. | All of the above. |
| Answer» B. Keeping track of local variables at run time. | |
| 180. |
What would the time complexity to check if an undirected graph with V vertices and E edges isBipartite or not given its adjacency matrix? |
| A. | O(E*E) |
| B. | O(V*V) |
| C. | O(E) |
| D. | O(V) |
| Answer» C. O(E) | |
| 181. |
What would be the asymptotic time complexity to insert an element at the front of the linked list(head is known)? |
| A. | O(1) |
| B. | O(n) |
| C. | O(n2) |
| D. | O(n3) |
| Answer» B. O(n) | |
| 182. |
__________________ is a header list where the last node contains the null pointer. |
| A. | Circular Header linked list |
| B. | Grounded Header Linked list |
| C. | Linked list |
| D. | Linear Array |
| Answer» C. Linked list | |
| 183. |
The number of interchanges required to sort 5, 1, 6, 2 4 in ascending order using Bubble Sort is____________. |
| A. | 6 |
| B. | 5 |
| C. | 7 |
| D. | 8 |
| Answer» C. 7 | |
| 184. |
In general, the index of the first element in an array is |
| A. | 0 |
| B. | -1 |
| C. | 2 |
| D. | 1 |
| Answer» B. -1 | |
| 185. |
What is missing? |
| A. | Height(w-left), x-height |
| B. | Height(w-right), x-height |
| C. | Height(w-left), x |
| D. | Height(w-left) |
| Answer» B. Height(w-right), x-height | |
| 186. |
A tree is a finite set of_________. |
| A. | loops. |
| B. | domains. |
| C. | functions. |
| D. | nodes. |
| Answer» E. | |
| 187. |
A binary tree of depth "d" is an almost complete binary tree if __________. |
| A. | each leaf in the tree is either at level. |
| B. | for any node. |
| C. | both a and b. |
| D. | None. |
| Answer» D. None. | |
| 188. |
A linear list of elements in which deletion can be done from one end (front) and insertion can takeplace only at the other end (rear) is known as a ? |
| A. | Queue |
| B. | Stack |
| C. | Tree |
| D. | Linked list |
| Answer» B. Stack | |
| 189. |
How many orders of traversal are applicable to a binary tree (In General)?3 |
| A. | 1 |
| B. | 4 |
| C. | 2 |
| D. | 3 |
| Answer» E. | |
| 190. |
Collection of related data items is called _______. |
| A. | files |
| B. | fields |
| C. | attributes. |
| D. | records. |
| Answer» E. | |
| 191. |
The average number of key comparisons done in a successful sequential search in a list of length nis___________. |
| A. | log n |
| B. | n-1/2. |
| C. | n/2. |
| D. | n+1/2. |
| Answer» E. | |
| 192. |
Process of inserting an element in stack is called ____________. |
| A. | Create |
| B. | Push |
| C. | Evaluation |
| D. | Pop |
| Answer» C. Evaluation | |
| 193. |
The efficiency of a BFS algorithm is dependent on _______. |
| A. | Algorithm. |
| B. | Tree. |
| C. | Problem. |
| D. | Graph. |
| Answer» E. | |
| 194. |
Elements in an array are accessed |
| A. | randomly |
| B. | sequentially |
| C. | exponentially |
| D. | logarithmically |
| Answer» B. sequentially | |
| 195. |
How do the nested calls of the function get managed? |
| A. | Through Queues. |
| B. | Through Stacks. |
| C. | Through Trees. |
| D. | Through Graphs. |
| Answer» C. Through Trees. | |
| 196. |
What is the worst-case time for heap sort to sort an array of n elements? |
| A. | O(log n). |
| B. | O(n). |
| C. | O(n log n). |
| D. | O(n²). |
| Answer» D. O(n²). | |
| 197. |
A binary search tree contains values 7, 8, 13, 26, 35, 40, 70, 75. Which one of the following is a validpost-order sequence of the tree provided the pre-order sequence as 35, 13, 7, 8, 26, 70, 40 and 75? |
| A. | 7, 8, 26, 13, 75, 40, 70, 35 |
| B. | 26, 13, 7, 8, 70, 75, 40, 35 |
| C. | 7, 8, 13, 26, 35, 40, 70, 75 |
| D. | 8, 7, 26, 13, 40, 75, 70, 35 |
| Answer» E. | |
| 198. |
A list that has no nodes is called________. |
| A. | End list. |
| B. | Zero list. |
| C. | Null list. |
| D. | Sentinel list. |
| Answer» D. Sentinel list. | |
| 199. |
In linear search algorithm the Worst case occurs when ____________. |
| A. | The item is somewhere in the middle of the array. |
| B. | The item is not in the array at all. |
| C. | The item is the last element in the array. |
| D. | The item is the last element in the array or is not there at all. |
| Answer» E. | |
| 200. |
A _________is a linked list which always contains a special node called the header node, at the beginningof the list. |
| A. | Doubly Linked List. |
| B. | Circular List. |
| C. | Header Linked List. |
| D. | None. |
| Answer» D. None. | |