Chapter 1

Question 1

What is an algorithm?

Answer 1

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

Question 2

What shape shows start/end ina flow chart?

Answer 2

And oval

Question 3

What shape shows an instruction ina flow chart?

Answer 3

Rectangle

Question 4

What shape shows a decision in a flow chart?

Answer 4

Diamond

Question 5

Name two types of sort

Answer 5

Bubble Sort

Quick sort

Question 6

Describe a bubble Sort

Answer 6

Start at the beginning if the lost and compare adjacent items
If they are in order leave them
If they are not in order swap them
When you get to the end of the lost the final item will be in the right place
Repeat the steps until a pass is completed without swaps

Question 7

Describe a Quick Sort

Answer 7

The midpoint of the list is the first pivot
Put all the items less than the II it on the left sid and all the ones more on the right side of the pivot
Repeat again with each sub list
When all the items have been pivots stop

Question 8

What are the three bin packing algorithms?

Answer 8

First fit
First fit decreasing
Full bin

Question 9

Describe the first fit algorithm

Answer 9

Take the items in the order given

Place each item in the first available bin

Question 10

Describe the first fit decreasing algorithm

Answer 10

Sort the items into descending order

Apply the first fit algorithm

Question 11

Describe the full bin packing algorithm

Answer 11

Use observation to find combinations that will fill a bin and a k these first
Any remaining ones are lacked using first fit

Question 12

If an algorithm has order f(n) what factor will the run time increase by?

Answer 12

f(m)/f(n)