11th Standard Syllabus & Materials

11th Standard

TN 11th Tamil இயற்கை வேளாண்மை,சுற்றுச்சூழல் -செய்யுள் - மனோன்மணீயம் Important Questions And Answers Study Material - QB365 Set A

NEW

11th Standard

TN 11th Tamil என்னுயிர் என்பேன் -துணைப்பாடம் - இசைத்தமிழர் இருவர் Important Questions And Answers Study Material - QB365 Set A

NEW

11th Standard

TN 11th Tamil மொழி கலை -செய்யுள் - ஒவ்வொரு புல்லையும் Important Questions And Answers Study Material - QB365 Set A

NEW

11th Standard

TN 11th Tamil பீடு பெற நில் - இலக்கணம் - பகுபத உறுப்புகள் Important Questions And Answers Study Material - QB365 Set A

NEW

11th Standard

TN 11th Tamil பீடு பெற நில் - துணைப்பாடம் - வாடிவாசல் Important Questions And Answers Study Material - QB365 Set A

NEW

11th Standard

TN 11th Tamil பீடு பெற நில் - செய்யுள் - குறுந்தொகை Important Questions And Answers Study Material - QB365 Set A

11th Standard Computer Science - Iteration and Recursion One Mark Question with Answer

Published on: 29/08/2019

Iteration and Recursion

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: - Model Question paper

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

Questions:

Multiple Choice Question

10 x 1 = 10

Which of the following is the key to construct iterative algorithms?

(a)

loop invariant

(b)

loop updation

(c)

loop variable

(d)

loop condition

The unchanged variables of the loop body is called loop _______.

(a)

condition

(b)

loop statement

(c)

loop variable

(d)

loop invariant

Which of the following is updated when each time the loop body is executed?

(a)

Data

(b)

Variables

(c)

Function

(d)

All of these

Which statements executed repeatedly as long as the loop condition is true?

(a)

Sequential

(b)

Abstraction

(c)

Iteration

(d)

Assignment

Which of the following algorithm design techniques to execute the same action repeatedly?

(a)

Assignment

(b)

Iteration

(c)

Recursion

(d)

Both b and c

Using this recursive definition
\(a^n= \begin{cases}1 & \text { if } n=0 \\ a \times a^{n-1} & \text { otherwise }\end{cases}\)
how many multiplications are needed to calculate a¹⁰?

(a)

(b)

(c)

(d)

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)

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

10.

A loop invariant need not be true

(a)

at the start of the loop