| 1 |
Every algorithm has......... and ....... |
- A. Loop, condition
- B. Start, stop
- C. finite, infinite loops
- D. Sequence, conditions
|
| 2 |
How many steps are there in the problem solving process. |
|
| 3 |
Thinking the domain of problem and ignoring irrelevant material is called. |
- A. Algorithmic design
- B. Pattern identificaiton
- C. Problem decomposition
- D. Abstraction
|
| 4 |
What is the process of algorithmic thinking. |
- A. A series of systematic and logical steps
- B. A way of solving a specific problem
- C. A process without clear in instructions
- D. A way of breaking down prblem into smaller problems.
|
| 5 |
Looking for similarites among the problems is called. |
- A. Algorithmic design
- B. Pattern identification
- C. Abstraction
- D. Problem decomposition
|
| 6 |
What is the final step in the systematic problem-solving process. |
- A. Problem definition
- B. Problem aalysis
- C. Planning solution
- D. Selecting the best solution
|
| 7 |
What are the two directions in teh that a robot can move in a maze problem. |
- A. Forward and down
- B. Up and left
- C. Right and down
- D. Forward and back
|
| 8 |
What is the main purpose of an algorithm. |
- A. To store information
- B. To solve a specific problem
- C. To perform a specific task
- D. To automatte the decision making process
|
| 9 |
Which of the followig is NOT a benefit of algorithmic thinking. |
- A. Decomposition
- B. Abstraction and Generalization
- C. Visualization
- D. Pattern Recognition
|
| 10 |
What type of flow is used to print a table of given number up to 10. |
- A. Sequntial flow
- B. Conditional flow
- C. Repetitive flow
- D. None of the above
|