Class 01 questions:
What does sorted mean?
How do you measure efficiency / the best?
How do you measure how much memory an algorithm requires?
How do you count the instructions an algorithm requires?
How do you define correctness?
Are there any other meaningful types of correctness than exactly, usually correct, and close to it?
How do you know if you have a match - you're done looping?
Is it possible that a looser definition for a match may speed up an algorithm?
Is it possible that a looser definition for a match may speed up an algorithm?
What is a random algorithm?
What is a probabilistic algorithm?
The presumptive aspects to measuring speed are: machine, compiler, programmer, input size, input kind, and power. Are there any other meaningful properties?
How do we abstract machine, compiler, programmer, input size, input kind, and power?
Can we build a system that, with all properties abstracted, we can accurately measure/predict algorithmic space?
Can we infer a system that has certain properties and deduce the required machine/compiler that would permit such an algorithm?
Can we infer a system that has certain properties and deduce the required machine/compiler that would permit such an algorithm?
How do you reduce algorithms that use non-polynomial space?
Comments
Post a Comment