Algorithmic Strategies Practice Test — Class 12 Computer Science

12th Standard Computer Science — Algorithmic Strategies: Online Practice Test

Pick how many questions you want and set a time limit, then start. You'll get your score at the end with the correct answer and an explanation for every question. Free, in Tamil and English — 25 questions available.

Set up your test

Number of questions

Time limit

Time remaining00:00

The word comes from the name of a Persian mathematician Abu Ja'far Mohammed ibn-i Musa al Khowarizmi is called?

A.Flowchart B.Flow C.Algorithm D.Syntax

From the following sorting algorithms which algorithm needs the minimum number of swaps?

A.Bubble sort B.Insertion sort C.Selection sort D.All the above

Two main measures for the efficiency of an algorithm are

A.Processor and memory B.Complexity and capacity C.Time and space D.Data and space

The algorithm that yields expected output for a valid input is called as

A.Algorithmic solution B.Algorithmic outcomes C.Algorithmic problem D.Algorithmic coding

Which of the following is used to describe the worst case of an algorithm?

A.Big A B.Big S C.Big W D.Big O

Big Ω is the reverse of

A.Big O B.Big θ C.Big A D.Big S

Binary search is also called as

A.Linear search B.Sequential search C.Random search D.Half-interval search

The Θ notation in asymptotic evaluation represents

A.Base case B.Average case C.Worst case D.NULL case

If a problem can be broken into subproblems which are reused several times, the problem possesses which property?

A.Overlapping subproblems B.Optimal substructure C.Memoization D.Greedy

Q10

In dynamic programming, the technique of storing the previously calculated values is called ?

A.Saving value property B.Storing value property C.Memoization D.Mapping

Q11

Which phase of algorithmic analysis represents a theoretical performance analysis where the efficiency is measured by assuming external factors?

A.A Posteriori testing B.A Priori estimates C.Asymptotic notation D.System testing

Q12

In space complexity, which component represents the total space required by variables whose size depends on the problem size and recursion?

A.Fixed part B.Static part C.Variable part D.Auxiliary part

Q13

Which asymptotic notation is used to describe the lower bound or the best-case scenario of an algorithm?

A.Big O B.Big Theta C.Big Omega D.Big o

Q14

If a sequential search is performed on a list of n elements, what is the mathematical formula used to calculate the average number of comparisons?

A.n / 2 B.(n + 1) / 2 C.n * (n - 1) / 2 D.(n - 1) / 2

Q15

What is defined as the specific way of designing an algorithm to solve a given problem?

A.Algorithmic strategy B.Algorithmic solution C.Program statement D.Subroutine design

Q16

What is the primary prerequisite or condition that must be met by a list of elements before performing a Binary Search?

A.The list must be unsorted. B.The list must be sorted. C.The list must contain only integers. D.The list must have an even number of elements.

Q17

Why is the Bubble Sort algorithm considered less efficient when compared to other methods like Insertion Sort?

A.It does not use adjacent comparisons. B.It is too slow because it repeatedly compares adjacent elements and performs many swaps. C.It requires a sorted array as input. D.It cannot handle string arrays.

Q18

Which sorting algorithm improves on the performance of bubble sort by making only a single swap or exchange for every pass through the list?

A.Insertion sort B.Quick sort C.Selection sort D.Merge sort

Q19

How does the Insertion Sort algorithm build its final sorted array?

A.By swapping the largest elements to the end of the array B.By dividing the array in half and sorting each recursively C.By taking elements one by one and inserting them in their correct position in a sorted sub-list D.By randomly distributing elements into buckets

Q20

Dynamic programming divides a problem into smaller sub-problems. Which key optimization technique does it use to speed up execution by storing the results of previous function calls?

A.Recursing B.Backtracking C.Memoization D.Parsing

Q21

In Bubble Sort, what is guaranteed about the position of elements after the completion of the first iteration (iteration-1)?

A.The smallest element bubbles up to the first position. B.The entire array is fully sorted. C.The largest element is placed at its correct final position at the end of the array. D.The middle element is moved to the center.

Q22

Which of the following represents the correct formula used in pseudo-code to calculate the middle index of an array in Binary Search?

A.mid = low + high / 2 B.mid = low + (high - low) / 2 C.mid = (high - low) / 2 D.mid = low - (high + low) / 2

Q23

What does the term space-time tradeoff refer to in algorithm design?

A.Minimizing both space and execution time simultaneously B.Designing an algorithm that works only on standard platforms C.Solving a problem in less time by using more memory, or vice versa D.The physical time taken to clear the RAM after execution

Q24

According to the characteristics of an algorithm, what does the term Unambiguous mean?

A.The algorithm must have zero inputs. B.Each step and its inputs/outputs must be clear and lead to only one meaning. C.The algorithm should be generic and independent of any programming language. D.The algorithm must terminate after a finite number of steps.

Q25

Which characteristic of an algorithm ensures that it must terminate or stop after a specific number of steps?

A.Feasibility B.Definiteness C.Finiteness D.Correctness

More for this chapter

About this Algorithmic Strategies test

This free online practice test covers Algorithmic Strategies from the 12th Standard Computer Science (Samacheer Kalvi) syllabus. Choose the number of questions and an optional time limit, then answer and submit — everything is checked in your browser, with the correct answers and a worked explanation shown at the end. For the full solutions to every question in this set, see the solved MCQs page.

More chapters in Computer Science

View all