Every Book Back multiple-choice question from Algorithmic Strategies (12th Standard Computer Science, Samacheer Kalvi) — each with the correct option highlighted and a clear, worked explanation. Free to read in English and Tamil.
Q1
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. AlgorithmCorrect
- D. Syntax
Explanation. The word algorithm is derived from the name of the Persian mathematician Al-Khowarizmi, who wrote a textbook on mathematics.
Q2
From the following sorting algorithms which algorithm needs the minimum number of swaps?
- A. Bubble sort
- B. Insertion sort
- C. Selection sortCorrect
- D. All the above
Explanation. Selection sort performs a maximum of n-1 swaps, making it the most swap-efficient among the basic sorting methods.
Q3
Two main measures for the efficiency of an algorithm are
- A. Processor and memory
- B. Complexity and capacity
- C. Time and spaceCorrect
- D. Data and space
Explanation. Algorithm efficiency is primarily measured by time complexity, which counts key operations, and space complexity, which measures memory consumption.
Q4
The algorithm that yields expected output for a valid input is called as
- A. Algorithmic solutionCorrect
- B. Algorithmic outcomes
- C. Algorithmic problem
- D. Algorithmic coding
Explanation. An algorithm is considered a valid solution when it successfully produces the correct and expected output for any given valid input.
Q5
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 OCorrect
Explanation. Big O notation represents the upper bound of an algorithm's running time, which characterizes its performance in the worst-case scenario.
Q6
Big Ω is the reverse of
- A. Big OCorrect
- B. Big θ
- C. Big A
- D. Big S
Explanation. Big Omega is the reverse of Big O because it describes the lower bound or best-case scenario of an algorithm's complexity.
Q7
Binary search is also called as
- A. Linear search
- B. Sequential search
- C. Random search
- D. Half-interval searchCorrect
Explanation. Binary search is known as half-interval search because it repeatedly divides the sorted search interval in half to locate the target.
Q8
The Θ notation in asymptotic evaluation represents
- A. Base case
- B. Average caseCorrect
- C. Worst case
- D. NULL case
Explanation. The Theta notation is used to represent the average case complexity as it defines a tight bound for an algorithm's performance.
Q9
If a problem can be broken into subproblems which are reused several times, the problem possesses which property?
- A. Overlapping subproblemsCorrect
- B. Optimal substructure
- C. Memoization
- D. Greedy
Explanation. Overlapping subproblems occur when a recursive algorithm solves the same subproblems repeatedly rather than generating new ones.
Q10
In dynamic programming, the technique of storing the previously calculated values is called ?
- A. Saving value property
- B. Storing value property
- C. MemoizationCorrect
- D. Mapping
Explanation. Memoization is an optimization technique that speeds up programs by caching the results of expensive function calls for future reuse.
About these Algorithmic Strategies questions
These are the Book Back multiple-choice questions for Algorithmic Strategies from the Tamil Nadu State Board (Samacheer Kalvi) 12th Standard Computer Science syllabus. Each question shows the correct option and an original, step-by-step explanation so you understand the method, not just the answer. Use the answer key above to jump to any question, then take the practice test to check yourself under exam-like conditions.
Frequently asked questions
How many MCQs are there in Algorithmic Strategies?
This chapter has 10 book-back multiple-choice questions, each with the correct answer and a step-by-step explanation.
Are these 12th Standard Computer Science MCQs free to practise online?
Yes. Every question, answer and explanation here is free, and you can also take them as a timed practice test.
Where can I find the Algorithmic Strategies book-back answers?
The correct option for each question is highlighted on this page with a worked explanation, plus a quick answer-key summary at the top.
