1 / 8

Intro to Computer Algorithms Lecture 20

This lecture provides an overview of computer algorithms, including Prim's and Kruskal's algorithms, and discusses Dijkstra's algorithm for finding the shortest path. It also covers topics such as data warehouses and computer security.

ronm
Download Presentation

Intro to Computer Algorithms Lecture 20

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Intro to Computer Algorithms Lecture 20 Phillip G. Bradford Computer Science University of Alabama

  2. Announcements • Advisory Board’s Industrial Talk Series • http://www.cs.ua.edu/9IndustrialSeries.shtm • 2-Dec: Mike Thomas, CIO, Gulf States Paper • Next Research Colloquia: • Prof. Prof. Nenad Jukic • 17-Nov @ 11:00am • “Data Warehouses:  The Foundation of Business Intelligence”

  3. Computer Security Research Group • Meets every Friday from 11:00 to 12:00 • In 112 Houser • Computer Security, etc. • Email me to be on the mailing list!

  4. CS Story Time • Prof. Jones’ research group • See http://cs.ua.edu/StoryHourSlide.pdf

  5. Next Midterm • Tuesday before Thanksgiving ! • 25-November

  6. Outline • Review the remainder of the semester • Lots of fun stuff! • Finish Prim’s and Kruskal’s algorithms • Dijkstra’s Algorithm • The Single-source shortest path challenge • Start talking about Huffman trees

  7. Prim’s and Kruskal’s Algorithms • See slides from last lecture • More examples

  8. Dijkstra’s Algorithm • Non-negative edge weights • Classic Greedy Algorithm • Growing the shortest paths • Relaxing the fringe elements

More Related