Lecture
Fast Interval Queries
Related lectures (29)
Algorithms: Final Exam Review
Provides a detailed review of the 2016 final exam, covering various algorithmic problems.
Binary trees and Catalan numbers
Covers the definition of binary trees, recursive formulas, and generating functions for Catalan numbers.
Binary Search Trees: Implementation and Operations
Covers the implementation and operations of basic data structures like stacks, queues, and linked lists, and introduces binary search trees.
Huffman's Algorithm: Mechanizing the Proof
Explores the mechanization of Huffman's algorithm proof and functional implementation.
Binary Search Trees Operations
Explains binary search tree operations, focusing on insertion, search, and list conversion, with an emphasis on formal verification and debugging.
Graphs: Properties and Representations
Covers graph properties, representations, and traversal algorithms using BFS and DFS.
Class Hierarchies
Covers abstract classes, class extensions, object definitions, companion objects, and dynamic binding in Scala.
Data Structures: Stacks, Queues, Linked Lists
Covers stacks, queues, linked lists, and binary search trees in data structures.
Optimal Binary Search Trees
Explains Optimal Binary Search Trees using dynamic programming and covers a midterm exam from 2016.
Encoder and Decoder for Prefix-Free Codes
Covers the implementation and verification of encoder and decoder for prefix-free codes, including classes and types, lemmas on trees, and the main theorem.