Lectures related to Hashing and Sorting Techniques in Database Systems

Introduces selection and insertion sorting algorithms, explaining their correctness and time complexity.

Covers operations and methods related to dictionaries in Python, including creating, updating, and handling key errors.

Covers the analysis of hash tables, including search operations and expected collisions.

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