Skip to main content
Graph
Search
fr
en
Login
Search
All
Categories
Concepts
Courses
Lectures
MOOCs
People
Practice
Publications
Startups
Units
Show all results for
Home
Concept
Pseudocode
Formal sciences
Theoretical computer science
Programming language theory
High-level programming lang...
Graph Chatbot
Related lectures (11)
Login to filter by course
Login to filter by course
Reset
Algorithms: Finding Maximum Value in a Sequence
Covers finding the maximum value in a sequence of integers using different algorithm specifications and types.
Algorithms: Finding Maximum Value in a Sequence
Covers algorithm specification and finding maximum value in a sequence of integers.
Optimal Binary Search Trees
Explains Optimal Binary Search Trees using dynamic programming and covers a midterm exam from 2016.
Computation & Algorithms I
Covers the basics of algorithms, their historical significance, pseudo-code representation, and practical tasks in computational thinking.
Number Representation and Algorithms
Explores number representation, algorithms, recursion, and probabilities in decimal and binary.
Longest Common Subsequence and Optimal BST
Explores Longest Common Subsequence and Optimal Binary Search Trees, discussing algorithms and probabilities for efficient search structures.
Dynamic Programming: Rod Cutting and Matrix Chain Multiplication
Covers dynamic programming techniques for solving the rod cutting and matrix chain multiplication problems.
Algorithms: Union Find and Minimum Spanning Trees
Discusses Union-Find data structures and Minimum Spanning Trees, covering algorithms and their applications in network design and optimization.
Matrix Multiplication: Strassen's Algorithm
Introduces matrix multiplication and Strassen's algorithm, covering divide-and-conquer approach, data structures like heaps, and MAX-HEAPIFY operation.
Matrix Multiplication and Divide-and-Conquer Techniques
Discusses matrix multiplication using divide-and-conquer techniques and introduces Strassen's algorithm for improved efficiency.
Matrix Multiplication and Heaps: Efficient Algorithms
Discusses Strassen's algorithm for matrix multiplication and heaps, covering efficient algorithms and their applications in computer science.
Previous
Page 1 of 1
Next
