Back to marketplace

1.3

No description yet. This curated deck is ready for daily study.

Total cards: 24•Content version: v4•Public deck•Updated: 8/1/2026

Card preview (24)

#1
Front (Question)

Algorithm

Back (Answer)

A set of instructions designed to solve a problem

#2
Front (Question)

Identifier

Back (Answer)

A name given to an element of a program so it can be referred to throughout

#3
Front (Question)

Good Programming Practice

Back (Answer)

• Meaningful names, clear what variable is holding • Annotation, easier for programmers to follow • Program Layout, see each function and aids readability

#4
Front (Question)

Variable

Back (Answer)

An attribute within a program whose value can be reassigned (during execution)

#5
Front (Question)

Constant

Back (Answer)

An attribute within a program which never changes its value (during execution)

#6
Front (Question)

Global Variable

Back (Answer)

• Declared at the top of the program • Available to the whole program

#7
Front (Question)

Local Variable

Back (Answer)

• Declared inside a subroutine • Available only to that subroutine

#8
Front (Question)

Sequence

Back (Answer)

Steps processed once

#9
Front (Question)

Selection

Back (Answer)

• Uses a logical condition to determine which line of code to process next • Purpose: to execute code if a certain condition is met

#10
Front (Question)

Nesting

Back (Answer)

When another selection statement is contained within an existing selection statement

#11
Front (Question)

Repetition

Back (Answer)

Purpose: to repeatedly execute code until a certain condition is met

#12
Front (Question)

Count

Back (Answer)

A value in a loop that will increase/decrease each time the loop is executed

#13
Front (Question)

Rogue Value

Back (Answer)

a value which tells the computer that input has finished

#14
Front (Question)

DIV

Back (Answer)

// How many times one number goes into another

#15
Front (Question)

MOD

Back (Answer)

% Remainder after DIV

#16
Front (Question)

Lossy Compression

Back (Answer)

• Cannot be decompressed to yield back the original data • Not Good method for critical data such as text • Good for digitally sampled analogue data e.g. Sound/Video/Graphics • Algorithms vary but many use threshold truncation

#17
Front (Question)

Lossless Compression

Back (Answer)

• Original message can be decompressed back to it’s original form • Good for text • Good for high quality media e.g. .FLAC .PNG

#18
Front (Question)

Character Combinations (Compression)

Back (Answer)

Finding frequently occurring character combinations and replace them with tokens

#19
Front (Question)

Run Length Encoding

Back (Answer)

Replace long strings with a number

#20
Front (Question)

Photo Compression

Back (Answer)

Approximate all shades of blue in a photograph to one shade and only store this colour instead of every pixel

#21
Front (Question)

Sub Sections

Back (Answer)

• Algorithms and programs can be broken down into smaller parts. • These are named, reusable pieces of code that can be called any number of times within an algorithm to perform a specific task.

#22
Front (Question)

Sub Sections Advantages

Back (Answer)

• Can be developed by teams, easier to write. • Code is more readable • Avoids duplication of code. • Sections can be tested individually.

#23
Front (Question)

Standard Module and Function

Back (Answer)

STANDARD FUNCTION Carries out a common task for a standard situation in a program and is provided by the compiler/interpreter STANDARD MODULE Contains a group of related standard functions EG: Module = math Function = math.cos(x)

#24
Front (Question)

Standard Module Advantages

Back (Answer)

• Pre-written / No need to write again (Saves Development Time) • High Quality as written by experts • Already Tested/Used – Less Errors