# Algorithms: 24-Part Lecture Series

Algorithms 24-Part Lecture Series covers the essential information that every serious programmer needs to know about algorithms and data structures, with emphasis on applications and scientific performance analysis of Java implementations.

## Course Description

This collection of video lectures from Pearson provides a comprehensive exploration of fundamental data types, algorithms, and data structures, with an emphasis on applications and scientific performance analysis of Java implementations. The instructors offer readings related to these lectures that you can find in Algorithms, Fourth Edition, the leading textbook on algorithms today. These lectures provide another perspective on the material presented in the book and generally cover the material in the same order, though some book topics have been combined, rearranged, or omitted in the lectures. What you will learn: These videos survey the most important computer algorithms in use today. The algorithms described in these lectures represent a body of knowledge developed of the last 50 years that has become indispensable. These... Read More »

This collection of video lectures from Pearson provides a comprehensive exploration of fundamental data types, algorithms, and data structures, with an emphasis on applications and scientific performance analysis of Java implementations. The instructors offer readings related to these lectures that you can find in Algorithms, Fourth Edition, the leading textbook on algorithms today. These lectures provide another perspective on the material presented in the book and generally cover the material in the same order, though some book topics have been combined, rearranged, or omitted in the lectures.

**What you will learn:**

These videos survey the most important computer algorithms in use today. The algorithms described in these lectures represent a body of knowledge developed of the last 50 years that has become indispensable. These lectures present:

- Implementations of useful algorithms
- Detailed information on performance characteristics
- Examples of clients and applications

The early lectures cover our fundamental approach to studying algorithms, including data types for stacks, queues, and other low-level abstractions. Then we cover these major topics:

- Sorting algorithms, highlighting the classic Quicksort and Mergesort algorithms.
- Searching algorithms, including search methods based on balanced search trees and hashing.
- String-processing algorithms, from tries and substring search to regular expression search and data compression.
- Graph algorithms, starting with graph search, shortest paths, and minimum spanning trees, and working up to maximum flow/minimum cut and applications.
- Reductions, linear programming, and intractability.

Read Less

#### Target Audience

- Any student (from high school to graduate level) having a good introduction to programming, with an interest in majoring in any science or engineering discipline (including computer science).
- Anyone using a computer to address large problems that require an understanding of efficient algorithms. Anyone interested in preparing for a career in the industry involving software or computer applications.