Useful Websites
A list of useful websites as provided by the chief examiner who basically wrote the spec.
- link
- link
- link
- arsdigita university
- link
- link
- link
- link
- link
- link
- 2005 version of RAPTOR
- link
- link
- link
- link
- computational models, complexity
- excellent on nanocomputers
- Centre for quantum computing has video lectures and tutorials
- how to teach many important topics in computer science without using a computer at all
- full of wonderful animations covering most of the course
- a whole course that maps onto new spec in a useful way
- Jeannette wing on computational thinking
- exponen-tial effort
- exponen-tial effort,computational effort increases as fast or faster than exponentially with problem size, then it is said to require exponential effort. Polynomial time, by contrast,— Edmonds used the term good— prevails if computational effort is bounded by a power d of problem size n. The notation O( n d ) is used to indicate that level of complexity. Regardless of technological progress, computers are helpless when faced with exponential effort. This has spawned a new area of research that has grown and flourished for four decades and is still going strong. It is not by accident that a graph-theoretical optimization problem, namely, the Traveling Salesman Problem, is now frequently used as a complexity standard, calling a problem NP-complete if it requires computational effort equivalent to that of the Traveling Salesman Problem.
Introduction to Computing and Programming in Python A Multimedia Approach by Mark Guzdial 0-13-117655-2