CS 261 – Data Structures
Fall 2019
Instructor:
Rob Hess(hessro@oregonstate.edu)
Office hours:
- Wed., 11:05am–12:30pm — KEC 1109
- Thurs., 2:30–4:00pm — Zoom Join
Lectures:
- Section 001: MWF, 1:00 – 1:50pm — LINC 228
- Section 002: MWF, 9:00 – 9:50am — Weniger 153
Syllabus:
Textbooks:
CS 261 Course Notes by Tim Budd
Assignments
Programming assignments will be managed via GitHub Classroom. Following the links below will prompt you to sign in to GitHub and to create an assignment repository for yourself. The assignment repository will at a minimum contain a README.md file containing the assignment description. There may also be additional skeleton files in the repository to help you get started with the assignment. To submit an assignment, make sure you have committed your solution code and pushed it to your GitHub repository before the assignment deadline.
Assignment 1 – Dynamic arrays and linked lists
Due: Monday, 10/14/2019, 11:59pm
- Demo due by 11:59pm, Monday 10/28/2019
- Lecture doodles – section 001
Assignment 2 – Stacks and queues
Due: Monday, 10/28/2019, 11:59pm
- Demo due by 11:59pm, Monday 11/11/2019
Assignment 3 – Binary search trees
Due: Monday, 11/11/2019 11/18/2019, 11:59pm
- Demo due by 11:59pm,
Monday 11/25/2019Friday 12/6/2019 - Lecture doodles – section 001
Assignment 4 – Priority queues
Due: Monday, 12/2/2019, 11:59pm
- No demo for this assignment
Course Topics
(click titles to expand/collapse)
Weeks 9 – 10
Materials
Readings
- Chapter 12 – Budd's Course Notes
- Associative array – Wikipedia
- Hash table – Wikipedia
- Hash Table – VisuAlgo.net
Week 10
Materials
- Lecture notes
- Lecture doodles – from section 001
Readings
- Chapter 13 – Budd's Course Notes
- Graph (discrete mathematics) – Wikipedia
- Graph (ADT) – Wikipedia
- Graph Data Structures – VisuAlgo.net
- DFS and BFS – Old CS 261 Presentation
- Depth-first search – Wikipedia
- Breadth-first search – Wikipedia
- Dijkstra's algorithm – Wikipedia
- Single-Source Shortest Paths (Dijkstra's Algorithm) – VisuAlgo.net