Computer Science Paper 1

Algorithm
An algorithm is a sequence of steps that can be followed to complete a task.
1 of 30
Decomposition
Decomposition means breaking a problem into a number of sub-problems, so that each sub- problem accomplishes an identifiable task,
2 of 30
Abstraction
Abstraction is the process of removing unnecessary detail from a problem.
3 of 30
Linear Search
Goes through each number until it's found.
4 of 30
Binary Search
: Search a sorted array by repeatedly dividing the search interval in half.
5 of 30
Binary vs Linear
Binary has to be sorted in order for it to work, Linear doesn't. Linear goes through each number so it may be slower, Binary is faster because it halves in half continuously.
6 of 30
Merge Sort
A sort algorithm that splits the items to be sorted into two groups, recursively sorts each group, and merges them into a final, sorted sequence.
7 of 30
Bubble Sort
Bubble sort, sometimes referred to as sinking sort, is a simple sorting algorithm that repeatedly steps through the list to be sorted, compares each pair of adjacent items and swaps them if they are in the wrong order.
8 of 30
Bubble vs Merge
Bubble Takes Longer, Merge sort is quick and easy.
9 of 30
Integer
Example = 23
10 of 30
Real
23.5
11 of 30
Character
%
12 of 30
String
Hello
13 of 30
Boolean
TRUE OR FALSE
14 of 30
Definite Iteration
Loop that takes a limited amount of time/turns
15 of 30
Indefinite Iteration
Infinite loop until it hits a number
16 of 30
Nested Iteration
Iteration in each other
17 of 30
Nested Selection
Selection in each other.
18 of 30
Integer Division, including remainders
Remainder: the remainder when 11 is divided by 2 (11 MOD 2) = 1
19 of 30
Subroutine
a subroutine is a named ‘out of line’ block of code that may be executed (called) by simply writing its name in a program statement.
20 of 30
Subroutine Advantages
Readability. Decomposes a task into simpler problems so you can test one block at a time.
21 of 30
Typical DataTest
this is normal data the system should be working with.
22 of 30
Extreme Data Test
this is data at the boundary between typical data and erroneous data.
23 of 30
Erroneous Data Test
this is data that should cause the system to tell the user that there is a problem with data entered into the system.
24 of 30
Low-Level Language
Machine code - 1010101010
25 of 30
High-level
Programs that people can actually understand lol translated into machine code for computer
26 of 30
Compiler
It's a computer program(s) that transforms source code written in a programming language into machine language that is the target language which usually has a binary form known as object code.
27 of 30
Interpreter
It translates high level instructions into an intermediate form, it translates the code into the intermediate form line by line an caries out specific actions.
28 of 30
Assembler
It is a program that takes basic computer instruction(s) and converts then into a pattern of bits that the computer's processor can use to perform it's basic operations. The language used to program the assembler is called assembly languag
29 of 30
Base 2, Base 10, Base 16
Base 2 uses 1 and 0 only, Base 10 uses 0-9 (denary) and Base 16 is hexadecimal 0-F (16)
30 of 30

Other cards in this set

Card 2

Front

Decomposition means breaking a problem into a number of sub-problems, so that each sub- problem accomplishes an identifiable task,

Back

Decomposition

Card 3

Front

Abstraction is the process of removing unnecessary detail from a problem.

Back

Preview of the back of card 3

Card 4

Front

Goes through each number until it's found.

Back

Preview of the back of card 4

Card 5

Front

: Search a sorted array by repeatedly dividing the search interval in half.

Back

Preview of the back of card 5
View more cards

Comments

No comments have yet been made

Similar Computing resources:

See all Computing resources »See all Representing data resources »