Topics Covered in 6.00, Fall 2008MIT OpenCourseWare http://ocw.mit.edu6.00 Introduction to Computer Science and ProgrammingFall 2008 For information about citing these materials or our Terms of Use, visit: http://ocw.mit.edu/terms.Topics Covered in 6.00, Fall 2008 or, Things To Know For The Final: • Algorithms o Big O notation o Exhaustive enumeration o Guess and check o Successive approximation o Divide and conquer algorithms o Binary search o Merge sort o Greedy algorithms o Optimization problems Knapsack problems o Depth first search and backtracking o Dynamic programming o Decision trees o Orders of growth Exponential Polynomial Linear Log o Amortized analysis • Linguistic issues o Values, types, expressions variables o Builtin types: int, float, string, list, dictionary o Mutability and aliasing o Control flow and iteration o Functions and methods o Input/output o Recursion and call stacks o Exceptions o Polymorphism o Modules o Classes and objects o Pylab • Simulation o Random walks o Monte Carlo methodso When you should believe the answer • Understanding data o Building computational models o Uniform, normal, and exponential distributions o Linear regressions o Evaluating fits Over fitting o Statistical sins Texas sharpshooter Data enhancement Non-representative sample cum hoc ergo propter hoc o Plotting • Software engineering o Debugging and testing o Data abstraction and inheritance o Program organization Specifications • Anything needed to successfully complete problem
View Full Document
Unlocking...