MCQOPTIONS
Saved Bookmarks
MCQOPTIONS
This section includes 9 Mcqs, each offering curated multiple-choice questions to sharpen your Database knowledge and support exam preparation. Choose a topic below to get started.
| 1. |
THE_COMPLEXITY_OF_BINARY_SEARCH_ALGORITHM_IS?$ |
| A. | O(n) |
| B. | O(log ) |
| C. | O(n2) |
| D. | O(n log n) |
| Answer» C. O(n2) | |
| 2. |
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) | |
| 3. |
The complexity of a linear search algorithm i? |
| A. | O(n) |
| B. | O(log n) |
| C. | O(n2) |
| D. | O(n log n) |
| Answer» B. O(log n) | |
| 4. |
The complexity of the average case of an algorithm is |
| A. | Much more complicated to analyze than that of worst case |
| B. | Much more simpler to analyze than that of worst case |
| C. | Sometimes more complicated and some other times simpler than that of worst case |
| D. | None of the mentioned |
| Answer» B. Much more simpler to analyze than that of worst case | |
| 5. |
The Average case occur in linear search algorithm |
| A. | When Item is somewhere in the middle of the array |
| B. | When Item is not in the array at all |
| C. | When Item is the last element in the array |
| D. | When Item is the last element in the array or is not there at all |
| Answer» B. When Item is not in the array at all | |
| 6. |
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. | |
| 7. |
Which of the following case does not exist in complexity theory |
| A. | Best case |
| B. | Worst case |
| C. | Average case |
| D. | Null case |
| Answer» E. | |
| 8. |
The time factor when determining the efficiency of an 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 | |
| 9. |
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 | |