CSSE230 – Data Structures and Algorithms

Winter 2020-21 (aka 202120)

Schedule Overview

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.

Schedule last updated Fri Jan 29.

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 Nov 30

Details
  • Read the Syllabus
  • Bookmark this schedule page.
  • 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
    • Optional: Eclipse (current version)
    • Optional: Intellij IDEA
  • 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
Warm Up and Stretching
1

2

Wed Dec 2

Details
  • Weiss § 5.1, 5.2, 5.4-5.8, 7.2
  • Continue reviewing Weiss Ch. 1-6
  • Post to "Introduce Yourself" on CampusWire (you should get an invite via email on day 1; if it comes late, I'll be flexible with the deadline).
  • Growable Arrays (at start of class)
  • Make progress on WarmUpAndStretching.
  • Growable Arrays discussion
  • Review of Asymptotic analysis and formal definition of Big O.
  • Big-O’s cousins, big-Omega and big-Theta
 Warm Up and Stretching
1

3

Thu Dec 3

Details
  • Continue reviewing Weiss Ch. 1-6; focus on § 5.3
  • Homework 1 (11:00 pm) 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
 Warm Up and Stretching
2

4

Mon Dec 7

Details
  • MCSS Linear Algorithm
 Warm Up and Stretching
2

5

Wed Dec 9

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
 Stacks and Queues
2

6

Thu Dec 10

Details
  • Ch. 7.3 (review of recursion)
  • Ch. 15-17 (List implementation (review); skim, but may help for assignment)
  • Trees Intro
  • Implementing a Binary Tree using recursive methods.
 Stacks and Queues
3

7

Mon Dec 14

Details
  • § 18.1 - 18.3
  • More recursive binary tree methods.
  • Binary tree traversals
 Stacks and Queues
3

8

Wed Dec 16

Details
  • § 18.4
  • StacksAndQueues partner evaluation (on Moodle)
  • Iterators: Simple and lazy ones
 Doublets
3

9

Thu Dec 17

Details
  • Study for Exam 1, take practice exam on Moodle
  • Exam 1 in class
   Doublets
4

10

Mon Dec 21

Details
  • § 19.1
  • Binary Search Tree (BST) methods: insert, remove, contains.
 Doublets
4

11

Wed Jan 6

Details 		 
  • Doublets partner eval
  • Size vs. Height in a binary tree
 Binary Search Tree
4

12

Thu Jan 7

Details
  • § 19.4
  • Need for trees that are height-balanced but not completely balanced
 Binary Search Tree
5

13

Mon Jan 11

Details
  • § 19.4
  • 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
 Binary Search Tree
5

14

Wed Jan 13

Details
  • § 19.4
  • Student questions on EditorTree Requirements
  • Discuss usage of rank field
  • EditorTrees work time with your partner
 EditorTrees
5

15

Thu Jan 14

Details
  • Re-write any tree methods you haven't yet mastered
  
  • Exam 2 in class - programming only
  • Practice with AVL Tree Rotations
 EditorTrees
6

16

Mon Jan 18

Details
  • § 19.5
  • Red-black trees (optional)
 EditorTrees
6

17

Wed Jan 20

Details 		   
  • EditorTrees workday
 EditorTrees
6

18

Thu Jan 21

Details
  • Chapter 20
  • Hash Table intro
 EditorTrees
7

19

Mon Jan 25

Details
  • Review chapter 20
  • Hash Table analysis
 EditorTrees
7

20

Wed Jan 27

Details
  • § 21.1-21.3
  
  • Priority Queues and Binary heaps
  • Heaps work time
 EditorTrees
7

21

Thu Jan 28

Details
  • § 21.5
  • Heapsort
  • Heapsort work time
 EditorTrees
8

22

Mon Feb 1

Details
  • § 14.1-14.2
  • Graphs
 EditorTrees
8

23

Wed Feb 3

Details
  • Study for the exam!
       GraphSurfing
8

24

Thu Feb 4

Details 		 
  • EditorTrees Reflection
   GraphSurfing
9

25

Mon Feb 8

Details
  • § 7.5
  • Exam 3
  GraphSurfing
9

26

Wed Feb 10

Details
  • § 7.5.2, 7.5.3
  • § 8.1 - 8.5 (skip 8.4.1)
  
  • Recurrences and Master Theorem
  • Sorting review/overview
 GraphSurfing
9

27

Thu Feb 11

Details
  • § 8.6 - 8.7 (skim Average case analysis of Quicksort)
  • Quicksort
  • Quicksort average case analysis
 GraphSurfing
10

28

Mon Feb 15

Details
  • § 8.8
  • Quicksort improvements
  • Lower bound for sorting algorithms.
  • Radix sort
 SortingRaces
10

29

Wed Feb 17

Details 		   
  • TBA
  • Worktime for sorting assignment
   SortingRaces
10

30

Thu Feb 18

Details 		 
  • CSSE230 Big Picture
  • Course evaluations
 SortingRaces
11

31

Mon Feb 22

Details 		 
  • Practice final exam
  • Final Exam
    TBA