Algorithms

Question 1

algorithm

Answer 1

finite sequence of operations for carrying out a procedure or solving a problem

Question 2

what must an algorithm be?

Answer 2

• unambiguous
• deterministics
• finite

Question 3

how can algorithms be communicated?

Answer 3

flowchart or pseudocode

Question 4

pass

Answer 4

worked through the instructions once

Question 5

efficiency

Answer 5

using fewer operations

Question 6

pseudocode

Answer 6

concise instructions that structure a computer code

Question 7

slack variables

Answer 7

non negative statements equivalent to inequalities in standard form

Question 8

size

Answer 8

measure of complexity, likely to be the number of the elements in the list

Question 9

complexity

Answer 9

efficiency in relation to the size of the problem

Question 10

which is more efficient nested or expanded form?

Answer 10

nested method, lower complexity O(n)

Question 11

first fit algorithm

Answer 11

first bin that has enough space for it

Question 12

first fit decreasing algorithm

Answer 12

order from largest to smallest and apply the first-fit method to it

Question 13

full bin strategy

Answer 13

makes all the bins as full as possible, logical and no algorithm

Question 14

heuristic

Answer 14

efficient solution, but not always optimal

Question 15

how do you carry out quick sort algorithm

Answer 15

1) first value in the list is the pivot, write down values in same order which are smaller and larger than pivot
2) repeat on each sublist