Topic 1 - Fundamentals Of Algorithms Flashcards

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

What is decomposition?

A

The process of breaking down problems into smaller more manageable sub-problems.

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

What is abstraction?

A

The process of removing unnecessary informational focusing on key details.

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

What is an algorithm?

A

A step-by-step solution to a problem

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

What does the Terminator do in a flow chart?

A

Start and End programs

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

What does the Parallelogram do in a flow chart?

A

Inputs
Outputs

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

What does the Rectangle do in a flow chart?

A

Processes

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

What does the Diamond do in a flow chart?

A

Decision - True or False

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

What is pseudocode?

A

A simplified language that describes a sequence

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

How does a linear search work?

A

It checks each item in a list of data until it finds the right item

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

How does a binary search work?

A

It works out the midpoint of the list and then determines higher or lower. Repeats this until the right item is found.

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

What are the advantages of linear search?

A

It works with unordered lists

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

What are the disadvantages of linear search?

A

Ineffective

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

What are the advantages of binary search?

A

Effective

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

What are the disadvantages of binary search?

A

Only works for ordered lists

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

How does a bubble sort work?

A

It compares adjacent items and switched them if needed, does a pass multiple times until list is sorted

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

How does a merge sort work?

A

Combines pairs of sorted lists until the list is sorted

17
Q

What are the disadvantages of bubble sort?

A

Ineffective

18
Q

What are the advantages of merge sort?

A

Effective