Lectures related to Algorithms: Final Exam Review

Explores graph traversal methods, spanning trees, and shortest paths using BFS and DFS.

Covers graph properties, representations, and traversal algorithms using BFS and DFS.

Offers a recap before the Algorithms exam, covering problem-solving strategies and algorithm implementation with sample problems.

Covers stacks, queues, linked lists, and binary search trees in data structures.

Explores Prim's algorithm for minimum spanning trees and introduces the Traveling Salesman Problem.

Explains two-phase construction for arrays, hash tables, and search trees in parallel.

Explores dynamic programming for palindromic subsequences, merging binary search trees, and finding the median of two sorted arrays.

Explores practical aspects of solving parity games, including winning strategies, algorithms, complexity, determinism, and heuristic approaches.

Explores optimal binary search trees to minimize expected search cost and discusses graphs representation using adjacency matrices and lists.

Covers graph algorithms, modeling relationships between objects, and traversal techniques like BFS and DFS.

Covers worst-case complexity, algorithms, and proofs including mathematical induction and recursion.

Covers search algorithms, focusing on abductive reasoning and heuristic search strategies.

Explores algorithm growth, search complexities, and logarithmic properties in depth, with practical exercises included.

Introduces recursion and binary search algorithms for efficient problem-solving.

Covers the basics of algorithms, the importance of studying them, data structures, and the impact of algorithms on various fields.

Provides an overview of essential search and sort algorithms in computer science.

Covers the implementation and operations of basic data structures like stacks, queues, and linked lists, and introduces binary search trees.

Explains Optimal Binary Search Trees using dynamic programming and covers a midterm exam from 2016.

Covers B+ Trees, a key data structure for efficient indexing in databases.

Covers the introduction to logarithms, algorithmic notations, and analysis of algorithm travel times.