Data Structures and Algorithms MCQs Test 1 Online For Preparation Malik Asghar — April 20, 2018 in Mathematics Test • add comment Data Structures and Algorithms MCQs Test 1 Online For Preparation 1. The time factor when determining the efficiency of algorithm is measured by ?A. Counting the number of key operations B. Counting the number of statements C. Counting the kilobytes of algorithmD. Counting microseconds Loading... 2. The complexity of Bubble sort algorithm is ?A. O(n2) B. O(n log n)C. O(log n) D. O(n) Loading... 3. The complexity of the average case of an algorithm is ?A. Much more simpler to analyze than that of worst case B. Much more complicated to analyze than that of worst case C. Sometimes more complicated and some other times simpler than that of worst case D. None or above Loading... 4. The space factor when determining the efficiency of algorithm is measured by ?A. Counting the minimum memory needed by the algorithm B. Counting the maximum disk space needed by the algorithmC. Counting the average memory needed by the algorithm D. Counting the maximum memory needed by the algorithm Loading... 5. The Worst case occur in linear search algorithm when ?A. Item is somewhere in the middle of the array B. Item is the last element in the array C. Item is not in the array at all D. Item is the last element in the array or is not there at all Loading... 6. The Average case occur in linear search algorithm ?A. When Item is somewhere in the middle of the array B. When Item is the last element in the array or is not there at allC. When Item is not in the array at all D. When Item is the last element in the array Loading... 7. The complexity of Binary search algorithm is ?A. O(n log n)B. O(n2) C. O(n) D. O(log ) Loading... 8. The complexity of linear search algorithm is ?A. O(n) B. O(n log n)C. O(n2) D. O(log n) Loading... 9. Which of the following case does not exist in complexity theory ?A. Average case B. Null caseC. Worst case D. Best case Loading... 10. Two main measures for the efficiency of an algorithm are ?A. Time and space B. Complexity and capacity C. Data and spaceD. Processor and memory Loading... Loading...
