Table of Contents

    Computational Complexity

    Rumman Ansari August 30, 2026 6 views Subject Details
    🔒 Please log in to unlock this course.
    Computer Science - 10 Years Solved Papers ISC Class XII

    Related Questions

    Question 1
    Determine the Big-O notation for: 5n5/2 + 12n2/5 6 · log2(n) + 9n 3n4 + n · log2(n) 5n2 + 13n3/2
    Locked. Enroll to open this question.
    Question 2
    Calculate the run-time efficiency of the following program segment: i = 1 loop (i
    Locked. Enroll to open this question.
    Question 3
    Calculate the run-time efficiency of the following program segment (three nested loops): i = 1 loop…
    Locked. Enroll to open this question.
    Question 4
    If the algorithm doIt() has an efficiency factor of 5n, calculate the run-time efficiency of a…
    Locked. Enroll to open this question.
    Question 5
    If the efficiency of doIt() is O(n²), calculate the efficiency of the following segment: for (i =…
    Locked. Enroll to open this question.
    Question 6
    Q. If the efficiency of doIt() is O(n²), calculate the efficiency of the following logarithmic…
    Locked. Enroll to open this question.
    Question 7
    The efficiency of an algorithm is 5n2. If each step takes 1 nanosecond (10−9 seconds), how long…
    Locked. Enroll to open this question.
    Question 8
    The efficiency of an algorithm is n3. If each step takes 1 nanosecond (10−9 seconds), how long will…
    Locked. Enroll to open this question.
    Question 9
    The efficiency of an algorithm is 5n·log2(n). If each step takes 1 nanosecond (10−9 seconds), how…
    Locked. Enroll to open this question.
    Question 10
    Reorder the following efficiencies from the smallest to the largest: (a) 2n (b) n! (c) n5 (d)…
    Locked. Enroll to open this question.
    Question 11
    Reorder the following efficiencies from the smallest to the largest: (a) n·log2(n) (b) n + n2 + n3…
    Locked. Enroll to open this question.
    Question 12
    Determine the Big-O notation for the following expressions: (a) 5n5/2 + 12n2/5 (b) 6·log2(n) + 9n…
    Locked. Enroll to open this question.
    Question 13
    Calculate the run-time efficiency of the following single loop: for (i = 1; i
    Locked. Enroll to open this question.
    Question 14
    Calculate the run-time efficiency of the following three nested loops, where each loop runs n…
    Locked. Enroll to open this question.
    Question 15
    The efficiency of doIt() is 5n. A loop runs n times and calls doIt() during each iteration.…
    Locked. Enroll to open this question.
    Question 16
    The efficiency of doIt() is O(n2). An outer loop runs n times, and an inner loop runs n − 1 times…
    Locked. Enroll to open this question.
    Question 17
    The efficiency of doIt() is O(n2). A loop doubles the value of i after every iteration and calls…
    Locked. Enroll to open this question.
    Question 18
    The efficiency of an algorithm is 5n2. If each step takes 1 nanosecond (10−9 seconds), how long…
    Locked. Enroll to open this question.
    Question 19
    The efficiency of an algorithm is n3. If each step takes 1 nanosecond (10−9 seconds), how long will…
    Locked. Enroll to open this question.
    Question 20
    The efficiency of an algorithm is 5n·log2(n). If each step takes 1 nanosecond (10−9 seconds), how…
    Locked. Enroll to open this question.
    Question 21
    Determine the running time of QuickSort for: (a) sorted input, (b) reverse which all elements are…
    Locked. Enroll to open this question.
    Question 22
    If the middle element is always chosen as the pivot in QuickSort, does this make it unlikely that…
    Locked. Enroll to open this question.
    Question 23
    What is the worst-case behaviour of QuickSort in terms of the number of comparisons?
    Locked. Enroll to open this question.
    Question 24
    In selecting the pivot for QuickSort, which is the best choice for optimal partitioning? (a) First…
    Locked. Enroll to open this question.
    Question 25
    In its worst case, QuickSort behaves like: (a) Bubble Sort (b) Selection Sort (c) Insertion Sort
    Locked. Enroll to open this question.
    Question 26
    Q Sort the array using QuickSort, taking the first number of each segment as the pivot. Draw the…
    Locked. Enroll to open this question.
    Question 27
    Two techniques are used to find the mode of integer test scores between 0 and 100: Method A: Insert…
    Locked. Enroll to open this question.
    Question 28
    Both MergeSort and QuickSort have an average time complexity of O(n log n). In general, which…
    Locked. Enroll to open this question.

    MCQ Section

    MCQ 1
    Question: Reorder the following efficiencies from the smallest to the largest: (a) 2n, (b) n!, (c)…
    Locked. Enroll to open this MCQ.
    MCQ 2
    Question: Reorder the following efficiencies from the smallest to the largest: (a) n · log2(n), (b)…
    Locked. Enroll to open this MCQ.
    MCQ 3
    What is computational complexity?
    Locked. Enroll to open this MCQ.
    MCQ 4
    What is the purpose of estimating the complexity of algorithms?
    Locked. Enroll to open this MCQ.
    MCQ 5
    What does Big-O notation represent?
    Locked. Enroll to open this MCQ.
    MCQ 6
    Which of the following is an example of O(n) complexity?
    Locked. Enroll to open this MCQ.
    MCQ 7
    Which algorithm complexity is considered the fastest for large inputs?
    Locked. Enroll to open this MCQ.
    MCQ 8
    What is the best-case complexity of an algorithm?
    Locked. Enroll to open this MCQ.
    MCQ 9
    What is a divide and conquer algorithm?
    Locked. Enroll to open this MCQ.
    MCQ 10
    What is the complexity of linear search in the best case?
    Locked. Enroll to open this MCQ.
    MCQ 11
    What is the worst-case complexity of binary search?
    Locked. Enroll to open this MCQ.
    MCQ 12
    What is the time complexity of selection sort in the worst case?
    Locked. Enroll to open this MCQ.
    MCQ 13
    What is the average-case complexity of insertion sort?
    Locked. Enroll to open this MCQ.
    MCQ 14
    What does O(n2) mean in terms of algorithm complexity?
    Locked. Enroll to open this MCQ.
    MCQ 15
    What does the complexity analysis of insertion sort reveal?
    Locked. Enroll to open this MCQ.
    MCQ 16
    Which algorithm uses a divide and conquer approach?
    Locked. Enroll to open this MCQ.
    MCQ 17
    What is the time complexity of searching an element in a balanced binary search tree (BST)?
    Locked. Enroll to open this MCQ.
    MCQ 18
    What is the best-case time complexity of inserting an element in a binary search tree (BST)?
    Locked. Enroll to open this MCQ.
    MCQ 19
    Directions: A statement of Assertion (A) is followed by a statement of Reason (R). Mark the correct…
    Locked. Enroll to open this MCQ.
    MCQ 20
    Directions: A statement of Assertion (A) is followed by a statement of Reason (R). Mark the correct…
    Locked. Enroll to open this MCQ.
    MCQ 21
    Directions: A statement of Assertion (A) is followed by a statement of Reason (R). Mark the correct…
    Locked. Enroll to open this MCQ.
    MCQ 22
    Directions: A statement of Assertion (A) is followed by a statement of Reason (R). Mark the correct…
    Locked. Enroll to open this MCQ.
    MCQ 23
    Directions: A statement of Assertion (A) is followed by a statement of Reason (R). Mark the correct…
    Locked. Enroll to open this MCQ.
    MCQ 24
    Directions: A statement of Assertion (A) is followed by a statement of Reason (R). Mark the correct…
    Locked. Enroll to open this MCQ.
    MCQ 25
    Directions: A statement of Assertion (A) is followed by a statement of Reason (R). Mark the correct…
    Locked. Enroll to open this MCQ.
    MCQ 26
    Directions: A statement of Assertion (A) is followed by a statement of Reason (R). Mark the correct…
    Locked. Enroll to open this MCQ.
    MCQ 27
    Directions: A statement of Assertion (A) is followed by a statement of Reason (R). Mark the correct…
    Locked. Enroll to open this MCQ.
    MCQ 28
    Directions: A statement of Assertion (A) is followed by a statement of Reason (R). Mark the correct…
    Locked. Enroll to open this MCQ.
    MCQ 29
    Directions: A statement of Assertion (A) is followed by a statement of Reason (R). Mark the correct…
    Locked. Enroll to open this MCQ.

    Get Computer Science - 10 Years Solved Papers ISC Class XII updates by email

    Short, practical lessons and course updates from Rumman Ansari. No spam.