| 1 |
The sequence where we repeat a specific set of instructions, again and again, is called. |
- A. Condition
- B. Sequence
- C. Loop
- D. All
|
| 2 |
Whih of the followign is not a rule for drawing flowcharts. |
- A. Use conventional flowchart symbols
- B. Label all flow lines
- C. Every flowchart must have start and endpoints
- D. Flow lines cna cross each other
|
| 3 |
Which does the diamond symbol represent in a flowchart. |
- A. Input/Output
- B. Arrow
- C. Terminal
- D. Decision
|
| 4 |
The loops which have to be terminated are called. |
- A. Infinite loops
- B. Finite loops
- C. Simple loops
- D. INermediate loops
|
| 5 |
Which of the following is not a cornerstone of Computatonal Thingking? |
- A. Decomposition
- B. Pattern reongnition
- C. Generalization and Abstraction
- D. Probability calculation
|
| 6 |
Whcih step involves creating a set of instructions to solve a sprblem. |
- A. Decomposition
- B. Algorithm Design
- C. Generalization and Abstraction
- D. Pattern recongnition
|
| 7 |
What are the prerequisites for writing an algorithm |
- A. A clear prblem definitionl input and output
- B. A broblem with no constracints or limitations
- C. Input with multipel characters
- D. A problem with no clear solution
|
| 8 |
The loops which are never going to end are called. |
- A. Finite loops
- B. Infinite loops
- C. Intermediate loops
- D. Simple loops
|
| 9 |
What is Computational Thinking. |
- A. Problem -solving skills and techniques
- B. Solving problems using computers
- C. Breaking down problems into smaller parts
- D. Recognizing patterms in images
|
| 10 |
What is the first step in solving a problem with an algorighm. |
- A. Desingning the algorithm
- B. Fulfilling the prerequisites
- C. Implementing the algorithm
- D. Testing the algorithm
|
