Edexcel Computer Science - Unit 1 (Computational Thinking)

Terminology

100

A set of instructions in a logical working order

Algorithm

200

Removing unnecessary details from a problem

Abstraction

300

Breaking down a large problem into smaller parts

Decomposition

400

These are smaller part of code that perform smaller tasks

Subprograms

500

In a bubble, going through all items in a list once is called this

Pass

General Knowledge

100

The three primary error types

Syntax, Runtime, Logical

200

The two types of iteration

for and while

300

max = int(input())
for i in range(max):
        print(i)

Generally, what does i represent?

a variable that changes each time a loop repeats

400

The three basic structures used in programs

Sequence, Selection, Iteration (or Loops)

500

A benefit of using a subprogram

- reusable code

- less typing/simpler code

- fewer bugs

Searching & Sorting

100

The search method when looking at (potentially) all items

Linear

200

The two types of sorting used in this course

Bubble & Merge

300

The search method nicknamed 'Divide & Conquer'

Binary Search

400

The often faster sorting method

Merge sort

500

The worst result in any search method

The item is not found

Calculations

100

17 % 3

2

200

5 ** 2

25

300

17 // 3

5

400

((5 * 7) + 3) / 4

9.5

500

((3**2) * 4 + 7) // 4

10

Flowcharts

100

The names of each terminal

Start/Begin & Stop/End

200

The shape used for input and output

parallelogram

300

The use of these help show a loop is occurring in a flowchart

lines

400

Rhombus (or diamond) shape is used for this

decisions

500

To show how a program works without knowing code well, we can use flowcharts and ______

pseudocode