| 1 |
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
|
| 2 |
The sequence where we repeat a specific set of instructions, again and again, is called. |
- A. Condition
- B. Sequence
- C. Loop
- D. All
|
| 3 |
Which does the diamond symbol represent in a flowchart. |
- A. Input/Output
- B. Arrow
- C. Terminal
- D. Decision
|
| 4 |
The loops which are never going to end are called. |
- A. Finite loops
- B. Infinite loops
- C. Intermediate loops
- D. Simple loops
|
| 5 |
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
|
| 6 |
The loops which have to be terminated are called. |
- A. Infinite loops
- B. Finite loops
- C. Simple loops
- D. INermediate loops
|
| 7 |
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
|
| 8 |
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
|
| 9 |
Which symbol represents the start or stop point in a flowcart. |
- A. Arrow
- B. Terminal
- C. Decision
- D. Input/Output
|
| 10 |
Breaking down a problem into sub-problems is called. |
- A. Generalization
- B. Doconstruction
- C. Design
- D. Pattern Recognition
|
