ThePrismSolutions
ThePrismSolutions
home
About us
Top
test1
test2
test3
test4
test5
test6
Practice(TEST 1)
1. Two main measures for the efficiency of an algorithm are
1. Time and space
2. Processor and memory
3. Complexity and capacity
4. Data and space
2. The time factor when determining the efficiency of algorithm is measured by
1. Counting microseconds
2. Counting the number of statements
3. Counting the number of key operations
4. Counting the kilobytes of algorithm
3. The space factor when determining the efficiency of algorithm is measured by
1. Counting the minimum memory needed by the algorithm
2. Counting the maximum memory needed by the algorithm
3. Counting the average memory needed by the algorithm
4. Counting the maximum disk space needed by the algorithm
4. Which of the following case does not exist in complexity theory
1. Best case
2. Worst case
3. Null case
4. Average case
5. The Worst case occur in linear search algorithm when
1. Item is the last element in the array or is not there at all
2. Item is the last element in the array
3. Item is not in the array at all
4. Item is somewhere in the middle of the array
6. The Average case occur in linear search algorithm
1. When Item is not in the array at all
2. When Item is somewhere in the middle of the array
3. When Item is the last element in the array
4. When Item is the last element in the array or is not there at all
7. The complexity of the average case of an algorithm is
1. Much more simpler to analyze than that of worst case
2. Sometimes more complicated and some other times simpler than that of worst case
3. Much more complicated to analyze than that of worst case
4. none of these
8. The complexity of linear search algorithm is ?
1. O(n log n)
2. O(log n)
3. O(n
^{2}
)
4. O(n)
9. The complexity of Binary search algorithm is ?
1. O(log n)
2. O(n)
3. O(n log n)
4. O(n
^{2}
)
10. The complexity of Bubble sort algorithm is ?
1. O(n
^{2}
)
2. O(log n)
3. O(n)
4. O(n log n)