Mediaspace scheduled maintenance: Aug 25, 2026 07:00 - 12:00 AM. During this time, videos will be temporarily unavailable. Check status updates.

Lecture

Algorithms Midterm Exam: Solving 2019 Problems

Related lectures (31)

Discusses matrix multiplication using divide-and-conquer techniques and introduces Strassen's algorithm for improved efficiency.

Explores heapsort, priority queues, and their operations, highlighting time complexity and practicality.

Discusses Strassen's algorithm for matrix multiplication and heaps, covering efficient algorithms and their applications in computer science.

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

Introduces greedy algorithms and matroids, highlighting their efficiency in solving optimization problems.

Covers algorithmic complexity and travel time analysis, focusing on measuring the time taken by algorithms and evaluating their performance.

Covers heaps, heapsort, heap data structure, storage in arrays, and heap property maintenance.

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

Covers the analysis of worst time complexity for algorithms and time complexity with real numbers and integers.

Explores algorithmic complexity, comparing growth rates using Theta notation and characterizing different complexity classes.

Explores algorithmic challenges, time complexity, optimization, recursion, and probability calculations.

Covers the complexity analyses of algorithms and their worst-case time complexities.

Explores algorithm complexity, analyzing efficiency and worst-case scenarios of sorting algorithms.

Covers the time complexity of algorithms and includes a quiz.

Covers the basics of time complexity and Landau notation, focusing on understanding the concepts and their applications in algorithms.

Explores recursion in programming, discussing its benefits, challenges, and impact on algorithm complexity.

Covers the analysis of quick sort, including time complexity and randomization for finding the k-th smallest number.

Explains Big-O notation for algorithm complexity analysis through polynomial examples and growth rate identification.

Covers the Local Hamiltonian Problem, focusing on QMA-Complete problems and the complexity of verifying quantum computations.

Explores server evaluation, security, programming concepts, and encryption efforts by companies like Google.