Paper 2 Flashcards

1
Q

What is the program development life cycle

A

Analysis
Design
Coding
Testing

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

What are the stages in analysis

A

Abstraction
Decomposition of the problem
Identification of the problem
Requirements

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

What is the stages of design

A

Decomposition
Structure diagrams
Flowcharts
Pseudo code

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

Stages of coding

A

Writing program code
Itreative testing

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

Stages of testing

A

Testing program with the use of test data

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

What is every computer system made up of

A

Sub systems which are made up of further sub systems that performs a single test or action

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

What is decomposition

A

Means breaking a complex problem down into more manageable parts

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

Advantages of decomposition

A

Makes problems easier to solve
Different people can work on different parts at the same time, reducing development time
Program components developed in one program can be easily used in other programs

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

What is inputs

A

Anything that needs to be supplied to the program so it can meet its goals - often supplied by the user
Consider an appropriate variable name and data type for inputs

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

What is processes

A

Calculations that need to be performed while the program is running
Consider whether any data need to change format or data type

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

WHat is outputs

A

Consider what your program needs to output to the user
Consider what firm outputs take
Consider an appropriate name and data type for outputs

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

What is storage

A

Consider any data that needs to be stored in files on an appropriate medium for use or retrieval in the future

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

Structure diagrams

A

A method of designing a solution to a problem
Produced using a method known as step-wise refinement
Bre@k a problem down into sub-problems using decomposition
Some areas of the program will need to be broken down more than others
Lowest-level nodes should achieve one task - and therefore, be coded as a single module or sub-program

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

What is flow chart

A

Is a method of representing the sequence of steps in an algorithm in the form of a diagram

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

What is pseudo code

A

Is an alternate , text based way of representing the sequence of steps in an algorithm
It can be thought of a simplified form of programming code

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

What is the start and stop shape for flowcharts

A

Looks like car mirror
_________
( ________ )

Called terminal

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

What is the symbol of calculation or something that is happening in flowcharts

A

It’s called process
__________
|_________|

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

What is the shape where you ask the questions or branch off

A

It’s decision
Diamond

/\
\/

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

What is the shape of where you say “what is your name”

A

Input output
__________
/_________/

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

What is an algorithm

A

A specific sequence of steps that can be followed to complete a task

21
Q

Linear search

A

Doesn’t require data to be in order
Works on any type of storage device
Is efficient for small data sets
Is inefficient for large data sets

22
Q

Bubble sort

A

Sorts an unordered list of items
Compares them and swaps them if they are out of order
Finished when no more swaps are needed
Easy to implement
Popular choice for small data sets

23
Q

Standard methods of solution

A

Totalling
Counting
Finding max and min and average values
Bubble sort
Linear search

24
Q

Check digit

A

Commonly used with
Barcodes
Ibsn numbers
Vehicular identification numbers

25
Q

Input validations

A

Type
Range
Presence
Format
Length

26
Q

Type check

A

Input is correct data type
E.g interfere
Real
String

27
Q

Range check

A

The input is within the range
Eg 1 and 5

28
Q

Presence check

A

All required data has been entered
E.g reject blank inputs

29
Q

Format check

A

The input is correct format
E.g DD/MM/YY

30
Q

Length check

A

The input requires correct amount of characters

31
Q

Verification check

A

To test if the data I out is the same as the data that was intended to be input

32
Q

Validation check

A

To test is the data entered is responsible, sensible and possible

33
Q

Test data

A

Normal inputs
Abnormal inputs
Boundary input
Extreme data

34
Q

Normal input

A

Data that should be accepted without causing errors

35
Q

Abnormal inputs

A

Data that should be rejected by the program

36
Q

Boundary inputs

A

Data that is the largest/smallest value as well as the corresponding rejected value

37
Q

Extreme data

A

Largest/smallest acceptable data

38
Q

Types of errors

A

Syntax errors - errors that break grammatical rules of the program language and prevent it from being run
Logic errors - produce an unexpected output

39
Q

Double entry

A

Verification is the process of whereby important data has to be entered twice, sometimes by different people. The system then compares them to check they are the same

40
Q

What are two checks that are performed with manual check

A

Screen check
Visual check

41
Q

What is a variable

A

A value stored in memory that can change whilst the program is running

42
Q

What is constant

A

A value that is assigned when the program is first written and does not change whilst running

Easier to read
If constants are used instead of variables a compiler can be used to optimise code making it run faster

43
Q

Interger

A

Positive or negative WHOLE number

Not for telephone numbers

44
Q

Real

A

Number with decimal
Called float sometimes

45
Q

Character

A

Used for menu choices

46
Q

String

A

Multiple character letters
Telephone or words
“Craig”

47
Q

Boolean

A

True or false

48
Q

Sequence

A

Executing instructions