CSE 2320
- Spring 2014 - Lectures
There is also an
extended version
of this page, that includes links to C programs associated with each topic.
Lecture 1: Mon 01/13 - Introduction
Book reading: Chapter 1.
Slides:
PDF
,
PPT
.
Lecture 2: Wed 01/15 - Examples of Algorithms
Book reading: Chapter 1, Chapter 2.6 (Binary Search), Chapter 6.2 (Selection Sort).
Slides:
PDF
,
PPT
.
Lecture 3: Wed 01/22 - Analysis of Algorithms
Book reading: Chapter 2.
Slides:
PDF
,
PPT
.
Lecture 4: Mon 01/27 - Analysis of Algorithms, Arrays.
Book reading: Chapter 3.1, 3.2.
Slides for analysis of algorithms:
PDF
,
PPT
(same as in previous lecture, today we covered slides 65-99).
Slides for data structures:
PDF
,
PPT
(covered up to slide 15).
Lecture 5: Wed 01/29 - Linked Lists.
Book reading: Chapter 3.3, 3.4.
Slides:
PDF
,
PPT
(same as in previous lecture, today we covered slides 16-69).
Lecture 6: Mon 02/03 - Review of Chapter 2, for Assignment 2.
Book reading: Chapter 2.
Review slides for assignment 2:
PDF
,
PPT
.
Lecture 7: Wed 02/05 - Lists, continued.
Book reading: Chapters 3.
Slides:
PDF
,
PPT
(same as in lecture 5, today we covered slides 70-96).
Lecture 8: Mon 02/10 - Strings, 2D arrays, Graphs.
Book reading: Chapters 3.6, 3.7.
Slides:
PDF
,
PPT
.
Lecture 9: Wed 02/12 - Abstract Data Types and Stacks.
Book reading: Sections 4.2, 4.3, 4.4.
Slides:
PDF
,
PPT
.
Lecture 10: Mon 02/17 - Abstract Data Types: Stacks, FIFO Queues.
Book reading: Section 4.6.
Slides for stacks (same as in Lecture 9):
PDF
,
PPT
.
Slides for FIFO queues:
PDF
,
PPT
.
Lecture 11: Wed 02/19 - FIFO Queues, Recursion, Fibonacci numbers.
Book reading: Sections 4.6, 5.1, 5.3.
Slides for FIFO queues:
PDF
,
PPT
.
Slides for recursion and Fibonacci numbers:
PDF
,
PPT
(today we covered slides 1-35).
Lecture 12: Mon 02/24 - Review for First Midterm.
Lecture 13: Wed 02/26 - First Midterm.
Lecture 14: Mon 03/03 - Fibonacci numbers, Memoization.
Book reading: 5.3.
Slides (same as in lecture 11):
PDF
,
PPT
(today we covered up to slide 46).
Lecture 15: Wed 03/05 - Dynamic Programming.
Book reading: 5.3.
Slides (same as in lecture 11):
PDF
,
PPT
(today we covered up to slide 93).
Lecture 16: Mon 03/17 - 2-Dimensional Dynamic Programming.
Book reading: 5.3.
Slides (same as in lecture 11):
PDF
,
PPT
(today we covered from slide 93 to the end).
Lecture 17: Wed 03/19 - Trees and Graphs.
Book reading: Sections 5.4, 5.5, 5.6, 5.7, 5.8.
Slides:
PDF
,
PPT
.
Lecture 18: Mon 03/24 - Quicksort
Book reading: Sections 6.1, 7.1, 7.2, 7.5, 7.8.
Slides:
PDF
,
PPT
.
Lecture 19: Wed 03/26 - Mergesort
Book reading: Sections 8.1, 8.3, 8.6.
Slides:
PDF
,
PPT
.
Lecture 20: Mon 03/31 - Heaps
Book reading: Sections 9.1, 9.2, 9.3, 9.4.
Slides:
PDF
,
PPT
.
Lecture 21: Wed 04/02 - Second Midterm.
Lecture 22: Mon 04/07 - Radix sort
Book reading: Sections 10.1, 10.3, 10.5, 10.6.
Slides:
PDF
,
PPT
.
Lecture 23: Wed 04/09 - Radix sort
Book reading: Sections 10.1, 10.3, 10.5, 10.6.
Slides:
PDF
,
PPT
(same as in previous lecture).
Lecture 24: Mon 04/14 - Radix sort, Search Trees
Book reading: Sections 12.1, 12.2, 12.3, 12.4, 12.5, 12.6.
Radix Sort slides:
PDF
,
PPT
(same as in previous lecture).
Search Trees slides:
PDF
,
PPT
. Today we covered up to slide 29.
Lecture 25: Wed 04/16 - Search Trees
Book reading: Sections 13.3, 13.4.
Search Trees slides:
PDF
,
PPT
. Same as in previous lecture. Today we covered slides 29-end.
Lecture 26: Mon 04/21 - Minimum-Cost Spanning Trees
Book reading: Sections 20.1, 20.2, 20.3, 20.4.
Slides:
PDF
,
PPT
.
Lecture 27: Wed 04/23 - Shortest Paths
Book reading: Sections 21.1, 21.2, 21.3, up to program 21.4 on page 294.
Slides:
PDF
,
PPT
.
Lecture 28: Mon 04/28 - Review
Lecture 29: Wed 04/30 - Review
Go to
the extended version
of this page, includes links to code.
Back to CSE 2320 home page.