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 Average case occur in linear search algorithm ?A. When Item is not in the array at all B. When Item is somewhere in the middle of the array C. When Item is the last element in the array or is not there at allD. When Item is the last element in the array Loading... 2. 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. None or aboveD. Sometimes more complicated and some other times simpler than that of worst case Loading... 3. The Worst case occur in linear search algorithm when ?A. Item is the last element in the array or is not there at allB. Item is not in the array at all C. Item is somewhere in the middle of the array D. Item is the last element in the array Loading... 4. The complexity of linear search algorithm is ?A. O(log n) B. O(n log n)C. O(n) D. O(n2) Loading... 5. The space factor when determining the efficiency of algorithm is measured by ?A. Counting the average memory needed by the algorithm B. Counting the maximum memory needed by the algorithm C. Counting the maximum disk space needed by the algorithmD. Counting the minimum memory needed by the algorithm Loading... 6. The time factor when determining the efficiency of algorithm is measured by ?A. Counting the number of statements B. Counting microseconds C. Counting the number of key operations D. Counting the kilobytes of algorithm Loading... 7. Which of the following case does not exist in complexity theory ?A. Best case B. Null caseC. Average case D. Worst case Loading... 8. Two main measures for the efficiency of an algorithm are ?A. Data and spaceB. Time and space C. Complexity and capacity D. Processor and memory Loading... 9. The complexity of Binary search algorithm is ?A. O(n log n)B. O(n2) C. O(log ) D. O(n) Loading... 10. The complexity of Bubble sort algorithm is ?A. O(n2) B. O(n) C. O(n log n)D. O(log n) Loading... Loading... Related NTS Results Post:Data Structures and Algorithms MCQs Test 6 Online…Data Structures and Algorithms MCQs Test 5 Online…Data Structures and Algorithms MCQs Test 4 Online…Data Structures and Algorithms MCQs Test 3 Online…Data Structures and Algorithms MCQs Test 2 Online…Data Entry Operator DHQ THQ Jobs NTS Skill Test Results 2021CTD Data Entry Operator NTS Jobs Application Forms 2021Biology Mcqs Test 08 Online Preparation
