CS367 Spring 2017, LECTURE 1, 2, & 3

This page will not updated during semester,
login to Canvas Learning Management System for current details.

Instructor: Deb Deppeler Lecture 002 Meetings Lecture 001 Meetings
  • Days: Tuesdays and Thursdays
  • Time: 11:00 AM - 12:15 PM
  • Room: 132 Noland Hall
  • Days: Tuesdays and Thursdays
  • Time: 1:00 PM - 2:15 PM
  • Room: 132 Noland Hall


  • The CS 367 website is under construction for the upcoming semester.
  • Course website will be available on Tuesday, January 17th for enrolled students.
  • There is NO textbook for this course.

Course Description:

Prereqs: CS 302 or consent of instructor. Students are strongly encouraged to take CS 367 within two semesters of having taken CS 302.

Study of data structures (including stacks, queues, trees, graphs, and hash tables) and their applications. Development, implementation, and analysis of efficient data structures and algorithms (including sorting and searching). Experience in use of an object-oriented programming language.

Tentative Weekly Schedule (Log in to http://canvas.wisc.edu for actual)

Week 1:

Course Intro., Interfaces, Java Objects and Generics
Readings: Introduction
Outlines: Week 1 outline

Week 2:

Lists (array-based), Iterators
Readings: Lists
Outlines: Week 2 outline

Week 3:

Command Line, Exceptions Review, Primitives vs. References Review
Readings: Exceptions
Outlines: Week 3 outline

Week 4:

Linked Lists
Readings: Linked Lists
Outlines: Week 4 outline

Week 5:

Linked Lists (cont.), Complexity
Readings: Linked Lists, Complexity
Outlines: Week 5 outline

Week 6:

Complexity (cont.), Stacks and Queues, Trees Intro, Priority Queues
Readings: Complexity, Stacks-and-Queues, Trees Intro., Priority Queues
Outlines: Week 6 outline

Week 7:

Priority Queues and Heaps (cont.)
Readings: Priority Queues

Week 8:

Readings: Recursion

Week 9:

Search, General Trees, Binary Trees, Binary Search Trees
Readings: Searching, Trees, Binary-Search-Trees

Spring Break 3/18 - 3/26

Week 10:

Binary Search Trees (cont.), Balanced Search Trees, Red-Black Trees
Readings: Binary-Search-Trees, Red-Black-Trees

Week 11:

Red-Black Trees (cont.), Graphs
Readings: Red-Black-Trees, Graphs

Week 12:

Graphs (cont.)
Readings: Graphs

Week 13:

Graphs (cont.), Hashing
Readings: Graphs, Hashing

Week 14:

Hashing (cont.), Sorting
Readings: Hashing, Sorting

Week 15:

Sorting (cont.)
Readings: Sorting