11th Computer science - Book Back Answers - Chapter 8 - English Medium Guides

Plus One / 11th Computer Science - Book Back Answers - Chapter 8 - English Medium

Tamil Nadu Board 11th Standard Computer science - Chapter 8: Book Back Answers and Solutions

    This post covers the book back answers and solutions for Chapter 8 – Computer science from the Tamil Nadu State Board 11th 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 Computer science Chapter 8 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 11 students! Prepare well and aim for top scores. Thank you!

Chapter 8 :Iteration And Recursion

I. Choose the correct answer

1. A loop invariant need not be true
(a) at the start of the loop
(b) at the start of each iteration
(c) at the end of each iteration
(d) at the start of the algorithm
Answer Key:

(d) at the start of the algorithm

 
2. We wish to cover a chessboard with dominoes,the number of black squares and the number of white squares covered by dominoes, respectively, placing a domino can be modeled by
(a) b:= b + 2
(b) w:= w + 2
(c) b, w:= b + 1 , w + 1
(d) b :=w
Answer Key:
(c) b, w:= b + 1 , w + 1

 
3. If m x a + n x b is an invariant for the assignment a, b:= a + 8 , b + 7 the values of m and n are
(a) m = 8 h = 7
(b) m = 7 n = - 8
(c) m = 7 n = 8
(d) m = 8 n = - 7
Answer Key:
(b) m = 7 n = - 8

 
4.Which of the following is not an invariant of the assignment?
m, n:= m + 2 , n + 3
(a) m mod 2
(b) n mod 3
(c) 3Xm - 2Xn
(d) 2Xm - 3Xn
Answer Key:
(d) 2Xm - 3Xn

 
5. If Fibonacci number is defined recursively as
F(n)=aaaaa
to evaluate F(4) how many times F () is applied?
(a) 3
(b) 4
(c) 8
(d) 9
Answer Key:
(d) 9

 
6. Using this recursive definition
aaaaaaa

how many multiplications are needed to calculate a¹º?
(a) 11
(b) 10
(c) 9
(d) 8
Answer Key:
(b) 10

II. Very Short Answers

11th computer science

III. Short Answers

11th computer science

IV. Explain in detail

11th Computer science