Computing-02-Assignment
1. A problem to be solved is not subjected to any conditions on variables and is not repetitive in nature. The basic control operation to be used is
(a) Sequential (b) Selection (c) Repetitive (d) None of these
2. A computer can execute
(a) An algorithm (b) A flow-chart (c) A program (d) None of these
3. A basic control structure always has
(a) One entry and two exit points (b) Two entry and one exit points
(c) One entry and one exit points (d) Any number of entry and exit points
4. The heart and nerve centre of a computer is
(a) Input unit (b) Output unit (c) CPU (d) Memory
5. An algorithm must have at least
(a) One input (b) One output (c) One assignment (d) None of these
6. A number of data items are to be read in a problem. The control structure needed is
(a) Only sequential (b) Only selection (c) Selection or repetition (d) Sequential or repetition
7. The control structure IF-THEN-ELSE is a
(a) Single selection (b) Multiple selection (c) Repetition structure (d) None of these
8. The FOR-DO construct executes the loop at least
(a) Once (b) Twice (c) Thrice (d) None of these
9. The control structure CASE-OF is a
(a) Single selection (b) Multiple selection (c) Repetition structure (d) None of these
10. If A = 15, B = 22, the value of X after execution of the following pseudo code program is
READ A, B
IF A B
IF A 10
X A + B
ELSE X B – A
END
(a) 7 (b) 15 (c) 22 (d) None of these
11. If A = 7, B = 9, the value of A after execution of the following pseudo-code program is
BEGIN
INPUT A, B
IF A > B
TEMP A B
B A
A TEMP
ELSE
STOP
END
(a) 7 (b) 9 (c) 7 + 9 (d) 7 – 9
12. What is the decimal equivalent of binary number 10101
(a) 20 (b) 21 (c) 22 (d) 23
13. The octal equivalent of (101001110)2 is
(a) 116 (b) 561 (c) 615 (d) 516
14. What is the decimal equivalent of the octal number 219
(a) 140 (b) 145 (c) 150 (d) 155
15. The value of P by execution of the following algorithm is
Step I :
If Stop
else Go To Step I
Output P
end
(a) 6 (b) 24 (c) 120 (d) 720
16. Study the following algorithm
Sum
Repeat
Sum Sum + (2I + 1)
until
Then the minimum value of Sum is
(a) 36 (b) 49 (c) 140 (d) None of these
17. The statement
For To 10 by 20
do S
results in
(a) 2 cycles (b) 5 cycles (c) 10 cycles (d) None of these
Comments
Post a Comment