2.1 Algorithms Flashcards

1
Q

Computational Thinking

A

steps taken to find a solution to a complex problem. It involves Decomposition, Abstraction and Algorithmic Thinking.

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

Decomposition:

A

Decomposition is breaking down a complex problem down into smaller problems and solving each one individually.

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

Abstraction:

A

picking out the important bits of information from the problem and ignoring the specific details that don’t matter.

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

Algorithmic Thinking:

A

logical
way of getting from a problem to a solution. If the steps you take follow an algorithm, this can be used again in the future.

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

Pseudocode:

A

not an actual programming language, it shows the steps of the algorithm without the need to follow syntax. It can easily be followed by a coder.

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

Flowcharts:

A

Algorithms can be shown using a flowchart. Flowcharts use different shaped boxes for different commands.

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

Search algorithm:

A

Computers follow a search algorithm to find items in a list e.g. searching a shopping website, searching for appointments at a doctor’s surgery.

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

Binary search:

A

Binary Search looks for items in an ordered list. The list can contain letters, numbers or alphanumeric characters

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

Linear search:

A

can be used on an
unordered list. This type of search checks each item in turn and stops when it finds the item or reaches the end of the list. Starts at start

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

Sorting algorithm:

A

follow a sorting algorithm to sort items in a list
e.g. sorting a list of names in Excel, shopping website – sorting a list from lowest to highest price.

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

Bubble sort:

A

Compares pairs of items. Very simple but can take a long time to sort large lists

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

Merge sort:

A

splits the list apart then merges if back together. This is a much more efficient than the bubble sort for large lists but is slower for smaller lists.

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

Insertion sort:

A

orders the items as it goes. The Insertion Sort is a simple algorithm and works very well with small lists. It is not very efficient for larger lists.

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

Advantages of high level compared to low level:

A

High level languages are easier to read and understand as similar to normal English so quicker to read, write and understand

Also the same high level code can be run with different processors, low level languages would be specific to one processor

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

Algorithm:

A

Sequence of instructions that perform a specific task when followed

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

A program is a

A

Implementation of an algorithm

17
Q

Data type:

A

What operations can be conducted on the data and how it will be stored

18
Q

Why use constants?

A

Readability - clear, ability to update, compiler optimisation - reduce memory space