CODING (!!) - Paper 2 Flashcards

1
Q

stages of the program development life cycle

A

analysis, design, coding and testing

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
2
Q

analysis

A

abstraction, decomposition of the problem, identification of the problem and requirements

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
3
Q

design

A

structure diagrams, flowcharts, pseudocode

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
4
Q

coding

A

writing program code and iterative testing

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
5
Q

testing

A

testing program code with the use of test data

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
6
Q

standard methods of solution

A

– linear search
– bubble sort
– totalling
– counting
– finding maximum, minimum and average values

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
7
Q
A

flow line - arrow representing control passing between shapes

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
8
Q
A

process - something being performed or done

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
9
Q
A

subroutine - relate to separate flowchart

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
10
Q
A

input/output

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
11
Q
A

decision (true or false/yes or no) resulting in two lines

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
12
Q
A

terminator - start/stop

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
13
Q

test data types

A

– normal
– abnormal
– extreme
– boundary

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
14
Q

Normal data

A

Data that is within an accepted range

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
15
Q

Boundary data

A

A pair of values indicating the upper and lower bounds that should be accepted and a pair of values that should be rejected.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
16
Q

Extreme data

A

Data at the upper and lower bounds of the accepted range.

17
Q

methods to design and construct a solution to a problem

A

– structure diagrams
– flowcharts
– pseudocode

18
Q

Abnormal data

A

Any data that is not accepted, either outside the accepted range or the incorrect data type.

19
Q

types of validation check

A

– range check
– length check
– type check
– presence check
– format check
– check digit

20
Q

presence check

A

check missing data in field (mandatory primary key)

21
Q

range check

A

check if data is within range (days of week from 1 to 7)

22
Q

length check

A

check if length is met (password minimum of 8 digits)

23
Q

format check

A

check if data is in desired format (month/day or day/month)

24
Q

consistency check

A

check if data is consistent with previous entries (date of expiration cant be before manufacture)

25
Q

type check

A

check data type (phone number cant have letters)

26
Q

types of verification check

A

– visual check
– double entry check

27
Q

Visual check

A

user manually verifies the data they have input against the original source of the same data

28
Q

Double entry check

A

automated verification check where the system asks you to re-type or input the same data twice

29
Q

integer

A

only whole number

30
Q

real

A

any number (decimals included)

31
Q

char

A

a single character from the keyboard

32
Q

string

A

multiple characters from the keyboard

33
Q

Boolean

A

only one of two possible values

34
Q

linear search

A

algorithm used by computers where an array is searched sequentially, one element after another, until the searched value’s presence or absence is confirmed. So the algorithm stops when it meets one of these conditions:

the value is found
the end of the array is reached without having found the value.

35
Q

bubble sorting

A

process of ordering elements in a list

sort where the smallest values in a list rise to the top, like bubbles in a glass of water. A bubble sort is a sorting algorithm used to sort a data array sequentially, from smallest to largest or largest to smallest.

36
Q

MOD

A

returns remainder (9/2 = 1)

37
Q

DIV

A

divides ignoring remainder (17/5 = 3)