1. | Two main measures for the efficiency of an algorithm are |
A. |
B. |
C. |
D. |
2. | The time factor when determining the efficiency of algorithm is measured by |
A. |
B. |
C. |
D. |
3. | The space factor when determining the efficiency of algorithm is measured by |
A. |
B. |
C. |
D. |
4. | Which of the following case does not exist in complexity theory |
A. |
B. |
C. |
D. |
5. | The Worst case occur in linear search algorithm when |
A. |
B. |
C. |
D. |
6. | The Average case occur in linear search algorithm |
A. |
B. |
C. |
D. |
7. | The complexity of the average case of an algorithm is |
A. |
B. |
C. |
D. |
8. | The complexity of linear search algorithm is |
A. |
B. |
C. |
D. |
9. | The complexity of Binary search algorithm is |
A. |
B. |
C. |
D. |
10. | The complexity of Bubble sort algorithm is |
A. |
B. |
C. |
D. |
11. | The complexity of merge sort algorithm is |
A. |
B. |
C. |
D. |
12. | The indirect change of the values of a variable in one module by another module is called |
A. |
B. |
C. |
D. |
13. | Which of the following data structure is not linear data structure? |
A. |
B. |
C. |
D. |
14. | Which of the following data structure is linear data structure? |
A. |
B. |
C. |
D. |
15. | The operation of processing each element in the list is known as |
A. |
B. |
C. |
D. |
16. | Finding the location of the element with a given value is: |
A. |
B. |
C. |
D. |
17. | Arrays are best data structures |
A. |
B. |
C. |
D. |
18. | Linked lists are best suited |
A. |
B. |
C. |
D. |
19. | Each array declaration need not give, implicitly or explicitly, the information about |
A. |
B. |
C. |
D. |
20. | The elements of an array are stored successively in memory cells because |
A. |
B. |
C. |
D. |