Algorithm Design and Problem Solving Flashcards

1
Q

Algorithm

A

Each system and sub system in a computer is created from a series of instructions that tell the computer what to do. These instructions are known as algorithms.

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

Subroutine

A

A short section of code within a program. A small section of the program that is part of a larger program.

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

Library routine

A

A collection of common functions and subroutines that can be used in another program.

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

Algorithm Design Methods

A

Top down design
Structure diagrams
Flowcharts
Pseudocode

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

Complex problem

A

Referred to the system when designing the computer system

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

Sub problem

A

Referred to the sub systems

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

Top down design

A

A design method where an overall task (overall system) is broken down into smaller tasks (sub systems)

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

Decomposition

A

The process of breaking down larger tasks into smaller tasks. Such as breaking down smaller tasks into more sub or smaller tasks.

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

Structure diagram

A

A diagram that shows tasks that have been broken down and how they relate to each other.

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

Module

A

Individual section of code that can be used by other programs. Each box of the structure diagram.

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

Flow chart

A

A way of representing the structure and flow of an algorithm. It shows the sequence, paths and loops in an algorithm.

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

Pseudocode

A

A text based method of describing an algorithm

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

Syntax

A

The structure of a programming language

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

Test data

A

Known as sample data which is used to test each part of the code to make it bug free

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

Normal data

A

A type of test data where valid data which the code accepts is entered to check the code

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

Extreme data

A

A type of test data where valid data which the code accepts is entered but that data will be close to the boundaries of what it accepts to check the code.

17
Q

Invalid data

A

A type of test data which the code doesn’t accept. An invalid data will be entered to check the code

18
Q

Validation

A

Automatic checks that ensure that data is sensible and possible when entering data

19
Q

Verification

A

A check to see the data entered is correct

20
Q

Check digit

A

A form of validation that checks the set of numbers has been entered correctly by using calculations and comparing to the check digit value.

21
Q

Dry run

A

Paper-based run through of an algorithm or program.

22
Q

Trace table

A

A table used to trace the values of variable by carrying out the program. Dry run is done by using a trace table