Data Structures and Algorithms MCQs Test 1 Online For Preparation Leave a Comment / Mathematics Test / By Malik Asghar Data Structures and Algorithms MCQs Test 1 Online For Preparation 1. The complexity of Bubble sort algorithm is ?A. O(n) B. O(n2) C. O(n log n)D. O(log n) Loading... 2. The complexity of the average case of an algorithm is ?A. None or aboveB. Sometimes more complicated and some other times simpler than that of worst case C. Much more complicated to analyze than that of worst case D. Much more simpler to analyze than that of worst case Loading... 3. 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 the last element in the array or is not there at allD. Item is not in the array at all Loading... 4. Which of the following case does not exist in complexity theory ?A. Best case B. Null caseC. Average case D. Worst case Loading... 5. Two main measures for the efficiency of an algorithm are ?A. Data and spaceB. Complexity and capacity C. Time and space D. Processor and memory Loading... 6. The space factor when determining the efficiency of algorithm is measured by ?A. Counting the maximum memory needed by the algorithm B. Counting the average memory needed by the algorithm C. Counting the maximum disk space needed by the algorithmD. Counting the minimum memory needed by the algorithm Loading... 7. The Average case occur in linear search algorithm ?A. When Item is not in the array at all B. When Item is the last element in the array C. When Item is somewhere in the middle of the array D. When Item is the last element in the array or is not there at all Loading... 8. The time factor when determining the efficiency of algorithm is measured by ?A. Counting the number of statements B. Counting the number of key operations C. Counting the kilobytes of algorithmD. Counting microseconds Loading... 9. The complexity of Binary search algorithm is ?A. O(n log n)B. O(log ) C. O(n) D. O(n2) Loading... 10. The complexity of linear search algorithm is ?A. O(log n) B. O(n2) C. O(n) D. O(n log n) Loading... Loading... Related NTS Results Post:Biology Mcqs Test 08 Online PreparationBiology Mcqs Test 07 Online PreparationBiology Mcqs Test 06 Online PreparationChemistry MCQs Test 05 Online PreparationIslamiat Mcqs Test 01 Online PreparationBiology Mcqs Test 14 Online PreparationBiology Mcqs Test 15 Online PreparationBiology Mcqs Test 12 Online Preparation
