11th Computer Science Monthly Test - 4 ( Iteration and recursion )

MABS Institution

11th Computer Science Monthly Test - 4 ( Iteration and recursion )-Aug 2020

Time : 2.00 Hours

Part - A

Multiple Choice Question - Answer All Question

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

Data
Variables
Function
All of these

Which of the following is not an invariant of the assignment? m, n := m2+, n3+

m mod2
n mod3
3 X m - 2 X n
2 X m - 3 X n

How many base case at least must be in recursion?

Which one is odd?

at the start of the loop (just before the loop)
at the start of each iteration (before loop body)
at the end of each iteration (after loop body)
at the middle of the loop (just before the loop)

Which of the following is the key to construct iterative algorithms

loop invariant
loop updation
loop variable
lop condition

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

b:= b + 2
w:= w + 2
b, w := b1+, w1+
b:= w

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

Assignment
Iteration
Recursion
Both b and c

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

The unchanged variables of the loop body is called loop

condition
loop statement
loop variable
loop invariant

When the solver calls a sub solver, then it is called _________.

Iterative call
solver call
recursive call
conditional call

Part - B

Generic 5 - Answer All Question

Explain recursive- problem solving.

Power can also be defined recursively as \({ a }^{ n }=\begin{cases} 1\quad \quad \quad \quad \quad \quad ifn=0 \\ a\times { a }^{ n }-1\quad \quad ifn\quad is\quad odd \\ { a }^{ n/2 }\times an/2\quad ifn\quad is\quad even \end{cases}\) Construct a recursive algorithm using this definition. How many multiplications are needed to calculate a¹⁰?

Design a recursive algorithm to compute aⁿ, We constructed an iterative algorithm to compute aⁿ in Example 8.5. aⁿ can be defined recursively as

A single square- covered board is a board of 2ⁿ * 2ⁿsquares in which one square is covered with a single square tile. Show that it is possible to cover the this board with triominoes without overlap.

Explain the outline of recursive problem-solving technique.

Give an example for loop invariant.

Assume an 8 * 8 chessboard with the usual coloring. "Recoloring" operation changes the color of all squares of a row or a column . you can recolor re - peatedly. The goal is to attain just one black squares , it changes by ( |8 - b ) - b| ).

Explain Loop invariant with a neat diagram.

Customers are waiting in a line at a counter. The man at the counter wants to know how many customers are waiting in the line.

Explain how will you solve a problem recursively.

Comment

Add Comment

InstaQB

Institutions

12th Standard English Medium

12th Standard Tamil Medium

11th Standard English Medium

11th Standard Tamil Medium

10th Standard English Medium

9th Standard English Medium

8th Standard English Medium

7th Standard English Medium

Class XII

Class XI

12Th Standard

11Th Standard

10Th Standard

9Th Standard

11th Computer Science Monthly Test - 4 ( Iteration and recursion )

MABS Institution

11th Computer Science Monthly Test - 4 ( Iteration and recursion )-Aug 2020

Part - A

Multiple Choice Question - Answer All Question

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

Which of the following is not an invariant of the assignment? m, n := m2+, n3+

How many base case at least must be in recursion?

Which one is odd?

Which of the following is the key to construct iterative algorithms

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

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

Using this recursive definition\({ a }^{ n }=\begin{cases} 1\quad \quad \quad \quad \quad \quad ifn=0 \\ a\times { a }^{ n }-1\quad otherwise \end{cases}\)how many multiplications are needed to calculate a10?

The unchanged variables of the loop body is called loop

When the solver calls a sub solver, then it is called _________.

Part - B

Generic 5 - Answer All Question

Explain recursive- problem solving.

Design a recursive algorithm to compute an, We constructed an iterative algorithm to compute an in Example 8.5. an can be defined recursively as

A single square- covered board is a board of 2n * 2n squares in which one square is covered with a single square tile. Show that it is possible to cover the this board with triominoes without overlap.

Explain the outline of recursive problem-solving technique.

Give an example for loop invariant.

Assume an 8 * 8 chessboard with the usual coloring. "Recoloring" operation changes the color of all squares of a row or a column . you can recolor re - peatedly. The goal is to attain just one black squares , it changes by ( |8 - b ) - b| ).

Explain Loop invariant with a neat diagram.

Customers are waiting in a line at a counter. The man at the counter wants to know how many customers are waiting in the line.

Explain how will you solve a problem recursively.

Comment

Other Study material

11th Computer Science Weekly Test -3 ( Tamil Compu

11th Computer Science Monthly Test -1 ( Tamil Comp

11th Computer Science Monthly Test -2 ( Tamil Comp

11th Computer Science Weekly Test - 1 ( Inheritanc

11th Computer Science Monthly Test - 1 ( Computer

11th Computer Science Weekly Test -4 (Computer Eth

11th Computer Science Weekly Test -3 ( Computer Et

11th Computer Science Weekly Test -2 (Computer Eth

11th Computer Science Weekly Test - 1 ( Computer E

11th Computer Science Monthly Test - 4 (Inheritanc

11th Computer Science Monthly Test - 3 ( Inheritan

11th Computer Science Monthly Test -2 (Inheritance

11th Computer Science Monthly Test -1 ( Inheritanc

11th Computer Science Weekly Test -4 (Inheritance)

11th Computer Science Weekly Test -3 (Inheritance

Tamilnadu Stateboardszs - Class

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

Design a recursive algorithm to compute aⁿ, We constructed an iterative algorithm to compute aⁿ in Example 8.5. aⁿ can be defined recursively as

A single square- covered board is a board of 2ⁿ * 2ⁿsquares in which one square is covered with a single square tile. Show that it is possible to cover the this board with triominoes without overlap.