Unit 7 - Algorithms and algorithmic Thinking Flashcards

1
Q

What is Abstraction?

A

Removing unimportant parts of a problem in order to concentrate on those that are important

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

What is Decomposition?

A

Breaking down a problem into smaller more manageable ones

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

What is Algorithmic thinking?

A

An approach to solving problems by the use of algorithms (sequences of steps that lead to a solution)

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

What is a Structure diagram?

A

A hierarchical diagram that shows how a problem is broken down into sub-sections/sub-tasks.

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

What is Binary Search and how does it work?

A

This only works on a sorted list.
The middle item of the list is first checked.
If the item searched for is less than this item the right of the list is discarded, and a binary search is carried out on the left of the list.

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

What is Linear Search and how does it work?

A

Each item in the list is checked against the search item in order.

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

What is Bubble sort and how does it work?

A

Start with the leftmost item.
Compare this item with the one next to it.
If the one next to it is less, swap the items.
Repeat for all the other items.
At the end of one pass through the list, the largest item is at the end of the list.
Repeat the process until the items are sorted.

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

What is Insertion sort and how does it work?

A

This algorithm sorts one data item at a time
One item is taken from the list, and placed in the correct position.
This is repeated until there are no more unsorted items in the list,

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

What is Merge sort and how does it worK?

A

Divide the unsorted list in two.
Continue to divide these lists into two until there is just one item in each list.
Now merge each list back until there is only one
list remaining – which will be the fully sorted list.

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

Order 3 sort methods from least to highest efficiency.

A

Bubble sort, Insertion sort, Merge sort.

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

What does a Rhombus signify in a flowchart?

A

Decision

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

What does a Rectangle signify in a flowchart?

A

Process - Maths operations and assignment of variables

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

What does a Diamond signify in a flowchart?

A

Decision - Change flow based on a decision

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

What does a Rounded Rectangle signify in a flowchart?

A

Terminal - Start and Stop

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

What does a Rectangle with embedded lines signify in a flowchart?

A

Sub program - Similar to a function

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

What is a Trace table?

A

Trace tables are used to determine the outputs from a program as it runs. They enable a programmer to find errors in their programs.