COMPUTER SCIENCE AND ENGINEERING
ALGORITHMS
|
Question
[CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER]
|
|
|
Draw a 1 cm line, draw a 1 cm line, turn left 90 degrees, draw a 1 cm line, turn left 90 degrees, draw a 1 cm line, turn left 90 degrees
|
|
|
Draw a 1 cm line, turn left 90 degrees, draw a 1 cm line, draw a 1 cm line, turn left 90 degrees, draw a 1 cm line, turn left 90 degrees
|
|
|
Draw a 1 cm line, turn left 90 degrees, draw a 1 cm line, turn left 90 degrees, draw a 1 cm line, turn left 90 degrees, draw a 1 cm line
|
|
|
None of the above
|
Detailed explanation-1: -Sequencing is the sequential execution of operations, selection is the decision to execute one operation versus another operation (like a fork in the road), and iteration is repeating the same operations a certain number of times or until something is true.
Detailed explanation-2: -Sequencing is the specific order in which instructions are performed in an algorithm. For example, a very simple algorithm for brushing teeth might consist of these steps: put toothpaste on toothbrush. use toothbrush to clean teeth.
Detailed explanation-3: -When designing algorithms, it is important to make sure that all the steps are presented in the correct order. This is known as sequencing, and can be displayed in pseudocode or flowcharts.