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.
| 51. |
A vertex of degree one is called __________. |
| A. | padent |
| B. | isolated vertex |
| C. | null vertex |
| D. | colored vertex |
| Answer» B. isolated vertex | |
| 52. |
What would be the asymptotic time complexity to add a node at the end of singly linked list, if thepointer is initially pointing to the head of the list? |
| A. | O(1) |
| B. | O(n) |
| C. | θ(n) |
| D. | θ(1) |
| Answer» D. θ(1) | |
| 53. |
A ___________refers to a single unit of values. |
| A. | data value. |
| B. | attribute value. |
| C. | data item. |
| D. | elementary. |
| Answer» D. elementary. | |
| 54. |
What is the result of the following operation?Top (Push (S, X)) |
| A. | X |
| B. | X+S |
| C. | S |
| D. | none |
| Answer» B. X+S | |
| 55. |
____________ data structure is used to implement Depth First search. |
| A. | Array. |
| B. | Linked list. |
| C. | Queue. |
| D. | Stack. |
| Answer» E. | |
| 56. |
In _______________all the records contain the same data items with the same amount of space. |
| A. | variable-length records. |
| B. | fixed-length records. |
| C. | subscripted variable. |
| D. | superscripted variable. |
| Answer» C. subscripted variable. | |
| 57. |
The special list which consists of unused memory space is called __________. |
| A. | Free space. |
| B. | Empty space. |
| C. | Available space. |
| D. | Free storage list. |
| Answer» E. | |
| 58. |
LSD radix sort requires passes to sort N elements. |
| A. | (w/logR) |
| B. | N(w/logR) |
| C. | (w/log(RN)) |
| D. | (wN/log(N)) |
| Answer» B. N(w/logR) | |
| 59. |
Process of removing an element from stack is called |
| A. | Create |
| B. | Push |
| C. | Evaluation |
| D. | Pop |
| Answer» E. | |
| 60. |
A _______________ is a reference to a memory location, which is used to store data that is described in adata type. |
| A. | element. |
| B. | variable. |
| C. | pointer. |
| D. | memory. |
| Answer» C. pointer. | |
| 61. |
The number of possible ordered trees with three nodes A,B,C is? |
| A. | 16 |
| B. | 12. |
| C. | 10 |
| D. | 6 |
| Answer» C. 10 | |
| 62. |
Which of the following is true for the LSD radix sort? |
| A. | works best for variable length strings |
| B. | accesses memory randomly |
| C. | inner loop has less instructions |
| D. | sorts the keys in left-to-right order |
| Answer» C. inner loop has less instructions | |
| 63. |
__________is combining the records in two different sorted files in to a single sorted file. |
| A. | Sorting. |
| B. | Searching. |
| C. | Listing. |
| D. | Merging. |
| Answer» E. | |
| 64. |
What data structure would you mostly likely see in a non recursive implementation of a recursivealgorithm? |
| A. | Linked List |
| B. | Stack |
| C. | Queue |
| D. | Tree |
| Answer» C. Queue | |
| 65. |
Stack can be represented by means of ____________. |
| A. | Tree. |
| B. | Graph. |
| C. | One-way List. |
| D. | None. |
| Answer» D. None. | |
| 66. |
The depth of a complete binary tree is given by__________. |
| A. | Dn = n log2n. |
| B. | Dn = n log2n+1. |
| C. | Dn = log2n. |
| D. | Dn = log2n+1. |
| Answer» E. | |
| 67. |
Who invented Quick sort procedure? |
| A. | Hoare. |
| B. | Sedgewick. |
| C. | Mellroy. |
| D. | Coreman. |
| Answer» B. Sedgewick. | |
| 68. |
The average number of key comparisons done in a successful sequential search in a list of length n is____________. |
| A. | log n. |
| B. | n-1/2. |
| C. | n/2. |
| D. | n+1/2. |
| Answer» E. | |
| 69. |
Which of the following conditions checks available free space in avail list? |
| A. | Avail=Top |
| B. | Null=Avail |
| C. | Avail=Null |
| D. | Avail=Max stack |
| Answer» D. Avail=Max stack | |
| 70. |
What is the space complexity of the in-order traversal in the recursive fashion? (d is the tree depthand n is the number of nodes) |
| A. | O(1) |
| B. | O(nlogd) |
| C. | O(logd) |
| D. | O(d) |
| Answer» E. | |
| 71. |
Which of the following is two way lists? |
| A. | Grounded header list. |
| B. | Circular header list. |
| C. | Linked list with header and trailer nodes. |
| D. | List traversed in two directions. |
| Answer» E. | |
| 72. |
The number of swapping needed to sort numbers 8,22,7,9,31,19,5,13 in ascending order using bubble sortis ? |
| A. | 11 |
| B. | 12 |
| C. | 13 |
| D. | 14 |
| Answer» E. | |
| 73. |
The binary tree sort implemented using a self – balancing binary search tree takes time isworst case. |
| A. | O(n log n) |
| B. | O(n) |
| C. | O(n2) |
| D. | O(log n) |
| Answer» B. O(n) | |
| 74. |
Associative arrays can be implemented using |
| A. | B-tree |
| B. | A doubly linked list |
| C. | A single linked list |
| D. | A self balancing binary search tree |
| Answer» E. | |
| 75. |
Each entry in a linked list is a called a_______________. |
| A. | Link. |
| B. | Node. |
| C. | Data Structure. |
| D. | Avail. |
| Answer» C. Data Structure. | |
| 76. |
The string with zero characters is called___________. |
| A. | null string. |
| B. | zero string. |
| C. | one string. |
| D. | empty string. |
| Answer» E. | |
| 77. |
The number of edges in a regular graph of degree d and n vertices is _______. |
| A. | maximum of n,d. |
| B. | n+d. |
| C. | nd. |
| D. | nd/2.C |
| Answer» D. nd/2.C | |
| 78. |
What is the worst case time complexity of LSD radix sort? |
| A. | O(nlogn) |
| B. | O(wn) |
| C. | O(n) |
| D. | O(n + w) |
| Answer» C. O(n) | |
| 79. |
A data structure in which elements can be inserted or deleted at/from both the ends but not in themiddle is? |
| A. | Queue |
| B. | Circular queue |
| C. | Dequeue |
| D. | Priority queue |
| Answer» D. Priority queue | |
| 80. |
A technique for direct search is _______________. |
| A. | Binary Search |
| B. | Linear Search |
| C. | Tree Search |
| D. | Hashing |
| Answer» E. | |
| 81. |
The number of nodes in a complete binary tree of level 5 is__________. |
| A. | 15. |
| B. | 20. |
| C. | 63. |
| D. | 31. |
| Answer» E. | |
| 82. |
What is the possible number of binary trees that can be created with 3 nodes, giving the sequenceN, M, L when traversed in post-order. |
| A. | 15 |
| B. | 3 |
| C. | 5 |
| D. | 8 |
| Answer» D. 8 | |
| 83. |
Inorder traversal of binary search tree will produce _______________. |
| A. | unsorted list. |
| B. | sorted list. |
| C. | reverse of input. |
| D. | none of these. |
| Answer» C. reverse of input. | |
| 84. |
When converting binary tree into extended binary tree, all the original nodes in binary treeare___________. |
| A. | internal nodes on extended tree. |
| B. | external nodes on extended tree. |
| C. | vanished on extended tree. |
| D. | post order traversal. |
| Answer» B. external nodes on extended tree. | |
| 85. |
______ is not a technique of tree traversal. |
| A. | pre-order |
| B. | post-order |
| C. | prefix |
| D. | in-order |
| Answer» D. in-order | |
| 86. |
Matrices with a relatively high proportion of zero entries are called _______ matrices. |
| A. | sparse. |
| B. | Null. |
| C. | Zero. |
| D. | worse. |
| Answer» B. Null. | |
| 87. |
Which of the following is incorrect with respect to binary trees? |
| A. | Let T be a binary tree. For every k ≥ 0, there are no more than 2k nodes in level k |
| B. | Let T be a binary tree with λ levels. Then T has no more than 2λ – 1 nodes |
| C. | Let T be a binary tree with N nodes. Then the number of levels is at least ceil(log (N + 1)) |
| D. | Let T be a binary tree with N nodes. Then the number of levels is at least floor(log (N + 1)) |
| Answer» E. | |
| 88. |
The children node of same parent is called____________. |
| A. | binary tree. |
| B. | tree. |
| C. | sibling. |
| D. | list. |
| Answer» D. list. | |
| 89. |
In a directed tree any node which has out degree 0 is called a terminal node or__________. |
| A. | a tree. |
| B. | a list. |
| C. | a node. |
| D. | a leaf. |
| Answer» E. | |
| 90. |
Quotation marks are also called as ____________. |
| A. | string delimiters. |
| B. | period. |
| C. | stopper. |
| D. | string. |
| Answer» B. period. | |
| 91. |
Allocating memory for arrays during program compilation is___________. |
| A. | dynamic memory allocation. |
| B. | memory allocation. |
| C. | static allocation. |
| D. | random allocation. |
| Answer» D. random allocation. | |
| 92. |
The memory address of the first element of an array is called_________. |
| A. | floor address. |
| B. | foundation address. |
| C. | first address. |
| D. | base address. |
| Answer» E. | |
| 93. |
What operation does the following diagram depict? |
| A. | inserting a leaf node |
| B. | inserting an internal node |
| C. | deleting a node with 0 or 1 child |
| D. | none |
| Answer» D. none | |
| 94. |
Important part of any compiler is the construction and maintenances of a dictionary, this types ofdictionary are called______________. |
| A. | symbol table. |
| B. | index table. |
| C. | grammar table. |
| D. | pointer table. |
| Answer» B. index table. | |
| 95. |
_________is not the operation that can be performed on Queue. |
| A. | Traversal. |
| B. | Insertion. |
| C. | Deletion. |
| D. | Retrieval. |
| Answer» B. Insertion. | |
| 96. |
In variable length storage two dollar signs are used to signal the __________. |
| A. | end of the string. |
| B. | beginning of the string. |
| C. | mid-level of the string. |
| D. | index. |
| Answer» B. beginning of the string. | |
| 97. |
Which of the following is not the application of stack? |
| A. | A parentheses balancing program |
| B. | Tracking of local variables at run time |
| C. | Compiler Syntax Analyzer |
| D. | Data Transfer between two asynchronous process |
| Answer» E. | |
| 98. |
Given an array arr = {5,6,77,88,99} and key = 88; How many iterations are done until the elementis found? |
| A. | 1 |
| B. | 3 |
| C. | 4 |
| D. | 2 |
| Answer» E. | |
| 99. |
Length of linear array can be found by using the formula_________ |
| A. | UB-LB+1 |
| B. | LB+UB |
| C. | LB-UB |
| D. | LB-UB+1 |
| Answer» B. LB+UB | |
| 100. |
Data structure which is capable of expressing more complex relationship than that of physical adjacency iscalled______________. |
| A. | linear data structure. |
| B. | linked list. |
| C. | non linear data Structure |
| D. | data structure. |
| Answer» D. data structure. | |