Lectures related to Algorithms: Finding Maximum Value in a Sequence

Algorithms: Finding Maximum Value in a Sequence

Covers finding the maximum value in a sequence of integers using different algorithm specifications and types.

Complexity & Induction: Algorithms & Proofs

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

Prime Numbers: Finding and Testing

Covers the definition of a function to determine if a given number is prime.

Euclidean Algorithm: GCD Calculation

Covers the Euclidean algorithm for GCD calculation and algorithmic complexity analysis.

General Introduction to Data Science

Offers a comprehensive introduction to Data Science, covering Python, Numpy, Pandas, Matplotlib, and Scikit-learn, with a focus on practical exercises and collaborative work.

Shor's factoring algorithm: Quantum Phase Estimation

Covers Shor's factoring algorithm and the link between order finding and factoring.

Complexity of Algorithms: Proofs of Time Complexity

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

Shor's algorithm: factoring integers

Covers the basics of Shor's algorithm for factoring integers and the steps involved in the quantum algorithm.

Cartesian Product and Induction

Introduces Cartesian product and induction for proofs using integers and sets.

Elementary Algebra: Numeric Sets

Explores elementary algebra concepts related to numeric sets and prime numbers, including unique factorization and properties.

Python Programming: Lists and Functions Overview

Introduces Python programming concepts, focusing on lists, functions, and their applications in problem-solving.

Algorithms & Growth of Functions

Covers optimization algorithms, stable matching, and Big-O notation for algorithm efficiency.

Introduction to Jupyter Exercises

Introduces Jupyter exercises on Differential Privacy, covering random generators, understanding data intrusion impact, and practical applications.

Integers and Rings

Covers integers, rings, subrings, invertibility, divisors of zero, and equivalence relations in formal fractions.

Lenstra's Algorithm: Integer Factorization

Covers Lenstra's Algorithm for integer factorization, which efficiently computes prime factors of an integer.

Complexity & Induction: Algorithms & Proofs

Explores worst-case complexity, mathematical induction, and algorithms like binary search and insertion sort.

Algorithmic Complexity: Travel Time Analysis

Covers control operations, algorithmic complexity, function calls, and travel time analysis.

Optimization Algorithms: Greedy Approach

Explores optimization problems and greedy algorithms for efficient decision-making.

Python Lists: Manipulation and Comprehension

Covers Python list manipulation and comprehension, emphasizing memory representation and mutability.

Binary Search Algorithm

Explains the binary search algorithm using two pointers to efficiently search a sorted list.