CSSE230 – Data Structures and Algorithms

All non-ANGEL 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’ll try 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 8:00 AM on the day indicated. We recommend that you complete them before midnight the day before, but some students believe that their best work times are after midnight.

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
0	1 Thu Aug 30 Details	Read the Syllabus Review Weiss Ch. 1–6 before Day 4 (this document may help guide your reading). Email your instructor if you forgot your SVN password (different from your normal Rose-hulman network password) Bookmark this schedule page in your browser. Install software for the course: Java 6, Eclipse with Java configuration, and Subclipse	Nothing today, but things due almost every other day this week! In addition to this column, you should always look at the Major Programs column.	Course introduction Growable Array analysis Main activities for Week 1: On your own: Skim/read some review material from the textbook and get back up-to-speed on programming by doing the WarmUpAndStretching assignment In class: Foundations of algorithm analysis	Slides Course materials on the web. Claude's schedule An overview of the review material from Weiss chapters 1-7. Who graded what?	Warm Up and Stretching
1	2 Mon Sep 3 Details	Review the Syllabus, bring questions to class Weiss §5.1, 5.2, 5.4–5.8, 7.2 Continue review of Weiss Ch. 1–6 (due before session 4).	Post to "Introduce Yourself" discussion forum on ANGEL; what you write can be as short or long as you wish. Complete Diagnostic Quiz 1 on ANGEL (Lessons → Diagnostic Quizzes) by Tuesday (Friday in Fall term), 8:00 AM (no late days may be used) Complete Diagnostic Quiz 2 and Quiz 3 on ANGEL by Wednesday (Monday in Fall term)), 8:00 AM (no late days) (suggestion only) Make prograess on WarmUpAndStretching.	Growable Arrays recap Big-oh review Big-oh’s cousins, big-Omega and big-Theta	Slides	Warm Up and Stretching
1	3 Tue Sep 4 Details	Continue review of Weiss Ch. 1–6 (due before session 4) Know the definitions in the Key Concepts at the ends of Ch. 1–3 ( include Chapter 4 by Monday)	Written Assignment 1 All course assignments are due at 8:AM unless otherwise specified. Submit to drop box in Moodle. Most weeks, written assignments will be due on Tuesday at 8 AM.	Limits and asymptotic behavior Abstract data types (ADTs) Review of basic data structures	Slides	Warm Up and Stretching Due Thursday at 8:00 AM.
1	4 Thu Sep 6 Details	Finish review of Weiss Ch. 1–6	Warm Up and Stretching Submit to SVN by 8:00 AM.	Diagnostic Quiz Review Items Review Comparable, function objects, Comparator.	Slides Pascal teams and repositories	Pascal Christmas Tree
2	5 Mon Sep 10 Details	Weiss §5.3 §7.1 Software progress beats Moore's Law.	Hardy/Colorize partner preference survey (on ANGEL)	Maximum Contiguous Subsequence Sum (MCSS) problem MCSS cubic and quadratic algorithms Work time	Slides Pair Programming info	Pascal Christmas Tree
2	6 Tue Sep 11 Details	Read article Why Math? Read article Math Reasoning in Software Engineering Education	Written Assignment 2 at 8:00 AM	MCSS linear(!) algorithm	Slides Hardy/Colorize teams Spring, 2012	Pascal Christmas Tree
2	7 Thu Sep 13 Details	§7.1-7.3, 7.5.1	Pascal Christmas Tree	Recursion overview Recursive Binary Search Recursion exercise: Tree problem on WA3	Slides Alphabetical list of terms	Hardy Part 2 and Colorize
3	8 Mon Sep 17 Details	Ch. 15-17 (should be mostly review) §18.1-18.3	Pascal partner evaluation (On ANGEL) due Wednesday at noon.	Java Collections Framework Trees intro	Slides Java Collections Framework Tutorial	Hardy Part 2 and Colorize
3	9 Tue Sep 18 Details	Install Weiss packages on your system so they will be available for you to use	Written Assignment 3 at 8:00 AM	More binary tree Binary tree traversals Questions about Exam 1	Slides Binary Tree Traversal Visualization	Hardy Part 2 and Colorize
3	10 Thu Sep 20 Details	§18.4	Hardy Part 2 Colorize Both due at 8 AM.	More tree methods (contains, duplicate, equals) Binary tree iterators Size vs. Height in a binary tree	Slides Adding a null node to simplify the code	Displayable Binary Tree
4	11 Mon Sep 24 Details	§ 19.1 - 19.2	Hardy/Colorize partner evaluation due Wednesday at noon (on Angel)	BST intro, contains, insert, delete Finding kth element of a BST Threaded binary trees Work time	Slides	Displayable Binary Tree
4	12 Tue Sep 25 Details	Prepare for Exam 1	Doublets partner preference survey on ANGEL Written Assignment 4 Due FRIDAY at 5:00 PM. (Note that your instructor will be out of town on Friday, so ask questions on Thursday if you have them).	No Thursday class due to Wednesday night exam Exam 1 Wednesday <7:00 - 9:00 PM> Section 1 - O267, Section 2 - O269		Displayable Binary Tree
4	13 Thu Sep 27 Details	19.3	Displayable Binary Tree A "grace day" until Tuesday at 8 AM. This is a "free late day". No additional late days may be used after this time.	Induction example: Fibonacci Completely-balanced trees: nice idea, but ... Height-balanced trees, maximum height Discuss a few exam questions Doublets preview Meet Doublets partner(s)	Slides Doublets teams	Doublets
5	14 Mon Oct 1 Details	§19.4	EditorTrees team preference survey (due Wednesday at noon).	AVL Trees: How to find the node where roation is needed Single and double rotations; effect on subtree height. Practice with AVL Tree Rotations Threaded/Doublets work time.	Slides A nice AVL animation	Doublets
5	15 Tue Oct 2 Details		Written Assignment 5 Doublets Milestone 1 (Due Friday at 8 AM)	Threaded tree recap Doublets Project work time	Slides	Doublets
5	16 Thu Oct 4 Details	§12.1 §7.7	Doublets final submission	EditorTrees intro and teams Exhaustive search, non-attacking queens problem. Non-attacking queens problem	Slides EditorTrees Teams	EditorTrees
6	17 Mon Oct 8 Details	§14.3–14.5 §20.1-20.3	Doublets partner evaluation (Wednesday noon)	Student questions on EditorTree Requirements Graphs and their representations Hash Table inplementation	Slides EditorTrees Teams	EditorTrees
6	18 Tue Oct 9 Details	Chapter 21	Written Assignment 6	Priority Queues and Heaps Heap Sort	Slides	EditorTrees
7	19 Tue Oct 16 Details	§ 7.5, 7.5.1	Editor Trees Milestone 1 due at 8 AM	Extended Binary trees, tries DAGs	Slides	EditorTrees
7	20 Thu Oct 18 Details		Scrabble team preferences survey (by Wednesday at 5 PM)	Intro to recurrence relations	Slides	EditorTrees
7	21 Mon Oct 22 Details	§ 7.5.2, 7.5.3	Written Assignment 7	EditorTrees work time	No slides today	EditorTrees
8	22 Tue Oct 23 Details	§21.1-21.3, 21.5	EditorTrees Milestone 2 (final code submission)	Scrabble design	Scrabble teams 201230	Scrabble
8	23 Thu Oct 25 Details	§7.5 Scrabble specification	Scrabble Milestone 1 (Wednesday 8:00 am) EditorTrees performance Evaluation Survey, Wednesday at noon.	Scrabble Design/Implementation		Scrabble
8	24 Mon Oct 29 Details	§8.1-8.5	Written Assignment 8	Master Theroem recap Sorting review Quicksort, including average-case analysis	Slides	Scrabble
9	25 Tue Oct 30 Details	§8.6-8.8		Quicksort improvements Lower bound for sorting algorithms. Radix sort Scrabble work time	Slides Weiss code for various sorts	Scrabble
9	26 Thu Nov 1 Details	Study for the exam! No morning class today due to evening exam		Exam 2 7:00-9:00 PM Section 1 - O267, Section 2 - O269 Covers material through session 24, WA8, EditorTrees No regular class meeting Tuesday morning		Scrabble
9	27 Mon Nov 5 Details		Written Assignment 9 Scrabble Milestone 2 (human player, saving/loading files) Due Friday 8 AM.	Exam redux Scrabble work time	Scrabble Milestone 2 grading template	Scrabble
10	28 Tue Nov 6 Details	Review §19.3		More average case calculations Skip lists Ethics and computer programming	Slides	Scrabble
10	29 Thu Nov 8 Details		Scrabble Milestone 3 (complete, working, documented code) due Wednesday at 8 AM.	Scrabble work time	No slides	Scrabble
10	30 Mon Nov 12 Details		Scrabble Teammate Performance Evaluations on ANGEL by noon Thursday (milestone 5) Written Assignment 10. You are not required to write this up and turn it in, but it should be good practice for the final exam.	Scrabble presentations (Milestone 4) Course evaluations Discussion of Final Exam	Slides	Scrabble
11	31 Tue Nov 13 Details		Written Assignment 10 (not collected)	Final Exam During Exam Week (Tuesday morning)