McqMate
These multiple-choice questions (MCQs) are designed to enhance your knowledge and understanding in the following areas: Computer Science Engineering (CSE) , Information Technology Engineering (IT) , Bachelor of Science in Computer Science FY (BSc CS) , Bachelor of Science in Information Technology FY (BSc IT) , Bachelor of Computer Applications (BCA) .
Chapters
| 151. |
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» D. All of the above | |
| 152. |
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» D. base address. | |
| 153. |
Which data structure allows deleting data elements from front and inserting at rear? |
| A. | Stacks. |
| B. | Queues. |
| C. | Dequeues. |
| D. | Binary search tree. |
| Answer» B. Queues. | |
| 154. |
Binary search algorithm cannot be applied to________ concept. |
| A. | unsorted linked list. |
| B. | sorted binary trees. |
| C. | sorted linear array. |
| D. | pointer array. |
| Answer» A. unsorted linked list. | |
| 155. |
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» C. trees have root. | |
| 156. |
Linked lists are suitable for which of the following problems? |
| A. | Insertion sort |
| B. | Binary search |
| C. | Radix sort |
| D. | dequeue. |
| Answer» B. Binary search | |
| 157. |
Identify the data structure which allows deletions at both ends of the list but insertion at only one end___________. |
| A. | Input-restricted dequeue. |
| B. | Output-restricted dequeue. |
| C. | Priority queues. |
| D. | Data structure. |
| Answer» A. Input-restricted dequeue. | |
| 158. |
Which of the following data structure is non-linear type? |
| A. | Strings. |
| B. | Lists. |
| C. | Stacks. |
| D. | Hierarchical. |
| Answer» D. Hierarchical. | |
| 159. |
To represent hierarchical relationship between elements, which data structure is suitable? |
| A. | Dequeue. |
| B. | Priority. |
| C. | Tree. |
| D. | Binary tree. |
| Answer» C. Tree. | |
| 160. |
When does the ArrayIndexOutOfBoundsException occur? |
| A. | Compile-time |
| B. | Run-time |
| C. | Not an error |
| D. | None of the mentioned |
| Answer» B. Run-time | |
| 161. |
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» D. Dn = log2n+1. | |
| 162. |
When converting binary tree into extended binary tree, all the original nodes in binary tree are___________. |
| A. | internal nodes on extended tree. |
| B. | external nodes on extended tree. |
| C. | vanished on extended tree. |
| D. | post order traversal. |
| Answer» A. internal nodes on extended tree. | |
| 163. |
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» C. Avail=Null | |
| 164. |
Which of the following sorting algorithm is of divide-and-conquer type? |
| A. | Bubble sort. |
| B. | Insertion sort. |
| C. | Quick sort. |
| D. | Algorithm. |
| Answer» C. Quick sort. | |
| 165. |
STACK is also called as ______________. |
| A. | FIFO |
| B. | LIFO |
| C. | FOLI |
| D. | FOFI |
| Answer» B. LIFO | |
| 166. |
Collection of related data items is called _______. |
| A. | files |
| B. | fields |
| C. | attributes. |
| D. | records. |
| Answer» D. records. | |
| 167. |
Breadth First search is used in____________. |
| A. | binary tree. |
| B. | stacks. |
| C. | graphs. |
| D. | both a and c. |
| Answer» C. graphs. | |
| 168. |
A variable whose size is determined at compile time and cannot be changed at run time is_________. |
| A. | static variable. |
| B. | dynamic variable. |
| C. | not a variable. |
| D. | data variable. |
| Answer» A. static variable. | |
| 169. |
Process of inserting an element in stack is called ____________. |
| A. | Create |
| B. | Push |
| C. | Evaluation |
| D. | Pop |
| Answer» B. Push | |
| 170. |
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» A. UB-LB+1 | |
| 171. |
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» D. n+1/2. | |
| 172. |
A technique for direct search is _______________. |
| A. | Binary Search |
| B. | Linear Search |
| C. | Tree Search |
| D. | Hashing |
| Answer» D. Hashing | |
| 173. |
Base address is the address of __________. |
| A. | first element |
| B. | middle element |
| C. | last element |
| D. | pivot element |
| Answer» A. first element | |
| 174. |
A _____________ list is a list where the last node contains null pointer. |
| A. | circular header. |
| B. | grounded header. |
| C. | rounded header. |
| D. | linked header. |
| Answer» B. grounded header. | |
| 175. |
___________are used to facilitate the processing of information in an array. |
| A. | Pointers. |
| B. | Memory location. |
| C. | Records. |
| D. | Variables. |
| Answer» A. Pointers. | |
| 176. |
The comparison tree is also called as________. |
| A. | decision tree. |
| B. | binary tree. |
| C. | sequential tree. |
| D. | b+ tree. |
| Answer» A. decision tree. | |
| 177. |
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» A. circular list. | |
| 178. |
__________________ 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» B. Grounded Header Linked list | |
| 179. |
Which of the following case does not exist in complexity theory |
| A. | Best case |
| B. | Worst case |
| C. | Average case |
| D. | Null case |
| Answer» D. Null case | |
| 180. |
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» D. header. | |
| 181. |
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» B. counting the number of key operations. | |
| 182. |
The space factor when determining the efficiency of algorithm is measured by___________. |
| A. | counting the maximum memory needed by the algorithm. |
| B. | counting the minimum memory needed by the algorithm. |
| C. | counting the average memory needed by the algorithm. |
| D. | counting the maximum disk space needed by the algorithm. |
| Answer» A. counting the maximum memory needed by the algorithm. | |
| 183. |
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» D. item is the last element in the array or is not there at all. | |
| 184. |
The complexity of linear search algorithm is____________. |
| A. | O(log n). |
| B. | O(n). |
| C. | O(n2). |
| D. | O(n log n). |
| Answer» B. O(n). | |
| 185. |
The time required in best case for search operation in binary tree is ____________. |
| A. | O(n). |
| B. | O(2n). |
| C. | O(log n). |
| D. | O( log 2n). |
| Answer» C. O(log n). | |
| 186. |
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» D. Left sub tree -> Right sub tree -> Root. | |
| 187. |
A _________is a linked list which always contains a special node called the header node, at the beginning of the list. |
| A. | Doubly Linked List. |
| B. | Circular List. |
| C. | Header Linked List. |
| D. | None. |
| Answer» C. Header Linked List. | |
| 188. |
_______________is a header list where the last node points back to the header node. |
| A. | Doubly header List. |
| B. | Singly header List. |
| C. | Grounder Header List. |
| D. | Circular Header List. |
| Answer» D. Circular Header List. | |
| 189. |
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» A. two-way circular header list. | |
| 190. |
The pointer of the last node contains a special value called_____________. |
| A. | null pointer. |
| B. | index pointer. |
| C. | pointer link. |
| D. | address pointer. |
| Answer» B. index pointer. | |
| 191. |
The OS of a computer may periodically collect all the deleted space onto the free storage list. This technique is called______________. |
| A. | buffering. |
| B. | garbage collection. |
| C. | deal location. |
| D. | buffer collection. |
| Answer» B. garbage collection. | |
| 192. |
Important part of any compiler is the construction and maintenances of a dictionary, this types of dictionary are called______________. |
| A. | symbol table. |
| B. | index table. |
| C. | grammar table. |
| D. | pointer table. |
| Answer» A. symbol table. | |
| 193. |
The data structure required to check whether an expression contains balanced parenthesis is? |
| A. | queue |
| B. | stack |
| C. | linked list |
| D. | file |
| Answer» B. stack | |
| 194. |
What are the advantages of arrays? |
| A. | Easier to store elements of same data type |
| B. | Used to implement other data structures like stack and queue |
| C. | Convenient way to represent matrices as a 2D array |
| D. | All of the mentioned |
| Answer» D. All of the mentioned | |
| 195. |
The number of possible ordered trees with three nodes A,B,C is? |
| A. | 16 |
| B. | 12. |
| C. | 10 |
| D. | 6 |
| Answer» B. 12. | |
| 196. |
The earliest use of__________ sorting was in conjunction with network analysis. |
| A. | topological. |
| B. | bubble. |
| C. | radix. |
| D. | heap. |
| Answer» A. topological. | |
| 197. |
_________is not the operation that can be performed on Queue. |
| A. | Traversal. |
| B. | Insertion. |
| C. | Deletion. |
| D. | Retrieval. |
| Answer» A. Traversal. | |
| 198. |
A tree is a finite set of_________. |
| A. | loops. |
| B. | domains. |
| C. | functions. |
| D. | nodes. |
| Answer» D. nodes. | |
| 199. |
Stack can be represented by means of ____________. |
| A. | Tree. |
| B. | Graph. |
| C. | One-way List. |
| D. | None. |
| Answer» C. One-way List. | |
| 200. |
The hashing file space is divided into_______________. |
| A. | nodes and roots. |
| B. | roots and slots. |
| C. | buckets and slots. |
| D. | slots and nodes. |
| Answer» C. buckets and slots. | |
Done Studing? Take A Test.
Great job completing your study session! Now it's time to put your knowledge to the test. Challenge yourself, see how much you've learned, and identify areas for improvement. Don’t worry, this is all part of the journey to mastery. Ready for the next step? Take a quiz to solidify what you've just studied.