2.1 computational thinking Flashcards

(10 cards)

1
Q

what is abstraction?

A

removing unnecessary details and focus on the important details, simplifying the task

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

what is decomposition?

A

when you break down a problem into smaller tasks so it’s easier to solve

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

what is algorithmic thinking?

A

using logical steps to solve a problem

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

what are the different sorts?

A

insertion merge bubble

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

what are the different searches?

A

linear binary

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

what is linear search?

A

sequential search
each data item is searched in order from first value to last

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

what is binary search?

A

list of data must be sorted
middle point of data is selected with each iteration and compared to the value being searched for. when the midpoint matches the target value, search can stop

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

what is merge sort?

A

divides list in half, again and again, until each data item is separate
then the items are combined in the same way as they were divided, but now in correct order

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

what is bubble sort?

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

what insertion sort?

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