Comp & Prgm with Python - Ch 12

Question 1

Opitimization

Answer 1

Requires two parts
Optimization function & constraints.
Opt function = compute desired outcome
Constraints = conditional limits, can be empty

Question 2

Greedy Algo

Answer 2

Selects the first element that meets criteria, repeat

Often a practical approach

Provides an approximate answer, not an optimal

Question 3

0/1 Knapsack problem

Answer 3

Theoretically always O(n*n^2) with brute force algo

Because it requires computing a power set and that is always n*n^2

Question 4

Optimize a slow process

Answer 4

Include checks that stop computation once results are outside of criteria

Question 5

Vectors

Answer 5

Dynamic arrays from c++

Characteristics
Low memory usage
Random access to elements

Question 6

Graphs

Answer 6

Consists of nodes(vertices) and edges(arcs)

If edges are unidirectional it is a directed graph or digraph

If edges are weighted it is a weighted graph

Question 7

On choosing a subclass or super class

Answer 7

Substituting an instance of a subclass into the super class should result in zero errors