Algorithms

Question 1

What are the components of an algorithm?

Answer 1

• finite number of steps
• unambigious steps
• deterministic

Question 2

What is complexity ?

Answer 2

• Size in relation to run time (efficiency )
• measure of which one is faster

Question 3

Perform a quick sort algorithm to sort it into ascending order. Write number of passes and comparisons aswell

Answer 3

values less than or equal to go to the left of pivot
Write pass1, pass2 ect…

Question 4

what is
* first fit
* first fit decreasing
* full bin

Answer 4

• FF: putting the numbers using given order in question
• FFD: ordering the list into descending order - biggest first
• FB: using brain for optimal solution

Question 5

what does heuristic mean?

Answer 5

• a method that finds the solution efficently, but with no gurante that this solution is optimal
• important when classical methods fail, only way to find is exhauting all solutions

Question 6

how can the efficency of different packing methods be tested?

Answer 6

counting the number of comparisions needed in worst case

Question 7

what is the complexit of the first fit and first fit decreasing algorithm , in the worst case?

Answer 7

o (n sqaured)

Question 8

what is the complexity of the quick sort algorithm , in the worst case?

Answer 8

O (n squared)

Question 9

What is big O notation?

Answer 9

Question 10

Answer 10

Question 11

Use quick sort to sort the following numbers in descending order

Answer 11

Question 12

Answer 12

Question 13

how would you determine algorithmic complexity?

Answer 13

use the worst case scenario

Question 14

Answer 14

Question 15

Answer 15

Question 16

Answer 16

Question 17

Answer 17

Question 18

Answer 18

Question 19

Answer 19