| 1 |
Which symbol represents a process in a flochart. |
- A. Terminal
- B. Arrow
- C. Action/Process
- D. Decision
|
| 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 |
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
|
| 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 |
Which step involves breaking down complex prblems into smaller parts. |
- A. Decompostion
- B. Pattern recongnition
- C. Generalization and Abstraction
- D. Algorithm Design
|
| 6 |
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
|
| 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 of the following is not a cornerstone of Computatonal Thingking? |
- A. Decomposition
- B. Pattern reongnition
- C. Generalization and Abstraction
- D. Probability calculation
|
| 9 |
Discover the principles that caue the patterns of a problem is called. |
- A. Generalization
- B. Design
- C. pattern Recognition
- D. Deconstruction
|
| 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
|
