Class activities

Information about lectures, labs, assignments, and reading.

Week 1 : Aug. 23
Lectures	L1: Introduction and Course Info
	L2: Stacks; LLStack.jar a linked list based implementation
Reading	Prichard Ch. 7
Recitations	No recits this week
Week 2 : Aug. 30
Lectures	PA1 introduction; L3: Queues
	piazza is up; see Resources page
Recitations	R1: Stacks and Recursion
Reading	Prichard Ch. 7 and 8
Week 3 : Sep. 6
Lectures	L4: Grammar basics
Recitations	R2: Implementing a Queue using a Linked List
	Monday (Labor day) recitation people: go to other recitations or show your work to your TA next week
Assignments	P1: due Sep. 8 23:59; late Sep. 10 23:59
Reading	Prichard Ch. 6.1 & 6.3
Week 4 : Sep 13
Lectures	L5: Recursion and Induction: Quick refresh
	L6: Computational Complexity; Big-O analysis
Recitations	R3: scanning and grammars
Assignments	HW1: Grammars and expressions ( due Sep. 17 in class; late Sep. 22 in class)
	P2: Converting infix to postfix expressions and evaluating these (due week 6)
Reading	Prichard Ch. 6 and 10.1
	Rosen Ch. 3.2-3.3
Week 5 : Sep 20
Lectures	Finishing Computational Complexity; Big-O analysis
Recitations	R4: induction
Reading	Prichard Ch. 6 and 10.1
	Rosen Ch. 3.2-3.3
Week 6 : Sep 27
Lectures	L7: trees
	Parsing infix expressions; InfixSum.jar parsing expressions and building expression trees
Reading	Prichard Ch. 11; Rosen Ch. 11.1; 11.2; 11.3
Assignments	P3: Parsing infix Boolean expressions; building and evaluating expression trees (due week 9)
Recitations	R5: Orders of Magnitude and Complexity
Week 7 : Oct 4
Lectures	Trees continued; BST.jar Binary Search Trees
Reading	Prichard Ch. 11; Rosen Ch. 11.1; 11.2; 11.3
Recitations	R6: Mid Term ( Thursday week 8 ) Preparation
Week 8 : Mid Term Exam
Exams	Thursday Oct 15
	Material: up to and including L6: Computational Complexity; Big-O analysis
Week 9 : Oct 18
Lectures	L8: Advanced Object Oriented programming concepts; InheritZoo.jar; Thing.java
Recitations	R7: Binary Search Trees
Assignments	P3: Parsing infix Boolean expressions; building and evaluating expression trees; ***due week 10***
Reading	Prichard chapter 9
Week 10 : Oct 25
Lectures	L9: Advanced Sorting: Mergesort and Quicksort; Cool Sorting Demos
	L10: Divide and Conquer Analysis
Recitations	R8: Class hierarchies
Assignments	P3: Parsing infix Boolean expressions; building and evaluating expression trees due
Reading	Prichard chapter 10
Week 11 : Nov 1
Lectures	Priority Queues; Heapsort
	L11: Priority Queues; IntegerMinHeap.java
Recitations	R9: Recurrence Relations
	In recitation please do the GTA/UTA on-line surveys: GTAs; UTA
Assignments	P4: Parsing and evaluating equations due week 12
	HW2: Divide and Conquer Analysis ( due Nov. 5 in class; late Nov. 10 in class)
Reading	Rosen Ch. 8.1;8.3
Week 12 : Nov 8
Lectures	L12: Graphs Part 1
Recitations	R10: In place heap sort;
Assignments	P4: Parsing and evaluating equations due week 12 ***due on Thursday; late week 13 Tuesday***
Reading	Prichard chapter 12
Week 13 : Nov 15
Lectures	L13: Graphs Part 2
Recitations	R11: adjacency list representation of graphs
Assignments	P5: Analyzing Equations due week 16
	HW3: Graphs ( due Dec. 1 in class; late Dec. 3 in class)
Reading	Prichard chapter 14
Week 14 : Nov 22 FALL BREAK
Week 15 : Nov 29
Lectures	L14: Hash Tables
Recitations	R12: dependence graphs and topological sort
Assignments	HW3: Graphs ( due Dec. 1 in class; late Dec. 3 in class)
Reading	Prichard chapter 14
Week 16 : Dec 6
Lectures	L15: Fun and Games with graphs; Wrap Up
Recitations	R13: hash tables
Assignments	P5: Analysing Equations due
Week 17 : Final Exam
Exams	Section 1 Dec 17 6:20-8:20 pm; Section 2 Dec 15 6:20-8:20 pm
	Material: from L6 Complexity up to and including L14 Hash Tables