Paper 2: 2.1 Computational Thinking Flashcards

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

Computational thinking/ algorithmic

A

The thought processes involved in formulating problems so their solutions can be represented as computational steps and algorithms

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

Decomposition

A

Breaking 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 parts of information from the problem and ignoring the specific details

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

What is start/stop flowchart diagram symbol

A

Oval

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

What is input/output flowchart diagram symbol

A

Parallelogram

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

What is processes flowchart diagram symbol

A

Rectangle

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

What is a decision flowchart diagram symbol

A

Diamond

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

Trace tables help to

A

Identify errors in a code

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

When does linear search work

A

Any time

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

When does binary search work

A

Ordered list

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

Describe Binary search

A
  1. Go to middle, if it is that then stop
  2. Go to the middle between the upper and lower if it is upper or lower
  3. Repeat until number is found
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
11
Q

Describe linear search

A

Start at spot 1 and go through the list checking

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

Positive of binary search

A

Better with large data sets

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

How does bubble sort work

A

Look at first 2 items in a list and swap them if needed
Do this for the whole list

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

Pros and cons of bubble sort

A

Pros Cons
Doesn’t use much memory Bad with large sets
Efficient for checking Inefficient for sorting
Simple Algorithm

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

How does merge sort work

A

Split the list into individual parts
Merge sub lists until you get big list

16
Q

Pros and cons of merge sort

A

Pros Cons
More efficient Slower for small lists
Consistent running time More memory

17
Q

Insertion sort

A

1st item is put in ordered list
Insert the remianing items in relation to each other

18
Q

Pros and cons of insertion sort

A

Pros Cons
Easily coded Large lists
Small lists
Quick
Easy on memory

19
Q

3 programming constructs

A

Sequence
Selection
Iteration