CSE 373, Spring 2018: Home

Course Announcements

  • The TA-led review session has been moved to Friday June 1st at 5:00pm in EEB 125 to support the TA strike.
  • Final Exam info and practice material have been posted.
  • There will be a TA-led review session in Gowen 301 on Monday June 4th from 4:30pm - 6:30pm.
  • Homework 7 / Partner Project 4: Maze Generator and Solver posted.
    The partner selection form must also be filled out for the assignment.

Upcoming due dates

Note: unless otherwise noted, all assignments are due at 11:59pm.

Homework 7: Maze Generator and Solver

Calendar

Week 1
Mon, Mar 26: Introduction to ADTs and Data Structures

Slides:

KaseyLinkedList.java

Suggested reading: Weiss 3.1, 3.2, 3.4

Wed, Mar 28: Implementing ADTs with Stacks and Queues

Slides:

KaseyStack.java

Suggested reading: Weiss 3.6, 3.7

Thur, Mar 29: Section 1: 143 review

Handouts:

Fri, Mar 30: Implementing Maps with Linked Lists, Iterators

Slides:

KaseyMap.java

Suggested reading: Weiss 1.4, 3.3, 3.5

Week 2
Mon, April 2: Testing and Debugging

Slides:

KaseyMapTests.java

Wed, April 4: Introduction to Asymptotic Analysis and Function Modeling

Slides:

Suggested reading: Weiss 1.2, 2.1 - 2.4.2

Thur, April 5: Section 2: asymptotic analysis

Handouts:

Note: Project 1 partner form due

Fri, April 6: Modeling Complex Functions

Slides:

Review Resources: Math review

Suggested reading: Weiss 2.4.3, 2.4.5

Note: Homework 1 due

Week 3
Mon, April 9: Binary Search Trees

Slides:

KaseyBinarySearchTree.java

Suggested reading: Weiss 4.4

Wed, April 11: AVL Trees

Slides:

Suggested reading: see Monday April 9

Note: Panopto has no sound due to broken mic

Thur, April 12: Section 3: recurrences and AVL Trees

Handouts:

Fri, April 13: Introduction to Hash Tables

Slides:

Suggested reading: Weiss 5.1-5.5

Week 4
Mon, April 16: Hashing: Open Addressing

Slides:

Wed, April 18: UML Diagrams and Implementing HashMap

Slides:

Thur, April 19: Section 4: Dictionaries

Handouts:

Fri, April 21: Implementing AVL Tree

Slides:

Week 5
Mon, April 23: Computer Memory

Slides:

suggested reading: Weiss 4.7

Wed, April 25: Midterm Review

Slides:

Thur, April 26: Section 5: Midterm Review

Handouts:

Fri, April 27: Midterm Exam :)
Week 6
Mon, April 30: B-Trees

Slides:

Wed, May 2: B-Tree Insertions, Intro Heaps

Slides:

Thurs, May 3: Section 6: Memory, B-Trees, and Heaps

Handouts:

Fri, May 4: Implementing Heaps and Floyd's buildHeap

Slides:

Suggested reading: Weiss 6.1 - 6.3

Week 7
Mon, May 7: Sorting

Slides:

Wed, May 9: Solving Recurrences with Trees and Master Theorem

Slides:

The last part of this lecture covers the intro to Graphs.

Thurs, May 10: Section 7: Recurrences, Divide-and-Conquer Sorts

Handouts:

Fri, May 11: Implementing Graphs

Slides:

Week 8
Mon, May 14: Shortest Paths

Slides:

Wed, May 16: Topological Sort and Strongly Connected Components

Slides:

Note: unfortunately, the panopto recording started 5 minutes or so into the lecture.

Thurs, May 17: Section 8: Graphs

Handouts:

Fri, May 18: Minimum Spanning Trees

Slides:

Week 9
Mon, May 21: Disjoint Sets

Slides:

Wed, May 23: Disjoint Sets with Arrays

Slides:

Thurs, May 24: Section 9: MSTs, Disjoint Sets, Interview Prep

Handouts:

Note: solutions handout pending. Post on piazza if you want to discuss a problem in the meantime.

Fri, May 25: P and NP

Slides: (pending)

Video

Week 10
Mon, May 28: Memorial Day (no lecture)
Wed, May 30: Exam Review

Slides: (pending)

Video

Thurs, May 31: Section 10: Final Exam Review

Handouts:

Fri, Jun 1: Industry Guest Lecture

Slides:

Video