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 English Medium Free Online Test One Mark Questions 2020 - 2021

Published on: 12/11/2020

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

The input size to a sub problem is __________ than the input size to the original problem.

(a)

equal

(b)

smaller

(c)

greater

(d)

no criteria

The loop invariant need not be true at the __________.

(a)

Start of the loop

(b)

end of the loop

(c)

end of each iteration

(d)

middle of algorithm

In a loop, if L is an invariant of the loop body B, then L is known as a __________

(a)

recursion

(b)

variant

(c)

loop invariant

(d)

algorithm

___________is an algorithm design technique, closely related to induction.

(a)

Iteration

(b)

Invariant

(c)

Loop invariant

(d)

Recursion

How many important points the loop variant is true?

(a)

(b)

(c)

(d)

How many cases are there a recursive solver has_______.

(a)

(b)

(c)

(d)

many

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 of the following algorithm design techniques to execute the same action repeatedly?

(a)

Assignment

(b)

Iteration

(c)

Recursion

(d)

Both b and c

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)

10.

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