Explore key concepts in computer science through a comprehensive lecture series covering templates, algorithm analysis, sorting techniques, data structures like linked lists and trees, graph theory, and hashing. Delve into advanced topics such as mergesort analysis, AVL trees, depth-first search, and centrality in graphs. Gain practical knowledge applicable to software development and problem-solving in various computational domains.
Overview
Syllabus
Templates.
Algorithm Analysis.
Sorting (Part 1).
Mergesort analysis.
Sorting (Part 2).
Linked Lists.
Stacks.
Tree Traversal.
Binary search trees.
BST node removal.
AVL Trees (Part I).
AVL Double Rotation.
Graph Basics.
Path lengths.
Acyclic Graphs.
Centrality.
Depth-first search.
Introduction to Hash Tables.
More Hashing.
Taught by
Jonathan Anderson Cantab
Tags
Related Courses
-
Data Structures and Algorithms
-
Data Structures and Algorithms in Python
-
Data Structures and Algorithms in Python - Full Course for Beginners
4.6 -
Data Structures and Algorithms in Python
-
Data Structure and Fundamentals of Algorithms
-
Introduction to Java Programming: Fundamental Data Structures and Algorithms
4.6
