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: Tue 07/08 - Introduction, Examples of Algorithms
- Book reading: Chapter 1, Chapter 2.6 (Binary Search), Chapter 6.2 (Selection Sort).
- Slides for Introduction:
PDF,
PPT.
- Slides for Examples of Algorithms:
PDF,
PPT. Today we covered up to slide 42.
- Lecture 2: Wed 07/09 - Examples of Algorithms (continued), Analysis of Algorithms
- Book reading: Chapter 2.
- Slides for Examples of Algorithms:
PDF,
PPT. Today we covered from slide 43 to the end.
- Slides for Analysis of Algorithms:
PDF,
PPT. Today we covered up to slide 46.
- Lecture 3: Wed 07/09 - More on Analysis of Algorithms.
- Book reading: Chapter 2.
- Slides for Analysis of Algorithms:
PDF,
PPT. Today we covered from slide 47 to the end.
- Additional slides with methods and examples: PDF, PPT.
- Lecture 4: Mon 07/14 - Data Structures: Arrays, Linked Lists.
- Book reading: Chapter 3.1, 3.2, 3.3, 3.4.
- Slides:
PDF,
PPT. Today we covered up to slide 71.
- Lecture 5: Tue 07/15 - Linked Lists (continued), Strings, 2D arrays, Graphs.
- Book reading: Chapter 3.1, 3.2, 3.3, 3.4, 3.6, 3.7.
- Slides for lists:
PDF,
PPT. Today we covered from slide 72 up to the end.
- Slides for strings, 2D arrays, and graphs: PDF, PPT.
- Lecture 6: Wed 07/16 - Abstract Data Types, Stacks, FIFO Queues.
- Book reading for abstract data types and stacks: Sections 4.2, 4.3, 4.4.
- Slides for abstract data types and stacks: PDF, PPT. Today we covered all slides.
- Book reading for FIFO queues: Section 4.6.
- Slides for FIFO queues: PDF, PPT. Today we covered all slides.
- Lecture 7: Thu 07/17 - Recursion, Dynamic Programming.
- Book reading: Sections 5.1, 5.3.
- Slides: PDF, PPT (today we covered slides 1-85).
- Lecture 8: Mon 07/21 - Dynamic Programming (continued)
- Book reading: Sections 5.1, 5.3.
- Slides: PDF, PPT (today we covered slides 86-end).
- Lecture 9: Tue 07/22 - Trees and Graphs.
- Book reading: Sections 5.4, 5.5, 5.6, 5.7, 5.8.
- Slides: PDF, PPT.
- Lecture 10: Wed 07/23 - First Midterm.
- Lecture 11: Thu 07/24 - Quicksort and Mergesort.
- Book reading for quicksort: Sections 6.1, 7.1, 7.2, 7.5, 7.8.
- Slides for quicksort: PDF, PPT.
- Book reading for mergesort: Sections 8.1, 8.3, 8.6.
- Slides for mergesort: PDF, PPT.
- Lecture 12: Mon 07/28 - Heaps
- Book reading: Sections 9.1, 9.2, 9.3, 9.4.
- Slides: PDF, PPT.
- Lecture 13: Tue 07/29 - Radix sort
- Book reading: Sections 10.1, 10.3, 10.5, 10.6.
- Slides: PDF, PPT.
- Lecture 14: Wed 07/30 - Search Trees
- Book reading for search trees: Sections 12.1, 12.2, 12.3, 12.4, 12.5, 12.6, 13.3.
- Slides for search trees: PDF, PPT.
- Lecture 15: Thu 07/31 - Second Midterm.
- Lecture 16: Mon 08/04 - Minimum-Cost Spanning Trees
- Book reading for minimum-cost spanning trees: Sections 20.1, 20.2, 20.3, 20.4.
- Slides for minimum-cost spanning trees: PDF, PPT. Today we did slides 1-39.
- Lecture 17: Tue 08/05 - Minimum-Cost Spanning Trees (continued), Shortest Paths
- Book reading for minimum-cost spanning trees: Sections 20.1, 20.2, 20.3, 20.4.
- Slides for minimum-cost spanning trees: PDF, PPT. Today we did slides 40-end.
- Book reading for shortest paths: Sections 21.1, 21.2, 21.3, up to program 21.4 on page 294.
- Slides for shortest paths: PDF, PPT.
- Lecture 18: Wed 08/06 - Review
- Lecture 19: Thu 08/07 - Review
- Final Exam: Mon 08/11
Go to the extended version of this page, that includes links to code.
Back to CSE 2320 home page.