Topic 7 Flashcards
What is linear search [3]
A method that inspects each item in a list
-in turn
-to see if the item matches the value searched for
What is bubble sort? [5]
A method that compares each element with the next
-to swap if they are in the wrong order
-starting from the first element and finishing with the second last element
-compare again except last element because it is correct
-repeat until it reaches one element left
What does validation do? [2]
-ensure that only data that is reasonable is accepted
-reject unreasonable data and explains reason
What does verification do?
check that the data is accurately copied from one source to another
What types of verification are there? [2]
-double entry
-screen/visual check
What types of validation are there? [6]
-presence check
-type check
-range check
-length check
-check digit
-format check
Explain range check
checks that the value is between an upper value and a lower value
Explain length check
checks the number of characters in a data
Explain Type check
checks data entered is certain type of data eg. integer, string
Explain Presence check
checks that some data has been entered and the value hasn’t been left blank
Explain format check
checks data entered conform to a pre defined pattern
Explain check digit
final digit included in a code calculated from all the other digits to indentify errors
Explain double entry
when data is entered twice, checked if they are identical, and output error message if they aren’t
Explain screen/visual check
when user is asked to confirm data entered after data is displayed
Explain set of test data
all the items of data required to work through a solution
Explain normal data
set of test data that an algorithm is expected to work with
Explain abnormal test data (erroneous test data)
a test data that would be rejected by an algorithm as not suitable
Explain extreme data
largest and smallest values that normal data can take
Explain boundary data
two values: one rejected, one accepted to establish where the extreme data occur
Explain trace table
used to record the results from each step in an algorithm
Explain dry run
the manual exercise of working through an algorithm step by step