| 1 |
Set of instructions to solve a problem is called. |
- A. Directions
- B. Algorithm
- C. Instructions
- D. Design
|
| 2 |
What is the characteristic of an algorithm that states that each step must be clear and lead to only one measning. |
- A. Clear and unambiguous
- B. Well-defined imputs
- C. Well -defined outputs
- D. Feasible
|
| 3 |
Discover the principles that caue the patterns of a problem is called. |
- A. Generalization
- B. Design
- C. pattern Recognition
- D. Deconstruction
|
| 4 |
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
|
| 5 |
The sequence where we repeat a specific set of instructions, again and again, is called. |
- A. Condition
- B. Sequence
- C. Loop
- D. All
|
| 6 |
Which symbol represents the start or stop point in a flowcart. |
- A. Arrow
- B. Terminal
- C. Decision
- D. Input/Output
|
| 7 |
What is the purpose of the "Mod"% in programming. |
- A. To add two integers
- B. To multiply two integers
- C. To take the remainder of an integer
- D. To divide two integers
|
| 8 |
Which tpe of algorithm goes through all possible solutions untill the required solution is found? |
- A. Brute force algorithm
- B. Recursive algorithm
- C. Sorting algorithm
- D. Divide and conuer algorithm
|
| 9 |
What is the tpe of algorithm that uses a random numebr to decide the expected outcome. |
- A. Brute force algorihm
- B. Recursive algorithm
- C. Sorting algorithm
- D. Randomized algorithm
|
| 10 |
Breaking down a problem into sub-problems is called. |
- A. Generalization
- B. Doconstruction
- C. Design
- D. Pattern Recognition
|
