HSC Science Class 11 - Tamil Nadu Board of Secondary Education Question Bank Solutions

Define an algorithm.

Distinguish between an algorithm and a process.

Specify a function to find the minimum of two numbers.

How is the state represented in algorithms?

Distinguish between a condition and a statement.

What is the difference between an algorithm and a program?

For the given flowchart write the pseudo-code.

For the given flowchart write the pseudo-code.

If C is false in line 2, trace the control flow in this algorithm.

1 S1

2 -- C is false

3 if C

4 S2

5 else

6 S3

7 S4

Draw a flowchart for -3 case analysis using alternative statements.

Circulate the contents: Write the specification and construct an algorithm to circulate the contents of the variables A, B, and C as shown below: The arrows indicate that B gets the value of A, C gets the value of B and A gets the value of C.

Trace the step-by-step execution of the algorithm for factorial(4).

factorial(n)

-- inputs : n is an integer , n ≥ 0

-- outputs : f = n!

f, i := 1 ,1

while i ≤ n

f, i := f × i, i+1

If C is false just before the loop, the control flows through

1 S1

2 while C

3 S2

4 S3

If C is true, S1 is executed in both the flowcharts, but S2 is executed in

(1)

(2)

We wish to cover a chessboard with dominoes, `square``square` the number of black squares, and the number of white squares covered by dominoes, respectively, placing a domino can be modeled by ______

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 ______

Which of the following is not an invariant of the assignment?

m, n := m + 2, n + 3

What is an invariant?

There are 7 tumblers on a table, all standing upside down. You are allowed to turn any 2 tumblers simultaneously in one move. Is it possible to reach a situation when all the tumblers are right-side-up?

A knockout tournament is a series of games. Two players compete in each game; the loser is knocked out (i.e. does not play anymore), the winner carries on. The winner of the tournament is the player that is left after all other players have been knocked out. Suppose there are 1234 players in a tournament. How many games are played before the tournament winner is decided?