Algorithms

Question 1

Algorithm

Answer 1

A finite sequence of step-by-step instructions carried out to solve a problem

Question 2

Flow Chart

Answer 2

The shape of each box tells you about its function:

Oval -Start/Finish

Rectangle - Instruction

Diamond - Decision

Question 3

How would you order unordered lists?

Answer 3

Using bubble sort or quick sort

Question 4

Advantage of First Fit bin packing?

Answer 4

Quick to implement

Question 5

Disadvantage of first fit bin packing?

Answer 5

Not likely to lead to an optimal solution

Question 6

Advantage of first-fit decreasing bin packing?

Answer 6

• Usually a good solution

- Easy to implement

Question 7

Disadvantage of first-fit decreasing bin packing?

Answer 7

May not get an optimal solution

Question 8

Advantage of full-bin bin packing?

Answer 8

Usually a good solution

Question 9

Disadvantage of full-bin bin packing?

Answer 9

Difficult to implement, especially when numbers are awkward and plentiful

Question 10

If an algorithm has order f(n), then increasing the size of the problem from n to m will increase run time of the algorithm by a factor of?

Answer 10

Approximately f(m)/f(n)

Question 11

Number of comparisons in a pass of bubble sort?

Answer 11

N-1