CSSE230 – Data Structures and Algorithms

All non-Moodle web pages for the course are available from this index page.

This schedule page will begin with the schedule from a previous term, which will be updated as we go. We plan to update assignments and readings at least a week in advance. We’ll update daily schedules and slides just before class.

Preparation is to be completed before the class session.

Unless otherwise noted, all assignments are due at 11:00 PM on the day indicated.

Dr. Anderson's Schedule	Dr. Boutell's Schedule	CSSE Lab Assistants in F217	Soph. Resident Tutor for CSSE230
Google sheet	Google sheet	PDF	Google calendar

Session quick links:  1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31

Week	Session	Preparation	Due	Topics	Resources	Major Programs
1	1 Mon Mar 4 Details	Read the Syllabus Bookmark this schedule page. Email your instructor if you forgot your SVN password Review Weiss Ch. 1–6 this week: many pages, mostly review. Carefully read the new stuff and skim the rest: this document may help guide you). Install software for the course: Java 8, Eclipse (current version - I use Java EE), and Subclipse (Update from Eclipse > Help > Install, URL = http://subclipse.tigris.org/update_1.8.x	Nothing today Always look at the Major Programs column, too, for the programming assignment of the week.	Course introduction Growable Array analysis Week 1: On your own: Skim/read review from the book and get back up-to-speed on programming by doing the WarmUpAndStretching assignment In class: Algorithm analysis	Slides Course materials on the web. An overview of the review material from Weiss chapters 1-7.	Warm Up and Stretching
1	2 Tue Mar 5 Details	Weiss §5.1, 5.2, 5.4–5.8, 7.2 Continue reviewing Weiss Ch. 1–6.	Post to "Introduce Yourself" on Piazza Growable Arrays (at start of class) Make progress on WarmUpAndStretching.	Growable Arrays discussion Review of Asymptotic analysis and formal definition of Big O. Big-oh’s cousins, big-Omega and big-Theta	Slides	Warm Up and Stretching
1	3 Thu Mar 7 Details	Continue reviewing Weiss Ch. 1–6; focus on §5.3	Homework 1 Submit to HW1 drop box in Moodle. This and all other HW and programming assignments are due at 11:00 PM unless we specify otherwise for a particular assignment. Make progress on WarmUpAndStretching.	MCSS Cubic and Quadratic Algorithms	Slides Derivation Derivation (video - can download if it doesn't stream)	Warm Up and Stretching
2	4 Mon Mar 11 Details	Read article Why Math?	Warm Up and Stretching Commit to SVN by 11:00 PM.	MCSS Linear Algorithm	Slides Alphabetical list of terms Pair Programming cheesy but helpful video and official advice Stacks and Queues teams	Stacks and Queues
2	5 Tue Mar 12 Details	Finish review of Weiss Ch. 1–6, focus on ch. 6	UML Diagram of Collections framework (from HW2). Bring your answer to class so you can refer to it.	Abstract data types (ADTs) Review of basic data structures in the Java Collections Framework	Slides	Stacks and Queues
2	6 Thu Mar 14 Details	Ch. 7.3 (review of recursion) Ch. 15-17 (List implementation (review); skim, but may help for assignment)	Homework 2	Trees Intro Implementing a Binary Tree using recursive methods.	Slides	Stacks and Queues
3	7 Mon Mar 18 Details	§18.1-18.3	Stacks and Queues	More recursive binary tree methods. Binary tree traversals	Slides Binary Tree Traversal Visualization (use non-Chrome browser) Doublets teams	Doublets
3	8 Tue Mar 19 Details	Study for Exam 1, take practice exam on Moodle		Exam 1 Tuesday 3/19 7:00 - 9:00 PM Section 1, O157 Section 2, O159 Section 3, O167 Night exam. No class today to compensate.		Doublets
3	9 Thu Mar 21 Details	§18.4	Homework 3 StacksAndQueues partner evaluation (on Moodle)	Iterators: Simple and lazy ones	Slides Local documentation for Weiss code	Doublets
4	10 Mon Mar 25 Details	§19.1	Doublets	Binary Search Tree (BST) methods: insert, remove, contains.	Slides	Binary Search Tree
4	11 Tue Mar 26 Details		Doublets partner eval	Size vs. Height in a binary tree	Slides Video-induction Video-strong induction	Binary Search Tree
4	12 Thu Mar 28 Details	§ 19.4	Homework 4 EditorTrees team preference survey.	Need for trees that are height-balanced but not completely balanced	Slides	Binary Search Tree
5	13 Mon Apr 1 Details	§ 19.4	Binary Search Tree	AVL Trees: How to find the node where rotation is needed Single and double rotations; effect on subtree height. Intro EditorTree and need for rank field Meet team	Slides EditorTrees Teams CodeCollaborate how-to	EditorTrees
5	14 Tue Apr 2 Details	Re-write any tree methods you haven't yet mastered		Student questions on EditorTree Requirements Practice with AVL Tree Rotations Exam 2 in class - programming only	Slides AVL animation AVL animation APPLET (site down?) AVL animation FLASH (site down?)	EditorTrees
5	15 Thu Apr 4 Details	§ 19.2	Quiz 14 Homework 5 You and your team should make as much progress as you can on EditorTrees before the break.	Discuss usage of rank field EditorTrees work time with your team	Slides	EditorTrees
6	16 Mon Apr 15 Details	§ 19.5	EditorTrees Milestone 1 (Spring, 2019) Due Date postponed until Tuesday due to the break.	Red-black trees	Slides Gabe Paree-Huff's RBTree applet Dr. Wollowski's materials	EditorTrees
6	17 Tue Apr 16 Details			EditorTrees workday		EditorTrees
6	18 Thu Apr 18 Details	Chapter 20	Homework 6 EditorTrees Milestone 1 partner feedback on Moodle Midterm course evaluation in Moodle	Hash Table intro	Slides	EditorTrees
7	19 Mon Apr 22 Details	Review chapter 20	EditorTrees Milestone 2 EditorTrees Milestone 2 partner feedback on Moodle	Hash Table implementation	Slides	EditorTrees
7	20 Tue Apr 23 Details	§21.1-21.3		Priority Queues and Binary heaps Heaps work time	Slides Heaps and heapsort assignment Heap animation In-place heapsort animation	EditorTrees
7	21 Thu Apr 25 Details	§21.5	Homework 7	Heapsort Heapsort work time	See previous day	EditorTrees
8	22 Mon Apr 29 Details	§ 14.1, 14.2	EditorTrees Milestone 3	Graphs	Slides	GraphSurfing
8	23 Tue Apr 30 Details	Study for the exam!	EditorTrees team member performance evaluation survey (required; Thursday 11:00 PM)	Exam 3 Tuesday 4/30 7:00 - 9:00 PM Section 1, O157 Section 2, O159 Section 3, O167		GraphSurfing
8	24 Thu May 2 Details		Homework 8	TBA		GraphSurfing
9	25 Mon May 6 Details	§ 7.5	GraphSurfing Milestone 1	Extended Binary Trees Intro to Recurrences	Slides	GraphSurfing
9	26 Tue May 7 Details	§ 7.5.2, 7.5.3 § 8.1 – 8.5 (skip 8.4.1)		Recurrences and Master Theorem Sorting review/overview	Slides	GraphSurfing
9	27 Thu May 9 Details	§ 8.6 – 8.7 (skim Average case analysis of Quicksort)	Homework 9	Quicksort Quicksort average case analysis	Slides	GraphSurfing
10	28 Mon May 13 Details	§ 8.8	GraphSurfing Milestone 2	Quicksort improvements Lower bound for sorting algorithms. Radix sort	Slides Sorting Races teams	SortingRaces
10	29 Tue May 14 Details			TBA Worktime for sorting assignment		SortingRaces
10	30 Thu May 16 Details		SortingRaces	Course evaluations Discussion of Final Exam Practice problems for final exam (no solutions posted, but can ask us)	Slides	SortingRaces
11	31 Mon May 20 Details		Final exam review packet (not collected)	Final Exam Wednesday, May 22 6:00 PM - 10:00 PM Section 1, Olin 157 Section 2, Olin 159 Section 3, Olin 169