Q/ 02. What is the great thing about Project based learning? Q/03. Why do we care about algorithmic efficiency, on new machines we have unlimited space and speeds are 'light speed' relative to the way it was in 1963, so what is the big deal? Q/04. How is input related to algorithmic efficiency? Q/ 05. What does a graph tell you really, as a tool? Q/ 06. What does 'n' stand for int the Analyzing Algorithms? Q/ 07. What is the difference between Quadratic run-time and Liner run-time? Q/ 08. I think of rating an algorithm as 'scoring' now that is an old term but, if you don't have the luxury to run an algorithm, you need to have something, explain to me what I mean by scoring Q/09. Why does the speed of the computer have absolutely nothing to do with the algorithmic efficiency? Q/ 10. What types of time complexity are there in Computer Science? Q/ 11. How is Big O notation like Pi? Q/ 12. Why is it that a and b get dropped out of the function T-an+b