CSCA48H: Lectures and Reading

The required reading for the course will be posted here. We will also post useful (or fun) but non-required reading; that will be clearly marked.

We often use the board to teach. We will usually not post summaries of this; please make a friend in class in case you happen to miss a lecture.

Section	1st lecture	2nd lecture
LEC 01	Mon 1-2 (SW 319)	Thurs 10-12 (SW 309)
LEC 02	Mon 12-1 (HW 216)	Wed 12-2 (SY 110)

Week	M-F	Reading/Notes	Slides	LEC 01 code	LEC 02 code
1	9-13 Jan	classes and objects: video lectures why your code sucks :-)	Monday: admin (part 1) ADTs (part 1) Wednesday/Thursday: admin (part 2) ADTs (part 2) Call Stack (on board in class)	Monday: none Thursday: stack1.py (Stack class) stackdemo.py (Call Stack demo) stackvardemo.py (Call Stack demo with variables)	Monday: none Wednesday: stack2.py (Stack class) stackdemo.py (Call Stack demo) stackvardemo.py (Call Stack demo with variables)
2	16-20 Jan	Intro to Exceptions slideshow on Python style New: Exceptions video (Software Carpentry) More exception explanation (not required)	Monday: Classes (review -- we didn't do these in class) Wednesday/Thursday: Stacks & Exceptions	Thursday: eval1.py (expression evaluation) stack.py (updated Stack class) bad_stack.py (bad Stack implementation) compare_stacks.py (time trials of two Stack implementations) exception_demo.py test_stack.py (unittest for Stack)	Wednesday eval2.py (expression evaluation) stack.py (updated Stack class) bad_stack.py (bad Stack implementation) compare_stacks.py (time trials of two Stack implementations) exception_demo.py test_stack.py (unittest for Stack)
3	23-27 Jan	Type "import this" in the Python shell Python classes, in case you want more reading Another explanation of classes, including an overview of object-oriented terminology What do you think about when testing? Unit testing	Monday: Testing (.ppt) Testing (.pdf) Wednesday/Thursday: Announcements (.pdf)	Monday: test_clock.py (unittest for ClockTime class) clocktime.py (ClockTime class) Thursday: test_clock.py (improved from Mon) clocktime.py (improved from Mon) test_clock.py (further improved) clocktime.py (further improved) exceptions-user.py (exceptions demo) exceptions-implementer.py (exceptions demo) rec_intro.py (recursion intro) factorial.py (recursion example) fibonacci.py (recursion example)	Monday: test_clock.py (unittest for ClockTime class) clocktime.py (ClockTime class) Wednesday: test_clock.py (improved from Mon) clocktime.py (improved from Mon) test_clock.py (further improved) clocktime.py (further improved) exceptions-user.py (exceptions demo) exceptions-implementer.py (exceptions demo) rec_intro.py (recursion intro) factorial.py (recursion example) fibonacci.py (recursion example)
4	30 Jan - 3 Feb	Recursion: Thinking Python: How to Think Like a Computer Scientist	Monday: Announcements (.pdf)	Monday: faster_fib.py minimum.py Wednesday/Thursday: minimum1.py minimum2.py compare_min.py extract_multiples.py
5	6-10 Feb	Binary Search Trees: animation discussion more discussion; skip the code (it's in C#), just read the text.	Monday: Announcements (.pdf) Wednesday/Thursday: Trees (.ppt) Trees (.pdf)	Monday: course_example.py Wednesday/Thursday: node.py
6	13-17 Feb	If you haven't yet, please do the reading from week 5. In addition, here are some slides on trees and recursion, and also an introduction to inheritance. 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 this week): inheritance_exceptions_handout.pdf.	Wednesday/Thursday: Inheritance (.ppt) Inheritance (.pdf)	Wednesday/Thursday: student.py (inheritance example) bst.py (BST class with recursive and iterative insert method, write contains as an exercise)
X	20-24 Feb	Reading Week: no classes
7	27 Feb - 2 Mar	Welcome back! We're going to finish up tree operations, and in particular tree deletion. This week and next, we're going to talk about heaps; here is another set of slides on heaps, including heapsort (although in the heapsort implementation these slides put the first item in the heap at index 1 and not at index 0; we're going to use index 0).	Wednesday/Thursday: Heaps (.ppt) Heaps (.pdf)	Monday: bst.py (BST class with recursive contains, insert, delete methods; write get_min as an exercise) Wednesday/Thursday: heapsort.py
8	5-9 Mar		Wednesday/Thursday: PQ Runtime	Monday (PQs implemented 4 ways): test_pq.py pq_heap.py pq_list.py pq_sorted_list.py pq_bst.py pq_comparison.py Wednesday/Thursday (sorting algorithms compared): sorts.py sort_comparison.py (only Wed)
9	12-16 Mar	In all of these, concentrate on these sorting algorithms: bubble, selection, insertion, heap, merge, quick Sorting Algorithms (read the intro, take a look at the sorting comparison, and read the summaries of the algorithms we're covering in this course) Animations Python implementations	Wednesday/Thursday: Sorting Runtime	Monday: mergesort.py sort_comparison.py Wednesday/Thursday: quicksort.py
10	19-23 Mar	linked list reading (from How to Think Like a Computer Scientist) and some linked lists slides that you can use as a reference.		Wednesday/Thursday: queue.py profile_queues.py
11	26-30 Mar			Monday: linkedlist.py Wednesday/Thursday: linkedlist2.py (with additional methods) linkedlist_dummy.py (with dummy head) flatten.py (convert binary tree to doubly linked list)
12	2-6 Apr		Wednesday/Thursday: Summary (.pptx) Summary (.pdf) Inheritance Review (.pptx) Inheritance Review (.pdf)	Monday: polynomial.py (class & linked list example) Wednesday/Thursday: linkedlist.py mergesort1.py mergesort2.py profile_mergesort.py