Computer Science test

the application of each step of an algorithm in order in which the statments are giving

• Iteration

• sequencing

• selection

Comparing two values with each other determine which of the two parts of an algorithmn is used

• Ilteration

• sequencing

• selection

Repetition of part of an algorithm untill a condition is met or for a specified number of times

• Iteration

• sequencing

• selection

What might happen if the sequence is wrong ?

• The algorithm may be overly long

• The algorithm may be inefifcient

• The algorithm may produce unexpected results

To find a good solution in a reasonable time, we can use...

• Heuristic

• Artificial Intelligence

• Sorting

what three building blocks are used when designing algorithms

• Sequencing , selection, iteration

• sequencing, programming, iteration

• sequencing, selection, programming

Why is selection important

• selection allows us to include more than one path through a solution

• selection allow us to repeat steps in a solution

• selection allows us make our solution more efficient

Algorithms can(choose as many as necessary)

• Be different but still solve the same problem

• Be used just like a human mind

• Be combined to make new algorithms

Languages for algorithms include( select as many as necessary)

• Natural Language

• Pseudocode

• visual and Textual programming languages

What is something we don't use an algorithm for

• To provide a correct solution for any given input

• To give every possible answer for every problem the could ever be

• To use computational resources as efficiently as possible