MCQOPTIONS
Saved Bookmarks
MCQOPTIONS
This section includes 657 Mcqs, each offering curated multiple-choice questions to sharpen your Testing Subject knowledge and support exam preparation. Choose a topic below to get started.
| 1. |
The complexity of merge sort algorithm is ...... |
| A. | O(n) |
| B. | O(logn) |
| C. | O(n2) |
| D. | O(n logn) |
| Answer» E. | |
| 2. |
Binary search algorithm cannot be applied to ... |
| A. | sorted linked list |
| B. | sorted binary trees |
| C. | sorted linear array |
| D. | pointer array |
| Answer» E. | |
| 3. |
The Average case occurs in linear search algorithm .......... |
| A. | when item is somewhere in the middle of the array |
| B. | when item is not the array at all |
| C. | when item is the last element in the array |
| D. | Item is the last element in the array or item is not there at all |
| Answer» B. when item is not the array at all | |
| 4. |
Which of the following is not a limitation of binary search algorithm? |
| A. | must use a sorted array |
| B. | requirement of sorted array is expensive when a lot of insertion and deletions are needed |
| C. | there must be a mechanism to access middle element directly |
| D. | binary search algorithm is not efficient when the data elements more than 1500. |
| Answer» E. | |
| 5. |
The complexity of sorting algorithm measures the ...... as a function of the number n of items to be sorter. |
| A. | average time |
| B. | running time |
| C. | average-case complexity |
| D. | case-complexity |
| Answer» C. average-case complexity | |
| 6. |
The complexity of bubble sort algorithm is ..... |
| A. | O(n) |
| B. | O(logn) |
| C. | O(n2) |
| D. | O(n logn) |
| Answer» D. O(n logn) | |
| 7. |
Sorting algorithm can be characterized as ...... |
| A. | Simple algorithm which require the order of n2 comparisons to sort n items. |
| B. | Sophisticated algorithms that require the O(nlog2n) comparisons to sort items. |
| C. | Both of the above |
| D. | None of the above |
| Answer» D. None of the above | |
| 8. |
Complexity of linear search algorithm is ......... |
| A. | O(n) |
| B. | O(logn) |
| C. | O(n2) |
| D. | O(n logn) |
| Answer» B. O(logn) | |
| 9. |
If the number of records to be sorted is small, then ...... sorting can be efficient. |
| A. | Merge |
| B. | Heap |
| C. | Selection |
| D. | Bubble |
| Answer» D. Bubble | |
| 10. |
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 item is not there at all |
| Answer» E. | |
| 11. |
The complexity of selection sort is ....... |
| A. | O(n) |
| B. | O(n2) |
| C. | O(n logn) |
| D. | O(logn) |
| Answer» C. O(n logn) | |
| 12. |
Merging k sorted tables into a single sorted table is called ...... |
| A. | k way merging |
| B. | k th merge |
| C. | k+1 merge |
| D. | k-1 merge |
| Answer» B. k th merge | |
| 13. |
The time complexity of heap sort is .... |
| A. | O(n) |
| B. | O(logn) |
| C. | O(n2) |
| D. | O(n logn) |
| Answer» E. | |
| 14. |
If the number of record to be sorted large and the key is long, then ...... sorting can be efficient. |
| A. | Merge |
| B. | Heap |
| C. | Quick |
| D. | Bubble |
| Answer» D. Bubble | |
| 15. |
The total number of comparisons in a bubble sort is .... |
| A. | O(n logn) |
| B. | O(2n) |
| C. | O(n2) |
| D. | O(n) |
| Answer» B. O(2n) | |
| 16. |
If the number of record to be sorted large and the key is short, then ...... sorting can be efficient. |
| A. | Merge |
| B. | Heap |
| C. | Radix |
| D. | Bubble |
| Answer» D. Bubble | |
| 17. |
The function used to modify the way of sorting the keys of records is called ........ |
| A. | Indexing function |
| B. | Hash function |
| C. | Addressing function |
| D. | All of the above |
| Answer» C. Addressing function | |
| 18. |
A tree sort is also known as ......... sort. |
| A. | quick |
| B. | shell |
| C. | heap |
| D. | selection |
| Answer» D. selection | |
| 19. |
Quick sort is also known as ........ |
| A. | merge sort |
| B. | tree sort |
| C. | shell sort |
| D. | partition and exchange sort |
| Answer» E. | |
| 20. |
Selection sort first finds the .......... element in the list and put it in the first position. |
| A. | Middle element |
| B. | Largest element |
| C. | Last element |
| D. | Smallest element |
| Answer» E. | |
| 21. |
Which of the following sorting algorithm is of divide and conquer type? |
| A. | Bubble sort |
| B. | Insertion sort |
| C. | Quick sort |
| D. | Merge sort |
| Answer» D. Merge sort | |
| 22. |
The easiest sorting is ........ |
| A. | quick sort |
| B. | shell sort |
| C. | heap sort |
| D. | selection sort |
| Answer» E. | |
| 23. |
.......... sorting is good to use when alphabetizing large list of names. |
| A. | Merge |
| B. | Heap |
| C. | Radix |
| D. | Bubble |
| Answer» D. Bubble | |
| 24. |
The operation that combines the element is of A and B in a single sorted list C with n=r+s element is called .... |
| A. | Inserting |
| B. | Mixing |
| C. | Merging |
| D. | Sharing |
| Answer» D. Sharing | |
| 25. |
Sorting a file F usually refers to sorting F with respect to a particular key called ..... |
| A. | Basic key |
| B. | Primary key |
| C. | Starting key |
| D. | Index key |
| Answer» C. Starting key | |
| 26. |
Very slow way of sorting is .......... |
| A. | Insertion sort |
| B. | Heap sort |
| C. | Bubble sort |
| D. | Quick sort |
| Answer» B. Heap sort | |
| 27. |
Which of the following is an external sorting? |
| A. | Insertion Sort |
| B. | Bubble Sort |
| C. | Merge Sort |
| D. | Tree Sort |
| Answer» D. Tree Sort | |
| 28. |
Finding the location of a given item in a collection of items is called ...... |
| A. | Discovering |
| B. | Finding |
| C. | Searching |
| D. | Mining |
| Answer» D. Mining | |
| 29. |
The time complexity of quick sort is ........ |
| A. | O(n) |
| B. | O(logn) |
| C. | O(n2) |
| D. | O(n logn) |
| Answer» E. | |
| 30. |
Which of the following is an internal sorting? |
| A. | Tape Sort |
| B. | 2-way Merge Sort |
| C. | Merge Sort |
| D. | Tree Sort |
| Answer» E. | |
| 31. |
A linear list in which each node has point to the predecessor and successors nodes is called ........ |
| A. | singly linked list |
| B. | circular linked list |
| C. | doubly linked list |
| D. | linear linked list |
| Answer» D. linear linked list | |
| 32. |
The disadvantage in using a circular linked list is ....... |
| A. | it is possible to get into infinite loop |
| B. | last node points to fist node. |
| C. | time consuming |
| D. | requires more memory space. |
| Answer» B. last node points to fist node. | |
| 33. |
In a linked list, insertion can be done as ......... |
| A. | beginning |
| B. | end |
| C. | middle |
| D. | all of the above |
| Answer» E. | |
| 34. |
A .......... is a header list where the last node contains the null pointer. |
| A. | grounded header list |
| B. | bottom header list |
| C. | down header list |
| D. | dropped header list |
| Answer» B. bottom header list | |
| 35. |
The list which has its own pointer is called ........ |
| A. | pointer list |
| B. | self pointer |
| C. | free pool |
| D. | own pointer |
| Answer» D. own pointer | |
| 36. |
In a two-way lists each node is divided into .......parts. |
| A. | 1 |
| B. | 2 |
| C. | 3 |
| D. | 4 |
| Answer» D. 4 | |
| 37. |
A ............. is a header list where the last node points back to the header node. |
| A. | rounded header list |
| B. | circular header list |
| C. | common header list |
| D. | forward header list |
| Answer» C. common header list | |
| 38. |
RLINK is the pointer pointing to the ... |
| A. | successor node |
| B. | predecessor node |
| C. | head node |
| D. | last node |
| Answer» B. predecessor node | |
| 39. |
If the availability list is null, then the condition is said to be ......... |
| A. | nil block |
| B. | availability list underflow |
| C. | availability list overflow |
| D. | memory loss |
| Answer» C. availability list overflow | |
| 40. |
The list that requires two pointer variables FIRST and LAST is called ........ |
| A. | Circular list |
| B. | Header list |
| C. | One way list |
| D. | Two way list |
| Answer» E. | |
| 41. |
Two-way list may be maintained in memory by means of ............. |
| A. | Queues |
| B. | Linear arrays |
| C. | Non linear arrays |
| D. | Stacks |
| Answer» C. Non linear arrays | |
| 42. |
Header linked lists are frequently used for maintaining ........ in memory. |
| A. | Polynomials |
| B. | Binomial |
| C. | Trinomial |
| D. | Quadratic equation |
| Answer» B. Binomial | |
| 43. |
A doubly linked list has .......... pointers with each node. |
| A. | 0 |
| B. | 1 |
| C. | 2 |
| D. | 3 |
| Answer» D. 3 | |
| 44. |
A doubly linked list is also called as .......... |
| A. | linked list |
| B. | one way chain |
| C. | two way chain |
| D. | right link |
| Answer» D. right link | |
| 45. |
The pointer that points to the first node in the list is ........ |
| A. | FIRST |
| B. | AVAIL |
| C. | TOP |
| D. | REAR |
| Answer» B. AVAIL | |
| 46. |
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 | |
| 47. |
A singly linked list is also called as ........ |
| A. | linked list |
| B. | one way chain |
| C. | two way chain |
| D. | right link |
| Answer» C. two way chain | |
| 48. |
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 | |
| 49. |
.......... may take place only when there is some minimum amount(or) no space left in free storage list. |
| A. | Memory management |
| B. | Garbage collection |
| C. | Recycle bin |
| D. | Memory management |
| Answer» C. Recycle bin | |
| 50. |
Indexing the ........ element in the list is not possible in linked lists. |
| A. | middle |
| B. | first |
| C. | last |
| D. | any where in between |
| Answer» B. first | |