Link

Data Structures and Parallelism

University of Washington, Winter 2020

Feb 14

HW 6: A* Search and EX 4: Society

HW 6: A* Search and EX 4: Society were released earlier today. We’ve also released HW 9: Seam Carving. It won’t be due until the end of the quarter. (Autograder not ready until later.)

The midterm exam will be graded over the weekend. For this week’s charrette, complete the Midterm Exam (Solution) in a group, discuss your problem solving process, and submit a completed version to Gradescope.

Over the last few weeks, we’ve learned how to solve problems using a variety of data structures and algorithm templates. Next week, we’ll explore how to apply these algorithm ideas through a case study of sorting, one of the most well-studied problems in computer science. Sorting is a critical operation in many areas of computer science with several surprising analogies and connections to the data structures concepts we’ve learned.

All Announcements

7 Comparison Sorts

Feb 19

Comparison Sorts

Reading, Handout

Feb 20

Section Graph Algorithms

Feb 21

Quicksort

Reading, Handout

HW 6 due A* Search

HW 7 out HuskyMaps Server

Web App

EX 5 out Sorting


Calendar

6 Midterm Exam

Feb 10

Shortest Paths

Reading, Handout, Guide

Feb 11

EX 3 due Data Structures

Feb 12

Reductions and Decomposition

Reading, Handout

Feb 13

Section Midterm Review

Feb 14

Software Engineering

Reading, Handout

Midterm Exam

HW 6 out A* Search

HW 9 out Seam Carving

EX 4 out Society

7 Comparison Sorts

Feb 19

Comparison Sorts

Reading, Handout

Feb 20

Section Graph Algorithms

Feb 21

Quicksort

Reading, Handout

HW 6 due A* Search

HW 7 out HuskyMaps Server

Web App

EX 5 out Sorting

8 Optimizing Algorithms

Feb 24

Sorting and Algorithm Bounds

Reading, Handout

Feb 25

EX 4 due Society

Feb 26

Parallel Algorithms

Reading, Handout

Feb 27

Section Sorting Algorithms

Feb 28

Parallel Algorithm Analysis

HW 7 due HuskyMaps Server

HW 8 out Contraction Hierarchies

EX 6 out Parallelism

9 Parallel Algorithms

Mar 2

Multi-Pass Parallel Algorithms

Mar 3

EX 5 due Sorting

Mar 4

Concurrency and Mutual Exclusion

Mar 5

Section Parallel Algorithms

Mar 6

Race Conditions and Deadlock

HW 8 due Contraction Hierarchies

EX 7 out Concurrency

10 Unsolved Problems

Mar 9

Programming the World

Computational Literacy for All

Optional Reading

Mar 10

EX 6 due Parallelism

Mar 11

Computational Complexity

Mar 12

Section Final Review

Mar 13

Final Review

HW 9 due Seam Carving

11 Final Exam

Mar 17

EX 7 due Concurrency

Mar 19

Final Exam