CSC148H :: Lectures and Reading :: Summer 2013

• Classes and objects: video lectures
• The official PEP-8 Style Guide
• A more readable style presentation (slides 1-11)
• A docstrings refresher with type contracts
• "Why your code sucks" :)

• Classes and objects: video lectures
• The official PEP-8 Style Guide
• A more readable style presentation (slides 1-11)
• A docstrings refresher with type contracts
• "Why your code sucks" :)

• W02L02.pdf - Intro, Objects and Classes, Stacks and Queues
• stack.py

• Intro to Exceptions
• Exceptions (Software Carpentry)
• Unit testing (Software Carpentry)
• Slideshow on Python style
• More exception explanation (not required)

Some optional stack practice:

• Given a fully-parenthesized in-fix arithmetic expression like in expr_eval.py, return a fully-parenthesized post-fix arithmetic expression. For example:

  infix_to_postfix("((2 * 3) / (6 - 2))")

  should return

  "((2 3 *) (6 2 -) /)"

• Some practice problems (Short answer: 6; Multiple choice: 1, 2, 3, 5, 6, 7, 8, 9, 10, 11, 13, 15, 16)

• W03L03.pdf
• stack.py (with EmptyStackException)
• a_or_c.py
• expr_eval.py (homework)

• Unit testing (Software Carpentry)
• Exercise: implement a recursive adder function that works in-place (without creating any new lists or using slice notation) Hint: the list you pass along will not be smaller, so you'll have to come up with another way to reduce the problem size.

• W4L4.pdf
• adder.py - recursive
• adder-verbose.py - recursive with printouts

• W05L05.pdf
• adder.py
• stack1.py
• stack2.py
• compare_stacks.py
• queue.py containing Queue1 and Queue2
• compare_queues.py