Paper 2 Key Bits Flashcards

1
Q

What is Decomposition?

A

Breaking 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
2
Q

What is Abstraction?

A

Picking out important bits of info from problem, ignoring specific details that dont matter

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

What is Algorithmic Thinking?

A

Logical way of getting from problem to solution

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

What is a algorithm?

A

Set of instructions for solving a problem

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

What type of box is a start/stop?

A

Box with rounded corners

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

What type of box is a Input/Output?

A

Parallelogram Box

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

What type of box is a Processes?

A

Rectangle Box

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

What type of box is a Decision?

A

Diamond box

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

How does a binary search work?

A
  1. Find the middle item
  2. If the item you are looking for is smaller than middle item, get rid of first half of list, and vis versa
  3. Continue steps 1 and 2 until found
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
10
Q

What does a binary search work on?

A

A ordered list

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

How does a linear search work?

A
  1. Checks each element one by one
  2. If element is not the one it needs, it will move onto the next one
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
12
Q

How does a bubble sort work?

A
  1. Compares elements next to each other
  2. Puts the highest value ontop
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
13
Q

How does a merge sort work?

A
  1. Splits list in half
  2. Repeat step 1 until all lists contain 1 item
  3. Merge the pairs in the right order
  4. Repeat step 3 until all sub-lists together
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
14
Q

What is a Insertion Sort?

A
  1. Look at 2nd item in list
  2. Compares all items before it and inserts it into correct place
  3. Step 2 repeated until it in correct place
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
15
Q

What are the pros and cons of a linear search?

A

Pro: Simple
Con: Takes time

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

What are the pros and cons of a bubble sort?

A

Pro: Efficient for data in order
Con: Not efficient for large list

17
Q

What are the pros and cons of a merge sort?

A

Pro: Can do large lists
Con: Slower for small lists