Class activities

Information about lectures, labs, assignments, and reading.

Week 1 : January 19–22
Lectures	No class Monday—Martin Luther King, Jr. Day
	Piazza is up
	L1: Introduction and Course Info
	L2: Stacks
	LLStack.jar a linked list based implementation
Recitations	No recits this week
Reading	Prichard ch. 7
Week 2 : January 25–29
Lectures	L3: Queues
Recitations	R1: Stacks and Recursion
Assignments	Introduce P1 (due week 3)
Reading	Prichard ch. 7–8
Week 3 : February 1–5
Lectures	L4: Grammar basics
Recitations	R2: Implementing a Queue using a Linked List
Assignments	P1: due Wednesday 11:59:00ᴘᴍ, late Thursday 11:59:00ᴘᴍ
Reading	Prichard ch. 6.1,6.3; Rosen ch. 5.1,5.3–5.5
Week 4 : February 8–12
Lectures	L5: Recursion and Induction: Quick refresh
	L6: Computational Complexity, Big-O analysis
Recitations	R3: scanning and grammars
Exams	Friday: Quiz #1
Assignments	Introduce HW1 (due week 5)
	Introduce P2 (due week 6)
Reading	Prichard ch. 6,10.1
	Rosen ch. 3.2–3.3,5.1–5.2
Week 5 : February 15–19
Lectures	Finishing Computational Complexity, Big-O analysis
Recitations	R4: induction
Assignments	HW1 due Wednesday 11:59:00ᴘᴍ, late Thursday 11:59:00ᴘᴍ
Week 6 : February 22–26
Lectures	L7: Trees
Recitations	R5: Orders of Magnitude and Complexity
Exams	Friday: Quiz #2
Assignments	P2 due Wednesday 11:59:00ᴘᴍ, late Thursday 11:59:00ᴘᴍ
Reading	Prichard ch. 11, Rosen ch. 11.1–11.3
Week 7 : February 29–March 4
Lectures	Trees continued; BST.jar Binary Search Trees
Recitations	R6: Midterm (week 8) preparation
Assignments	Introduce P3 (due week 10)
Week 8 : March 7–11
Lectures	Review for Midterm
Exams	Wednesday: Midterm!
	Material: up to and including L7: Trees
Lectures	Midterm post-mortem
Week 8½ : Spring Break!
Week 9 : March 21–25
Lectures	Order calculations are tricky!
	Let’s get one thing clear
	L8: Advanced Object Oriented programming concepts
	InheritZoo.jar
	Thing.java
Recitations	R7: Binary Search Trees
Reading	Prichard ch. 9
Week 10 : March 28–April 1
Lectures	L9: Advanced Sorting: Mergesort and Quicksort
	Cool Sorting Demos
	L10: Divide and Conquer Analysis
Recitations	R8: Class hierarchies; dynamic binding
Exams	Friday: Quiz #3
Assignments	P3 due Wednesday 11:59:00ᴘᴍ, late Thursday 11:59:00ᴘᴍ
	(plus a snow day)
Reading	Prichard ch. 10
Week 11 : April 4–8
Lectures	Priority Queues; Heapsort
	L11: Priority Queues; IntegerMinHeap.java
Recitations	R9: Recurrence Relations
Assignments	Introduce P4, Parsing and evaluating equations (due week 13)
	Introduce HW2 (due week 12)
Reading	Rosen ch. 8.1,8.3
Week 12 : April 11–15
Lectures	L12: Graphs Part 1
Recitations	Making P3 great again
Exams	Friday: Quiz #4
Assignments	HW2 due Wednesday 11:59:00ᴘᴍ, late Thursday 11:59:00ᴘᴍ
Reading	Prichard ch. 12
Week 13 : April 18–22
Lectures	Review HW2
	L13: Graphs Part 2
Recitations	R11: adjacency list representation of graphs
Assignments	P4 due Wednesday 11:59:00ᴘᴍ, late Thursday 11:59:00ᴘᴍ
	Introduce HW3 (due week 14)
	Introduce P5 (due week 15)
Reading	Prichard ch. 14
Week 14 : April 25–29
Lectures	L14: Hash Tables
Recitations	R12: dependence graphs and topological sort
Exams	Friday: Quiz #5
Assignments	HW3 due Wednesday 11:59:00ᴘᴍ, late Thursday 11:59:00ᴘᴍ
Week 15 : May 2–6
Lectures	L15: Fun and Games with graphs; Wrap Up
	Friday: ASCSU evaluations
	Review P5
Recitations	R13: hash tables
Assignments	P5 due Wednesday 11:59:00ᴘᴍ, late Thursday 11:59:00ᴘᴍ
Week 16 : Final Exam
Exams	Tuesday May 10 4:10–6:10ᴘᴍ
	Material: everything after the midterm