#### Specification and Abstraction - Important Question Paper

11th Standard

Reg.No. :
•
•
•
•
•
•

Computer Science

Time : 01:00:00 Hrs
Total Marks : 50

Part A

12 x 1 = 12
1. 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

2. Omitting details inessential to the task and representing only the essential features of the task is known as

(a)

specification

(b)

abstraction

(c)

composition

(d)

decomposition

3. Stating the input property and the as output relation a problem is known

(a)

specification

(b)

statement

(c)

algorithm

(d)

definition

4. If 0 < i before the assignment i = i-1 after the assignment, we can conclude that

(a)

0 < i

(b)

0 $\le$ i

(c)

i = 0

(d)

0 $\ge$i

5. How many basic building blocks are there to construct algorithms?

(a)

1

(b)

2

(c)

4

(d)

3

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

(a)

Data

(b)

Process

(c)

Control flow

(d)

Functions

7. In computers, operations on data performed by

(a)

instructions

(b)

program

(c)

process

(d)

all of these

8. What is the specification of the algorithm?

(a)

divide (A + B)

(b)

square - root(n)

(c)

square - root (x)

(d)

9. __________________statement is used to store a value in a variable.

(a)

Assignment

(b)

Sequential control flow

(c)

Alternative control flow

(d)

Iterative

10. The data stored in a varibale is also called a_________________

(a)

process

(b)

data

(c)

value

(d)

constant

11. Each part of _______________ algorithm is known as

(a)

input

(b)

function

(c)

variable

(d)

program

12. __________________is the left side of the assignment.

(a)

Variable

(b)

Value

(c)

Operator

(d)

All the above

13. Part B

5 x 2 = 10
14. Define an algorithm.

15. Distinguish between an algorithm and a process

16. Initially, farmer, goat, grass, wolf = L, L, L,.L and the farmer crosses the river with goat. Model the action with an assignment statement:

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

18. Mention the three different types of Chameleons.

19. Part C

6 x 3 = 18
20. What is the difference between assignment operator and equality operator?

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

22. What is control flow?

23. Name the control flow statements used in an algorithm.

24. Write the specification format of an algorithm for computing the square root of a number.

25. Which defines the rights and responsibilities of the designer and user of the algorithm?

26. Part D

2 x 5 = 10
27. Explain the types of control flow statements.

28. Explain the three control flow statement.