11th Standard Syllabus & Materials

11th Standard

TN 11th English Supplementary - 3 - The First Patient (Play) Sample Question Papers Study Material - QB365 Set A

NEW

11th Standard

TN 11th English Prose - 3 - Forgetting Sample Question Papers Study Material - QB365 Set A

NEW

11th Standard

TN 11th English Prose - 2 - The Queen of Boxing Sample Question Papers Study Material - QB365 Set A

NEW

11th Standard

TN 11th English Poem - 1 - Once Upon A Time Sample Question Papers Study Material - QB365 Set A

NEW

11th Standard

TN 11th English Prose - 1 - The Portrait of a Lady Sample Question Papers Study Material - QB365 Set A

NEW

11th Standard

TN 11th Computer Applications Tamil Computing Sample Question Papers Study Material - QB365 Set A

11th Standard English Medium Computer Science Subject Iteration and recursion Book Back 1 Mark Questions with Solution

Published on: 09/06/2021

QB365 provides detailed and simple solution for every book back questions in class 11 Computer Science subject.It will helps to get more idea about question pattern in every book back questions with solution.

Download Tamil Nadu 11th Standard Computer Science question papers, model tests, one-mark questions, important questions, and public exam papers in PDF format. Free study materials and answer keys for TN State Board students.

Questions + Answers key

Take MCQ Computer Science Test

QB365 Student Learing Managemnet System

Std: 11th Standard - Computer Science

chapter: - Book back Questions

Visit QB365-SLMS - https://www.qb365.in/slms/ Complete Questions and Answers

Questions:

Multiple Choice Question

5 x 1 = 5

If Fibonacci number is defined recursively as
\(F(n)= \begin{cases}0 \ \mathrm{n}=0 \\ 1 \ \mathrm{n}=1 \\ \mathrm{~F}(\mathrm{n}-1)+\mathrm{F}(\mathrm{n}-2) \text { otherwise }\end{cases}\)
to evaluate F(4), how many times F() is applied?

(a)

(b)

(c)

(d)

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)

3 x m - 2 x n

(d)

2 x m - 3 x n

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, n = 7

(b)

m = 7, n = -8

(c)

m = 7, n = 8

(d)

m = 8, n = -7

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

A loop invariant need not be true

(a)

at the start of the loop

(b)