Introduction to Computer Science      COMP 250       Winter 2011
Instructor: Professor Michael Langer
Lectures MWF  4:35-5:25 pm       ENGTR 100
Instructor Availability: MW 5:25 pm (after class) or by appointment

Announcements Final Exam (PDF) Assignment 4 (PDF)   Q1 code   Q2 code   Solutions Assignment 3 (PDF)   (code)   (LibraryExample.java)   (TestSignatures.java) (ExamplesTextfiles.zip) (Solution code)

Resources WebCT myCourses Course Outline (Winter 2011) Java book: "How to think like a computer scientist" my COMP 250 web page from (Winter 2010) COMP 250 web pages from Profs Precup ,  Blanchette Java website  + tutorials + API ( SE 6) Download Eclipse

Teaching Assistants A1,  A3   Mathieu Rousseau [email]   Irene Pylypenko [email]     Anton Dubrau [email]   A2,  A4   Jonathan Cottrell [email]   Faiyaz Zamal [email]   [www]   Juan Camilo Gamboa Higuera [email]

LECTURE SCHEDULE AND NOTES	READINGS, EXERCISES, ASSIGNMENTS, EXAMS
Preliminaries  (Jan. 5-10) introductions (slides) grade school algorithms (addition and multiplication)  (notes)   (slides) binary number representations  (notes)   (slides) memory addressing,   arrays,  insertion sort (notes)   (slides)	Reading:   Java Background (covered in COMP 202) Exercises 1: number representations (PDF)
Linear Data Structures (Jan. 12- 24) singly linked lists  (notes)   (slides)   (code)   doubly linked lists  (notes)   (slides)   (code)   Java: ArrayList vs. LinkedList (notes)   (slides)   stacks (notes)   (slides)   queues (notes)   (slides)	Assignment 1   (PDF)   (code)   (solutions) mean 84/100 Exercises 2: linear data structures (PDF)
Recursion  (Jan. 26 - Feb. 2)  mathematical induction (notes)   (slides) fibonacci, Tower of Hanoi (notes)   (slides) decimal to binary, power, binary search (notes)   (slides) mergesort (notes)   (slides)	Exercises 3: recursion (PDF) Quiz 1 with solutions (mean 8.3/10)
Analysis of Algorithms  (Feb. 4-14 ) big O (notes)   (slides) not big O vs. big Omega (&Omega) (notes)   (slides) recurrences: factorial, Tower of Hanoi, binary search (notes)   (slides)     ... matrix power, Fibonnaci, mergesort, multiplication (notes)   (slides)	Exercises 4: big O (PDF) big O tutorial Exercises 5: recurrences (PDF) Assignment 2   (PDF)   (code) A2 Q1 solutions (mean: 43/50) A2 Q2 solutions (mean: 37/50)
Non-linear Data Structures (Feb. 16- March 25)     trees (notes)   (slides) tree traversal (notes)   (slides)    STUDY BREAK (Feb. 21-25) binary trees, expression trees (notes)   (slides) binary search trees 1 (notes)   (slides) class was cancelled on Friday March 4 binary search trees 2 (notes)   (slides)   (code) Java break: interfaces (notes)   (slides) priority queues, heaps (notes)   (slides) heaps 2 (notes)   (slides) heaps 3 (notes)   (slides) maps (notes)   (slides) hashing (notes)   (slides) [graphs covered after OOD] graphs (notes)   (slides) graph traversal (notes)   (slides) garbage collection, Google's pagerank [NOT ON FINAL EXAM] (slides)	Exercises 6: trees and heaps (PDF) Quiz 2 with solutions (mean 14/20) Exercises 7: hashing (PDF) Exercises 8: graphs (PDF)
Object Oriented Design in Java  (March 25 to April 1 ) inheritance (notes)   (slides) (modified Apr. 1) inheritance (cont.), polymorphism (notes)   (slides)   (Dog code) abstract classes, casting (notes)   (slides) modifiers (notes)   (slides)	Exercises 9: object oriented design (PDF) +   more OOD exercises   (from "Introduction to Java     programming", 4th edition?, by D. Liang, Ch. 10)