CSC148H: Lectures and Reading

• why your code sucks :-)
• classes and objects: video lectures

• slideshow on Python style
• An example of Inheritance (part of a free online book)
• Intro to Exceptions
• More exception explanation, in case you want it

• The final expression evaluation code: expr_eval.py
• The Stack classes (both good and bad) in a module: stack.py
• Timing the Stack class: time_stack.py
• Importing between modules, and __name__: m1.py and m2.py
• Raising an exception: ex1.py

• import this
• Goodger, again (the style slideshow listed above)

• Update to circular imports: m1.py and m2.py
• Testing.pdf
• stack.py
• test_stack.py

• Recursion: Thinking Python: How to Think Like a Computer Scientist
• Exceptions: Building Skills in Python, Ch. 17

• funcs.py
• nest.py

Some of you have asked for more recursion notes and practice. Get through as many of these as you need to until you feel comfortable with recursion.

• Recursion Discussion on a DBoard
• Algorithm Design & Recursion: chapter from John Zelle's Python Programming: An Introduction to Computer Science.
  Do Multiple Choice questions 3, 4, 5, 8
  Do all the Programming Exercises you can get through! If you're stuck on one, skip it and move on to the next. You should at least be able to do 1, 3, and 4, and 2 will give you good practice on writing a class.
• Alan Gauld's recursion walkthrough
• Recursion & Exceptions -- there are exercises at the bottom (from How to Think Like a Computer Scientist)
• Recursion tutorial by Seth David Schoen.

Here are some BST resources:

• animation
• discussion
• more discussion; skip the code (it's in C#), just read the text.

• Binary tree notes [pdf]
• tree.py, starter code for a binary search tree implementation.

• trees.pdf: a review of what we've covered so far, plus code for delete/remove. Make sure you understand the code!
• More recursion reading: recursion.pdf.
• More exception reading (we'll go over inheritance soon): inheritance_exceptions_handout.pdf.

• tree.py, a continuation of the tree discusison.
• Note: over the past week and a half, quite a bit of work has been done on the chalkboard.

• Heaps
• Heap slides, by Steve Engels (in the implementation this puts the first item in the heap at index 1 and not at index 0, to make parent and child calculations nicer)

• heapsort.py

• Monday: we wrote code for flatten.
• Wednesday: we developed mergesort from scratch and discussed the running time. Visit the sorting lab to see a possible implementation

• Exam preparation.
• quicksort from lecture.