Algorithms Flashcards

You may prefer our related Brainscape-certified flashcards:
1
Q

Key techniques for Computational Thinking

Name the three techniques

A

1) Decomposition
2) Abstraction
3) Algorithmic thinking

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

Decomposition

Define this term

A

Breaking down a complex problem 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

Define this term

A

Picking out the important data from the problem, ignoring the data that doesn’t matter.

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

Algorithmic Thinking

Define this term

A

A logical way of getting from the problem to the solution.

EXTRA:
If the steps you take to solve a problem follow an algorithm then they can be reused and adapted to solve similar problems in the future

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

Algorithm

Define this term

A

A well-defined set of instructions for completing a specific task.

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

Psuedo-code

A

1) Not an actual programming language but follows a similar structure and should read like one (roughly).
2) The idea is that it should clearly show an algorithm’s steps without worriying about the finer details and syntax
3) It is quick to write and easy to convert to a programming language
4) There are different ways to write it but it is correct so long as the person reading it understands how it works

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

Flow Charts

A

Flow charts can represent algorithms and just like psuedo-code, there are different ways to write the same algorithm. They are represented using shapes.

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

Start / Stop

Name the shape and function of this block

A

Start / Stop is shown by boxes with rounded corners.
These represent the beggining and end of the algorithm.

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

Input / Output

Name the shape and function of this block

A

Inputs and Outputs are shown by parallelograms.
These represent anything that’s put into or taken out of the algorithm.

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

Processes

Name the shape and function of this block

A

Processes are shown by rectangles.
These represent general instructions, processes and calculations.

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

Decisions

Name the shape and function of this block

A

Decisions are shown by diamonds.
These represent decisions, often with a ‘yes’ or ‘no’ answer.

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

Subroutine

Name the shape and function of this block

A

Subroutines are shown by rectangles that look like briefcases.
These represent references to other flowcharts, the flowchart’s function().

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

Arrows

Name the function of this shape

A

**Arrows connect blocks and show the direction you should follow. **Some blocks might have multiple arrows coming in or going out of them.

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

Search Algorithms

Name the 2 main search algorithms

A

1) Binary Search
2) Linear Search

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

Binary search

Describe this search

A

A Binary Search looks for items in an Ordered List

Binary search works by looking for the middle of the list, checking if it is the item it is looking for, if not check if the item is in the side next to it and delete the group with no item in it.

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