| 1 |
Whcih step involves creating a set of instructions to solve a sprblem. |
- A. Decomposition
- B. Algorithm Design
- C. Generalization and Abstraction
- D. Pattern recongnition
|
| 2 |
Discover the principles that caue the patterns of a problem is called. |
- A. Generalization
- B. Design
- C. pattern Recognition
- D. Deconstruction
|
| 3 |
The algorithm which goes through al possible solutions untill the required soultionin found is. |
- A. Recursive Algorithm
- B. Searchign algorithm
- C. Brute force algorithm
- D. Sortig algorithm
|
| 4 |
Which type of loop stops when the condition is false |
- A. Finite loop
- B. Infinitie loop
- C. Sequence loop
- D. Rcursive loop
|
| 5 |
What is the efficiency of a solution based on in terms of the given paremeters. |
- A. Numbers of lines of code
- B. amount of memory available
- C. Number of steps executed
- D. Complexity of the solution
|
| 6 |
Which of the following is not a cornerstone of Computatonal Thingking? |
- A. Decomposition
- B. Pattern reongnition
- C. Generalization and Abstraction
- D. Probability calculation
|
| 7 |
Which strcuture executes a statement or set of statements only if the condition in true. |
- A. Sequence strcuture
- B. Selection strcuture
- C. Conditinal structure
- D. Repetition structure
|
| 8 |
Which symbol represents the start or stop point in a flowcart. |
- A. Arrow
- B. Terminal
- C. Decision
- D. Input/Output
|
| 9 |
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
|
| 10 |
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
|
