Scribd
Upload
15 views16 pages

Igcse Cei Computer Science

The document discusses problem solving and algorithms, highlighting the purpose of algorithms and standard methods such as linear search and bubble sort. It emphasizes the importance of validation and verification in data entry, as well as the use of trace tables and test data for identifying and correcting errors in algorithms. Additionally, it mentions the process of writing and amending algorithms, along with exam-style questions related to the topic.

Uploaded by

fawzanusmani1509
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
15 views16 pages

Igcse Cei Computer Science

The document discusses problem solving and algorithms, highlighting the purpose of algorithms and standard methods such as linear search and bubble sort. It emphasizes the importance of validation and verification in data entry, as well as the use of trace tables and test data for identifying and correcting errors in algorithms. Additionally, it mentions the process of writing and amending algorithms, along with exam-style questions related to the topic.

Uploaded by

fawzanusmani1509
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
You are on page 1/ 16

Problem Solving and

Algorithm
Example:
Explaining the purpose of an
algorithm
Standard methods of solution
Linear search
Bubble sort
Validation and verification
For data entry, validation ensures that only data that is reasonable is accepted. Verification is used to check that the
data does not change as it is being entered. Different types of checks may be used on the same piece of data.
Test data:
Trace tables:
A trace table records the
results from each step in an
algorithm; it shows the value
of each variable every time
that it changes. Working Identifying errors in algorithms:
through an algorithm step by Trace tables and test data can be used to identify errors and correct
errors.
step is called a dry run. A trace
table is set up with a column
for each variable and a column
for any output. For example:
Writing and amending
algorithms:
Exam-style questions

You might also like