4.4.1- ToC (Following and writing algorithms)

Question 1

What is meant by the term algorithm

Answer 1

A sequernce of steps that can be followed to complete a task and that always terminates

Question 2

What are the advantages of psuedocode

Answer 2

• Independent of any partticular language
• Allows those who are programmers to be involed in the development of a program

Question 3

What is the distinction between algorithms and computer programs

Answer 3

• Computer programs are simply just implementations of algorithms.

Question 4

How are the following represented in psuedocode:
1. assignment
2. selection
3. iteration

Answer 4

1. variable <– value
2. IF (condition) THEN
3. FOR number <– lb to ub (inclusive)

or

WHILE ( condition )

Question 5

When designing to make a solution for an algorithm, what must you consider

Answer 5

If the order of steps required to solve the problem is important or not

Question 6

How do you determine the purpose of an algorithm

Answer 6

• Analyse the inputs given and what those inputs are used to do
• Analyse the ranges in selections and iterations and compare the change between the input and output using test data

Question 7

What are the three types of test data

Answer 7

1. Normal
2. Boundary
3. Erroneous

Question 8

What is normal test data

Answer 8

any valid data input

Question 9

What is boundary test data

Answer 9

Edge Case data or data that sits ton the edge of the normal range of data

Question 10

What is Erroneous test data

Answer 10

any invalid data input, that should generate an error