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.
| 201. |
The efficient searching algorithm for algorithm for a sorted array is _________. |
| A. | Binary search. |
| B. | Linear search. |
| C. | Indexed search. |
| D. | Repeated search. |
| Answer» B. Linear search. | |
| 202. |
Shell sort is applied on the elements 27 59 49 37 15 90 81 39 and the chosen decreasing sequence of increments is (5,3,1). The result after the first iteration will be |
| A. | 27 59 49 37 15 90 81 39 |
| B. | 27 59 37 49 15 90 81 39 |
| C. | 27 59 39 37 15 90 81 49 |
| D. | 15 59 49 37 27 90 81 39 |
| Answer» D. 15 59 49 37 27 90 81 39 | |
| 203. |
If Hibbard increments (h1= 1, h2= 3, h3= 7, …, hk = 2k–1) are used in a Shell sortimplementation, then the best case time complexity will be |
| A. | O(nlogn) |
| B. | O(n) |
| C. | O(n2) |
| D. | O(logn) |
| Answer» B. O(n) | |
| 204. |
Which of the following is a combination of LSD and MSD radix sorts? |
| A. | Forward radix sort |
| B. | 3-way radix quick sort |
| C. | Trie base radix sort |
| D. | Flash sort |
| Answer» B. 3-way radix quick sort | |
| 205. |
A connected planar graph having 6 vertices, 7 edges contains regions. |
| A. | 15 |
| B. | 3 |
| C. | 1 |
| D. | 11 |
| Answer» C. 1 | |
| 206. |
An AVL tree is a self – balancing binary search tree, in which the heights of the two child sub treesof any node differ by |
| A. | At least one |
| B. | At most one |
| C. | Two |
| D. | At most two |
| Answer» C. Two | |
| 207. |
What is the best case efficiency of bubble sort in the improvised version? |
| A. | O(nlogn) |
| B. | O(logn) |
| C. | O(n) |
| D. | O(n2) |
| Answer» D. O(n2) | |
| 208. |
What is the space complexity of the post-order traversal in the recursive fashion? (d is the treedepth and n is the number of nodes) |
| A. | O(1) |
| B. | O(nlogd) |
| C. | O(logd) |
| D. | O(d) |
| Answer» E. | |
| 209. |
The unit equal to the number of bits needed to represent a character is called a ________. |
| A. | byte. |
| B. | bit. |
| C. | mega bytes. |
| D. | kilo bytes. |
| Answer» B. bit. | |
| 210. |
Uniform distribution of the hash address throughout the given set L is __________. |
| A. | reduce the number of collision. |
| B. | increase the number of collision. |
| C. | totally avoid collision. |
| D. | manage address. |
| Answer» B. increase the number of collision. | |
| 211. |
Using division method, in a given hash table of size 157, the key of value 172 be placed at position |
| A. | 19 |
| B. | 72 |
| C. | 15 |
| D. | 17 |
| Answer» D. 17 | |
| 212. |
An edge E is called _________ if it has identical endpoints. |
| A. | multiple edges. |
| B. | loops. |
| C. | finite. |
| D. | digraph. |
| Answer» C. finite. | |
| 213. |
The length of the path is the number of_____________ on the path. |
| A. | nodes. |
| B. | fields. |
| C. | data. |
| D. | edges. |
| Answer» E. | |
| 214. |
An algorithm that calls itself directly or indirectly is known as ____________. |
| A. | Sub algorithm. . |
| B. | Recursion. |
| C. | Polish notation. |
| D. | Traversal algorithm. |
| Answer» C. Polish notation. | |
| 215. |
The topological sorting of any DAG can be done in time. |
| A. | cubic |
| B. | quadratic |
| C. | linear |
| D. | logarithmic |
| Answer» D. logarithmic | |
| 216. |
Two main measures for the efficiency of an algorithm are____________. |
| A. | Processor and memory. |
| B. | Complexity and capacity. |
| C. | Time and space. |
| D. | Data and space. |
| Answer» D. Data and space. | |
| 217. |
What is the average case complexity of bubble sort? |
| A. | O(nlogn) |
| B. | O(logn) |
| C. | O(n) |
| D. | O(n2) |
| Answer» E. | |
| 218. |
The _________ for a linked list is a pointer variable that locates the beginning of the list. |
| A. | anchor. |
| B. | base. |
| C. | footer. |
| D. | header. |
| Answer» E. | |
| 219. |
Which of the following is an example of dynamic programming approach? |
| A. | Fibonacci Series |
| B. | Tower of Hanoi |
| C. | Dijkstra Shortest Path |
| D. | All of the above |
| Answer» E. | |
| 220. |
The complexity of linear search algorithm is____________. |
| A. | O(log n). |
| B. | O(n). |
| C. | O(n2). |
| D. | O(n log n). |
| Answer» C. O(n2). | |
| 221. |
What is the worst case time complexity of inserting a node in a doubly linked list? |
| A. | O(nlogn) |
| B. | O(logn) |
| C. | O(n) |
| D. | O(1) |
| Answer» D. O(1) | |
| 222. |
New data are to be inserted into a data structure, but there is no available space; this situation is usuallycalled__________. |
| A. | Underflow. |
| B. | Overflow. |
| C. | Houseful. |
| D. | Saturated. |
| Answer» C. Houseful. | |
| 223. |
If we implement heap as min-heap, deleting root node (value 1)from the heap. What would be the value ofroot node after second iteration if leaf node (value 100) is chosen to replace the root at start. |
| A. | 2 |
| B. | 100 |
| C. | 17 |
| D. | none |
| Answer» B. 100 | |
| 224. |
Quick sort uses ____ for implementation. |
| A. | recursion. |
| B. | traversal. |
| C. | heaps. |
| D. | queues. |
| Answer» B. traversal. | |
| 225. |
_______________ is a solution to a problem independent of programming language. |
| A. | Efficient. |
| B. | Linked list. |
| C. | Data structure. |
| D. | Algorithm. |
| Answer» E. | |
| 226. |
Given an array arr = {45,77,89,90,94,99,100} and key = 99; what are the mid values(correspondingarray elements) in the first and second levels of recursion? |
| A. | 90 and 99 |
| B. | 90 and 94 |
| C. | 89 and 99 |
| D. | 89 and 94 |
| Answer» B. 90 and 94 | |
| 227. |
To insert a new node in linked list free node will be available in ___________. |
| A. | Available list. |
| B. | Avail list. |
| C. | Free node list. |
| D. | Memory space list. |
| Answer» C. Free node list. | |
| 228. |
A tree is a data structure which represents hierarchical relationship between individual _________. |
| A. | data items. |
| B. | fields. |
| C. | nodes. |
| D. | linked list. |
| Answer» B. fields. | |
| 229. |
The pre-order and in-order are traversals of a binary tree are T M L N P O Q and L M N T O P Q.Which of following is post-order traversal of the tree? |
| A. | L N M O Q P T |
| B. | N M O P O L T |
| C. | L M N O P Q T |
| D. | O P L M N Q T |
| Answer» B. N M O P O L T | |
| 230. |
Which of the following pair’s traversals on a binary tree can build the tree uniquely? |
| A. | post-order and pre-order |
| B. | post-order and in-order |
| C. | post-order and level order |
| D. | level order and preorder |
| Answer» C. post-order and level order | |
| 231. |
A code which deals about short form of a program is called __________ code. |
| A. | program. |
| B. | data. |
| C. | pseudo. |
| D. | derived. |
| Answer» D. derived. | |
| 232. |
Base address is the address of __________. |
| A. | first element |
| B. | middle element |
| C. | last element |
| D. | pivot element |
| Answer» B. middle element | |
| 233. |
A graph with all vertices having equal degree is known as a |
| A. | Multi Graph |
| B. | Regular Graph |
| C. | Simple Graph |
| D. | Complete Graph |
| Answer» C. Simple Graph | |
| 234. |
A ______________ list is a header list where the node points back to the header node. |
| A. | Circular header. |
| B. | Grounded header. |
| C. | Two way header. |
| D. | One way header. |
| Answer» B. Grounded header. | |
| 235. |
Consider the following data. The pre order traversal of a binary tree is A, B, E, C, D. The in ordertraversal of the same binary tree is B, E, A, D, C. The level order sequence for the binary tree is |
| A. | A, C, D, B, E |
| B. | A, B, C, D, E |
| C. | A, B, C, E, D |
| D. | D, B, E, A, C |
| Answer» C. A, B, C, E, D | |
| 236. |
The Worst case occur in linear search algorithm when_____________. |
| A. | item is somewhere in the middle of the array. |
| B. | item is not in the array at all. |
| C. | item is the last element in the array. |
| D. | item is the last element in the array or is not there at all. |
| Answer» E. | |
| 237. |
A path P of length n from a node u to a node v is defined as a sequence of _________ nodes. |
| A. | n. |
| B. | n+1. |
| C. | n+2. |
| D. | n-1. |
| Answer» C. n+2. | |
| 238. |
The correctness of a divide and conquer algorithm is usually proved by _________. |
| A. | mathematical theorem. |
| B. | de-Morgan `s law. |
| C. | mathematical induction. |
| D. | none. |
| Answer» D. none. | |
| 239. |
What would be the asymptotic time complexity to insert an element at the second position in thelinked list? |
| A. | O(1) |
| B. | O(n) |
| C. | O(n2) |
| D. | O(n3) |
| Answer» B. O(n) | |
| 240. |
Which of the following way follows in Post order traversal? |
| A. | Root -> Left sub tree -> Right sub tree. |
| B. | Root -> Right sub tree -> Left sub tree. |
| C. | Left sub tree -> Root -> Right sub tree. |
| D. | Left sub tree -> Right sub tree -> Root. |
| Answer» E. | |
| 241. |
The maximum number of nodes on level i of a binary tree is ___________. |
| A. | 2i-1. |
| B. | 3i-1. |
| C. | i+1. |
| D. | 2i+1. |
| Answer» B. 3i-1. | |
| 242. |
Process of following a method to solve a problem is called a/an |
| A. | Program |
| B. | Processing |
| C. | Algorithm |
| D. | Pattern |
| Answer» D. Pattern | |
| 243. |
Recurrence relations are widely used for modelling cost of |
| A. | Non-recurrence functions |
| B. | Asymmetric functions |
| C. | Recurrence functions |
| D. | Symmetric functions |
| Answer» D. Symmetric functions | |
| 244. |
Which of the following belongs to the algorithm paradigm? |
| A. | Minimum & Maximum problem |
| B. | Knapsack problem |
| C. | Selection problem |
| D. | Merge sort |
| Answer» C. Selection problem | |
| 245. |
Which case of data structure operation takes maximum time? |
| A. | Worst Case |
| B. | Average Case |
| C. | Best Case |
| D. | None of the above |
| Answer» B. Average Case | |
| 246. |
Which characteristics shows that running time or the execution time of operations of data structure must be as small as possible? |
| A. | Completeness |
| B. | Correctness |
| C. | Time Complexity |
| D. | Space Complexity |
| Answer» D. Space Complexity | |
| 247. |
Which compression loses data? |
| A. | Lossy compression |
| B. | Lossless compression |
| C. | both a and b |
| D. | None of the above |
| Answer» B. Lossless compression | |
| 248. |
An algorithm is composed of a series of |
| A. | Steps |
| B. | Structures |
| C. | Domains |
| D. | Architectures |
| Answer» B. Structures | |
| 249. |
Mathematical Model that can have set of operations that can be performed on that model is called as _________. |
| A. | Abstract Data Type |
| B. | Composite Data Type |
| C. | Primitive Data Type |
| D. | None of these |
| Answer» B. Composite Data Type | |
| 250. |
In what kind of storage we can easily insert,delete,concatenate and rearrange substrings ? |
| A. | Queue |
| B. | Linked List |
| C. | Stack |
| D. | Array |
| Answer» C. Stack | |