OCR GCSE Computer Science - Paper 2

studied byStudied by 4 people
5.0(1)
get a hint
hint
<p>Breaking a problem down into smaller sub-problems. Once each sub-problem is small and simple enough it can be tackled individually.</p>

Breaking a problem down into smaller sub-problems. Once each sub-problem is small and simple enough it can be tackled individually.

1 / 29

Tags & Description

This is a flashcard set for OCR GCSE Computer Science - Paper 2, but it does not include programming-related flashcards except definitions.

Studying Progress

0%
New cards
30
Still learning
0
Almost done
0
Mastered
0
30 Terms
1
<p>Breaking a problem down into smaller sub-problems. Once each sub-problem is small and simple enough it can be tackled individually.</p>
New cards
<p>Breaking a problem down into smaller sub-problems. Once each sub-problem is small and simple enough it can be tackled individually.</p>

Breaking a problem down into smaller sub-problems. Once each sub-problem is small and simple enough it can be tackled individually.

Decomposition is...

New cards
2
<p>Removing or hiding unnecessary details from a problem so that the important details can be focused on or more easily understood.</p>
New cards
<p>Removing or hiding unnecessary details from a problem so that the important details can be focused on or more easily understood.</p>

Removing or hiding unnecessary details from a problem so that the important details can be focused on or more easily understood.

Abstraction is...

New cards
3
<p>Looking for similarities among and within problems.</p>
New cards
<p>Looking for similarities among and within problems.</p>

Looking for similarities among and within problems.

Pattern recognition is...

New cards
4
<p>Deciding on the order that instructions are carried out and identifying decisions that need to be made by the computer.</p>
New cards
<p>Deciding on the order that instructions are carried out and identifying decisions that need to be made by the computer.</p>

Deciding on the order that instructions are carried out and identifying decisions that need to be made by the computer.

Algorithmic thinking is...

New cards
5
<p>A graphical method of decomposing a problem, with each layer breaking down the layer above it into smaller and smaller sub-problems.</p>
New cards
<p>A graphical method of decomposing a problem, with each layer breaking down the layer above it into smaller and smaller sub-problems.</p>

A graphical method of decomposing a problem, with each layer breaking down the layer above it into smaller and smaller sub-problems.

A structure diagram is...

New cards
6
<p>A graphical representation of an algorithm and uses symbols to denote each step, with arrows showing how to move between each step.</p>
New cards
<p>A graphical representation of an algorithm and uses symbols to denote each step, with arrows showing how to move between each step.</p>

A graphical representation of an algorithm and uses symbols to denote each step, with arrows showing how to move between each step.

A flowchart is...

New cards
7
<p>A textual representation of an algorithm. It is very closely related to high-level languages, although it does not require the same precise syntax. It also enables programmers to communicate algorithms to other programmers without worrying about which language they know.</p>
New cards
<p>A textual representation of an algorithm. It is very closely related to high-level languages, although it does not require the same precise syntax. It also enables programmers to communicate algorithms to other programmers without worrying about which language they know.</p>

A textual representation of an algorithm. It is very closely related to high-level languages, although it does not require the same precise syntax. It also enables programmers to communicate algorithms to other programmers without worrying about which language they know.

Pseudocode is...

New cards
8
<p>A tool that can be used to follow each line of an algorithm through, step by step. A trace table will show the contents of each variable after each line has been carried out and will also show any output.</p>
New cards
<p>A tool that can be used to follow each line of an algorithm through, step by step. A trace table will show the contents of each variable after each line has been carried out and will also show any output.</p>

A tool that can be used to follow each line of an algorithm through, step by step. A trace table will show the contents of each variable after each line has been carried out and will also show any output.

A trace table is...

New cards
9
<p>Compares each item one by one until the target is found. There is no need for the list to be in order.</p>
New cards
<p>Compares each item one by one until the target is found. There is no need for the list to be in order.</p>

Compares each item one by one until the target is found. There is no need for the list to be in order.

A linear search...

New cards
10
<p>Compares the middle item to the target then discards half of the list which the target can&apos;t be in. It then finds the next middle item, and repeats until the target is found.</p>
New cards
<p>Compares the middle item to the target then discards half of the list which the target can&apos;t be in. It then finds the next middle item, and repeats until the target is found.</p>

Compares the middle item to the target then discards half of the list which the target can't be in. It then finds the next middle item, and repeats until the target is found.

A binary search...

New cards
11
<p>Goes through each pair, swapping if needed, in one pass. I then repeats the passes until a pass happens with no swaps.</p>
New cards
<p>Goes through each pair, swapping if needed, in one pass. I then repeats the passes until a pass happens with no swaps.</p>

Goes through each pair, swapping if needed, in one pass. I then repeats the passes until a pass happens with no swaps.

A bubble sort...

New cards
12
<p>Divides the list continuously by two until each list has 1 item. It then combines two lists at a time, which keeps the items in order.</p>
New cards
<p>Divides the list continuously by two until each list has 1 item. It then combines two lists at a time, which keeps the items in order.</p>

Divides the list continuously by two until each list has 1 item. It then combines two lists at a time, which keeps the items in order.

A merge sort...

New cards
13
<p>Starts with 1 item in the &apos;sorted part&apos; and moves items one by one from the &apos;unsorted part&apos; to the &apos;sorted part&apos;.</p>
New cards
<p>Starts with 1 item in the &apos;sorted part&apos; and moves items one by one from the &apos;unsorted part&apos; to the &apos;sorted part&apos;.</p>

Starts with 1 item in the 'sorted part' and moves items one by one from the 'unsorted part' to the 'sorted part'.

An insertion sort...

New cards
14
<p>Used to temporarily store information to be referenced and used by programs.</p>
New cards
<p>Used to temporarily store information to be referenced and used by programs.</p>

Used to temporarily store information to be referenced and used by programs.

A variable is...

New cards
15
<p>Typically just contains items of the same data type and is of a fixed length. Assume that indexing starts at 0 unless told otherwise.</p>
New cards
<p>Typically just contains items of the same data type and is of a fixed length. Assume that indexing starts at 0 unless told otherwise.</p>

Typically just contains items of the same data type and is of a fixed length. Assume that indexing starts at 0 unless told otherwise.

An array...

New cards
16
<p>The testing of modules throughout development. Any issues found will be fixed and then the module should be retested.</p>
New cards
<p>The testing of modules throughout development. Any issues found will be fixed and then the module should be retested.</p>

The testing of modules throughout development. Any issues found will be fixed and then the module should be retested.

Iterative testing is...

New cards
17
New cards

The testing of the whole program at the end of the development.

Terminal testing is...

New cards
18
<p>Code doesn&apos;t follow the rules of the programming language.</p>
New cards
<p>Code doesn&apos;t follow the rules of the programming language.</p>

Code doesn't follow the rules of the programming language.

A syntax error occurs when...

New cards
19
New cards

Code does not do as you intend.

A logic error occurs when...

New cards
20
<p>Enforcing a rule around user input.</p>
New cards
<p>Enforcing a rule around user input.</p>

Enforcing a rule around user input.

A validation check is...

New cards
21
<p>Checking the identity of a user e.g using password checkers.</p>
New cards
<p>Checking the identity of a user e.g using password checkers.</p>

Checking the identity of a user e.g using password checkers.

Authentication is...

New cards
22
<p>Negation - Inverts the input and outputs it e.g TRUE = FALSE.</p>
New cards
<p>Negation - Inverts the input and outputs it e.g TRUE = FALSE.</p>

Negation - Inverts the input and outputs it e.g TRUE = FALSE.

NOT gate:

New cards
23
<p>Conjunction - Both inputs need to be true for a true output e.g TRUE &amp; TRUE = TRUE, TRUE &amp; FALSE = FALSE.</p>
New cards
<p>Conjunction - Both inputs need to be true for a true output e.g TRUE &amp; TRUE = TRUE, TRUE &amp; FALSE = FALSE.</p>

Conjunction - Both inputs need to be true for a true output e.g TRUE & TRUE = TRUE, TRUE & FALSE = FALSE.

AND gate:

New cards
24
<p>Disjunction - One input out of two needs to be true for a true output e.g TRUE &amp; TRUE = TRUE, TRUE &amp; FALSE = TRUE.</p>
New cards
<p>Disjunction - One input out of two needs to be true for a true output e.g TRUE &amp; TRUE = TRUE, TRUE &amp; FALSE = TRUE.</p>

Disjunction - One input out of two needs to be true for a true output e.g TRUE & TRUE = TRUE, TRUE & FALSE = TRUE.

OR gate:

New cards
25
<p>Are like written English, more readable, portable (can run on many CPUs), but are slower to execute.</p>
New cards
<p>Are like written English, more readable, portable (can run on many CPUs), but are slower to execute.</p>

Are like written English, more readable, portable (can run on many CPUs), but are slower to execute.

High-level languages...

New cards
26
<p>The two types of low-level languages are assembly and machine code. They are also easier to optimise but are specific to particular CPUs.</p>
New cards
<p>The two types of low-level languages are assembly and machine code. They are also easier to optimise but are specific to particular CPUs.</p>

The two types of low-level languages are assembly and machine code. They are also easier to optimise but are specific to particular CPUs.

Low-level languages are...

New cards
27
<p>Convert one programming language to another. Only machine code doesn&apos;t need to be translated to run.</p>
New cards
<p>Convert one programming language to another. Only machine code doesn&apos;t need to be translated to run.</p>

Convert one programming language to another. Only machine code doesn't need to be translated to run.

Translators are programs which...

New cards
28
<p>Produce an executable file and no source code is needed after this. They are fast to execute but errors are only shown right at the end.</p>
New cards
<p>Produce an executable file and no source code is needed after this. They are fast to execute but errors are only shown right at the end.</p>

Produce an executable file and no source code is needed after this. They are fast to execute but errors are only shown right at the end.

Compilers...

New cards
29
<p>Translate an instruction, then execute it. Errors are discovered straight away as code is ran line-by-line, checking for errors on each line but the source code is needed to run and it is slower to execute.</p>
New cards
<p>Translate an instruction, then execute it. Errors are discovered straight away as code is ran line-by-line, checking for errors on each line but the source code is needed to run and it is slower to execute.</p>

Translate an instruction, then execute it. Errors are discovered straight away as code is ran line-by-line, checking for errors on each line but the source code is needed to run and it is slower to execute.

Interpreters...

New cards
30
<p>Providing an editor, providing error diagnostic tools, having a run-time environment and using a translator so it is able to run.</p>
New cards
<p>Providing an editor, providing error diagnostic tools, having a run-time environment and using a translator so it is able to run.</p>

Providing an editor, providing error diagnostic tools, having a run-time environment and using a translator so it is able to run.

IDEs support programming by...

New cards

Explore top notes

note Note
studied byStudied by 2 people
Updated ... ago
5.0 Stars(1)
note Note
studied byStudied by 17 people
Updated ... ago
5.0 Stars(1)
note Note
studied byStudied by 96 people
Updated ... ago
5.0 Stars(4)
note Note
studied byStudied by 38 people
Updated ... ago
4.5 Stars(2)
note Note
studied byStudied by 21 people
Updated ... ago
5.0 Stars(1)
note Note
studied byStudied by 46 people
Updated ... ago
5.0 Stars(1)
note Note
studied byStudied by 3 people
Updated ... ago
5.0 Stars(1)
note Note
studied byStudied by 8805 people
Updated ... ago
4.7 Stars(54)

Explore top flashcards

flashcards Flashcard111 terms
studied byStudied by 36 people
Updated ... ago
5.0 Stars(2)
flashcards Flashcard104 terms
studied byStudied by 2 people
Updated ... ago
5.0 Stars(1)
flashcards Flashcard49 terms
studied byStudied by 12 people
Updated ... ago
5.0 Stars(1)
flashcards Flashcard37 terms
studied byStudied by 2 people
Updated ... ago
5.0 Stars(2)
flashcards Flashcard43 terms
studied byStudied by 53 people
Updated ... ago
5.0 Stars(3)
flashcards Flashcard85 terms
studied byStudied by 5 people
Updated ... ago
5.0 Stars(1)
flashcards Flashcard35 terms
studied byStudied by 8 people
Updated ... ago
5.0 Stars(1)
flashcards Flashcard54 terms
studied byStudied by 277 people
Updated ... ago
5.0 Stars(7)