Calendar and Lecture Slides

CSE 326 - Winter 2010

Links to slides used in lecture.  Slides with ink tend to print well in landscape mode, with 4 slides per page.

(All future topics and dates subject to.  )

Week of

Monday

Wednesday

Thursday - Section

Friday

Reading

Jan 3

  • Introduction, Stacks and Queues
    [slides, ink]
  • Math Review
  • Project 1 released
    [slides, ink]

Intro

Chapters
1, 2 & 3

Jan 10

  • More Asymptotic analysis, Big-O
    [no new slides]
  • Priority Queues & Binary heaps
  • Project 1 due, 11pm
    [slides, ink]

Big-O

  • Binary heaps
  • Homework 1 due (at the beginning of lecture)
    [no new slides]

Chapter 6

Jan 17

Jan 18 - HOLIDAY
Martin Luther King Day

  • D-heaps & Leftist heaps  & Skew Heaps
    [slides, ink]

Heaps

Chapter 6

Jan 24

AVL trees, search algorithms, Generics & JUnit slides, MyArrayList.java, MyArrayListTest.java

Chapter 4

Jan 31

  • Splay Trees
  • Project 2A due 11pm
    [no new slides]

Midterm Review

MIDTERM

Chapter 4

Feb 7

  • B-Trees again
  • Project 2B due, 11pm
    [no new slides]

Midterms Returned & Discussed, B-Trees

Chapters 4 & 5

Feb 14

  • Feb 15 - HOLIDAY
    Presidents Day

Hashing, Sets,
Project #3

  • Disjoint Sets I
  • Homework 5 due
    [slides, ink]

Chapters 5 & 8

Feb 21

Project #3,
Sorting

  • Graph representations
  • Homework 6 due
    [slides, ink]

Chapters 8 & 7 & 9

Feb 28

  • Topological Sort
    [no new slides]
  • Shortest Path
    & Dijkstra’s Algorithm
  • Project 3 – Code due, 11pm
    [slides, ink]

Graphs

  • Minimum spanning trees
  • Kruskal's algorithm
  • Prim's algorithm
  • Homework 7 due
  • Project 3 – Write-up & Benchmarking due, 11pm
    [slides, ink]

Chapter 9

Mar 7

  • All-pairs shortest paths & Dynamic programming
    [slides, ink]
  • Data Compression & Huffman Coding
    [slides]

Final Review

  • NP-Completeness & Final Review
  • Homework 8 due
    [slides]

Chapter 10

FINAL EXAM: Tuesday March 16, 2:30-4:20 in our regular lecture room

 

 

CREDITS

Lecture slides borrow heavily from those used in previous offerings on cse326, who in turn borrowed from previous offerings, etc. etc..