12th Compuer Science - Book Back Answers - Chapter 4 - English Medium Guides

 

 

Plus Two / 12th Computer Science - Book Back Answers - Chapter 4 - English Medium

Tamil Nadu Board 12th Standard Computer Science - Chapter 4: Book Back Answers and Solutions

    This post covers the book back answers and solutions for Chapter 4 from the Tamil Nadu State Board 12th Standard Computer Science textbook. These detailed answers have been carefully prepared by our expert teachers at KalviTips.com.

    We have explained each answer in a simple, easy-to-understand format, highlighting important points step by step under the relevant subtopics. Students are advised to read and memorize these subtopics thoroughly. Once you understand the main concepts, you’ll be able to connect other related points with real-life examples and confidently present them in your tests and exams.

    By going through this material, you’ll gain a strong understanding of Chapter 4 along with the corresponding book back questions and answers (PDF format).

Question Types Covered:

• 1 Mark Questions: Choose the correct answer, Fill in the blanks, Identify the correct statement, Match the following 
• 2 Mark Questions: Answer briefly 
• 3, 4, and 5 Mark Questions: Answer in detail

All answers are presented in a clear and student-friendly manner, focusing on key points to help you score full marks.

All the best, Class 12 students! Prepare well and aim for top scores. Thank you!

Chapter 4: Algorithmic Strategies

I. Choose the correct answer.

1. 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
Answer Key:
(C) Algorithm

2. 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
Answer Key:
(C) Selection sort

3. 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
Answer Key:
(C) Time and space

4. The algorithm that yields expected output for a valid input in called as
(A) Algorithmic solution
(B) Algorithmic outcomes
(C) Algorithmic problem
(D) Algorithmic coding
Answer Key:
(A) Algorithmic solution

5. 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
Answer Key:
(D) Big O

6. Big Ω is the reverse of
(A) Big O
(B) Big θ
(C) Big A
(D) Big S
Answer Key:
(A) Big O

7. Binary search is also called as
(A) Linear search
(B) Sequential search
(C) Random search
(D) Half-interval search
Answer Key:
(D) Half-interval search

8. The Θ notation in asymptotic evaluation represents
(A) Base case
(B) Average case
(C) Worst case
(D) NULL case
Answer Key:
(B) Average case

9. 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
Answer Key:
(A) Overlapping subproblems

10. 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
Answer Key:
(C) Memoization

II.Answer the following questions.

12th Computer Science (soon)

III. Answer the following questions.

12th Computer Science (Soon)

IV. Answer the following questions.

12th Computer Science (Soon)