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 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» C. Counting the number of statements | |
| 2. |
Time complexity of Depth First Traversal of is |
| A. | (|V|+|E|) |
| B. | (|V|) |
| C. | (|E|) |
| D. | (|V|*|E|) |
| Answer» B. (|V|) | |
| 3. |
Travelling salesman problem is an example of |
| A. | Dynamic Algorithm |
| B. | Greedy Algorithm |
| C. | Recursive Approach |
| D. | Divide & Conquer |
| Answer» C. Recursive Approach | |
| 4. |
Using the standard algorithm, what is the time required to determine that a number n is prime ? |
| A. | Linear time |
| B. | Constant time |
| C. | Quadratic time |
| D. | Logarithmic time |
| Answer» B. Constant time | |
| 5. |
What is the worst case time complexity of linear search algorithm? |
| A. | (1) |
| B. | (n) |
| C. | (log n) |
| D. | (n2) |
| Answer» C. (log n) | |
| 6. |
What is a set of steps for carrying out a specific task called? |
| A. | Programming |
| B. | Source code |
| C. | Data packages |
| D. | Algorithm |
| Answer» E. | |
| 7. |
What is the worst case run-time complexity of binary search algorithm? |
| A. | (n2) |
| B. | (nlog n) |
| C. | (n3) |
| D. | (n) |
| Answer» E. | |
| 8. |
Which of the following asymptotic notation is the worst among all? |
| A. | (n+9378) |
| B. | (n3) |
| C. | N (1) |
| D. | 2 (n) |
| Answer» C. N (1) | |