http://www.vorlesungen.uzh.ch/HS10/suche/e-50500109.details.html
- Buy a book about C++
- Install a C++ compiler
- Run the "Hello World" example
- Implement a fraction data type
- ...
- Separate compilation
- Implement an RPN (Reverse Polish Notation Calculator)
- Implement a simple spell checker
- Implement a program that shows a function that cannot be inlined
- Implement the persistent vector data type and extend the RPN calculator such that it uses the persistent vector for the stack of the numbers.
- Convert the RPN calculator to make use of templates, so that it can be used with any number data type (e.g., the Fraction data type). Add the operation 'm' that computes the minimum of the top two numbers.
- Adapt the persistent pvector to make use of a persister trait. Implement a pset that implements a persistent set (based on std::set).
- Extend your dictionary program such that it allows the user to correct unknown words or insert them into the dictionary. Make use of your pset implementation form 1.
- Change your RPN calculator such that the minimum function computes the minimum of all the numbers stored on the stack. Make use of std::for_each.
- Implement a program that demonstrates the use of combineops_t.
- Implement a simple program that demonstates in what order constructors and destructors being executed when an object is constructed or destructed respectively.
- Rectangle as base of Square or vice versa?
- Implement a function that merges the elements of two containers.
- Elevator Controller (long description)
- Connect Four (4 Gewinnt)