Q2 Comprog Summative Test I

How many types of structures can an algorithm have?

• 1

• 2

• 3

• 4

Which of the following is not one of the basic tasks of a computer?

• Input  

• Output

• Process

• Update

Which of the following is another term for the loop structure?

• Branch

• Repetition

• Selection

• Condition

What do you call a result taken from the intermediate stage of the operation?

• End result

• Preliminary result

• Quick result

• Intermediate result

Which of the following does not represent an algorithm?

• Formulae

• Pseudocodes

• Flowcharts

• Natural languages

What characteristic is seen if an algorithm always terminates after a finite number of steps?

• Output

• input

• Definiteness

• Finiteness

Which algorithm characteristic says that each step of an algorithm must be precisely defined?

• Finiteness

• Output

• Definiteness

• input

It is the algorithm characteristic that states that any operation you perform need some beginning value. Which of the following is it?

• Finiteness

• Definiteness

• input

• Output

What characteristic is shown when one always expects output/result?

• Output

• input

• Definiteness

• Finiteness

What is another term for branch structure?

• Conditioning

• Selection

• Repetition

• Loop