#### Specification and Abstraction Model Questions

11th Standard

Reg.No. :
•
•
•
•
•
•

Computer Science

Time : 01:00:00 Hrs
Total Marks : 50
10 x 1 = 10
1. Which of the following activities is algorithmic in nature?

(a)

Assemble a bicycle

(b)

Describe a bicycle.

(c)

Label the parts of a bicycle.

(d)

Explain how a bicycle works.

2. Which of the following activities is not algorithmic in nature?

(a)

Multiply two numbers

(b)

Draw a kolam.

(c)

Walk in the park

(d)

Braid the hair

3. Ensuring the input-output relation is

(a)

the responsibility of the algorithm ana the right of the' user.

(b)

the responsibility of the user and the right of the algorithm.

(c)

the responsibility of the algorithm but not the right of the user.

(d)

the responsibility of both the user and the algorithm.

4. If i = 5 before the assignment i = i-1 after the assignment, the value of i is

(a)

5

(b)

4

(c)

3

(d)

2

5. Which of the following not used to construct algorithm?

(a)

Data

(b)

Process

(c)

Control flow

(d)

Functions

6. How many statements are there to alter the normal flow of control?

(a)

1

(b)

2

(c)

3

(d)

many

7. Which of the following statement is not used to alter the normal flow of control?

(a)

Sequential control flow

(b)

Assignment

(c)

Alternative control flow

(d)

iterative control flow

8. Decomposition means

(a)

States the relation between the input and the output

(b)

Hiding unnecessary details

(c)

An algorithm is composed of assignment and control flow statement.

(d)

Dividing the main algorithm into functions

9. ___________________state the properties of the given input and the relation between the input and the output.

(a)

Composition

(b)

Abstraction

(c)

Decomposition

(d)

Specification

10. __________________is the left side of the assignment.

(a)

Variable

(b)

Value

(c)

Operator

(d)

All the above

11. 5 x 2 = 10
12. Define an algorithm.

13. Specify a function to find the minimum of two numbers.

14. What is an Algorithm?

15. Define variable.

16. What are the basic principles and techniques for designing Algorithms.

17. 5 x 3 = 15
18. What is the form and meaning of assignment statement?

19. What is the difference between assignment operator and equality operator?

20. How will you construct an algorithm?

21. How do you know whether the state changes in an algorithm?

22. What is control flow?

23. 3 x 5 = 15
24. Exchange the contents: Given two glasses marked A and B. Glass A is full of apple drink and glass B is full of grape drink. For exchanging the contents of glasses A and B, represent the state by suitable variables, and write the specification of the algorithm.

25. Explain how will you design algorithms.

26. Explain the specification format.