Algorithms Flashcards

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

What is computational thinking

A

formulating a problem and expressing its solution in a way that a computer can carry out

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

What is abstraction

A

Finding key parts of the problem and removing the parts which aren’t important so it is easy to solve

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

Decomposition

A

breaking down a complex problem into small manageable parts.

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

What is a structure diagram

A

Structure of a program and its subsections

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

What is a trace table?

A

Shows how variables change throughout a program

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

What is a syntax error

A

an error which doesn’t obey the rules of the programming language

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

What is a logic error

A

When the program doesn’t do what the user intended

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

What are the searching methods

A

Binary
Linear

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

How does binary search work

A

Takes the list, splits it in half and chooses the side which the number isn’t on and deletes it. Continue. ONLY WORKS FOR ORDERED LISTS

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

How does linear search work.

A

Searches through every value on the list to find the one it is looking for.

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

What are the sorts?

A

Bubble
Merge
Insert

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

How does bubble sort work?

A

Tracks through the list. If the number is bigger than the number to the right, it swaps. Continues till the entire list is examined.

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

How does merge sort work

A

The list is broken down into subsets with individual values. Then, the list is merged together but in order.

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