27-computer_science - CSE143 Lecture27 ComputerScience

Info iconThis preview shows pages 1–5. Sign up to view the full content.

View Full Document Right Arrow Icon
CSE 143 Lecture 27 Computer Science slides created by Marty Stepp and Benson Limketkai http://www.cs.washington.edu/143/
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
2 What's next? CSE non-majors CSE 373: Data Structures and Algorithms CSE 190 M: Web Programming INFO, DXARTS ... CSE majors CSE 303: Software Tools (C/C++, Unix/Linux, scripting) CSE 332: Data Abstractions CSE 311/312: Discrete Structures / Mathematical Foundations CSE 341: Programming Languages CSE 351: Introduction to Digital Design
Background image of page 2
3 Data structures graphs, heaps, skip lists balanced trees (AVL, splay, red-black) ORD PVD MIA DFW SFO LAX LGA HNL 849 802 1387 1743 1843 1099 1120 1233 337 2555 142 99 60 40 80 20 10 50 700 85
Background image of page 3

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Theory of computation languages, grammars, and automata computational complexity and intractability Big-Oh polynomial vs. exponential time P = NP? graph theory
Background image of page 4
Image of page 5
This is the end of the preview. Sign up to access the rest of the document.

Page1 / 14

27-computer_science - CSE143 Lecture27 ComputerScience

This preview shows document pages 1 - 5. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online