Hashing: Direct Address Tables, Hash Functions, and Collision Resolution
Learn hashing, direct address tables, hash functions, collisions, and load factor with simple examples and understand how hash tables enable fast data…
Articles
Notes, explanations and worked examples. Written to be read slowly and kept.
72 articles
Learn hashing, direct address tables, hash functions, collisions, and load factor with simple examples and understand how hash tables enable fast data…
Understand Eulerian and Hamiltonian paths and tours, their conditions, differences, examples, and real-world applications in graph theory.
Learn how Prim's, Kruskal's, Dijkstra's, and Bellman-Ford algorithms solve minimum spanning tree and shortest path problems.
Learn what graphs are, how they are represented using adjacency matrices and lists, and how BFS and DFS traverse graphs.
Learn B-Trees and B+ Trees, their structure, searching, insertion, deletion, and how they are used in databases and indexing.
Understand the kernel and image of linear transformations, how to calculate them using matrices, and how they relate to rank, nullity, injectivity,…
Learn what linear transformations are, how they map vectors between vector spaces, and how to represent them using matrices. Explore scaling, rotation,…
Learn how Markov models work, explore steady-state probabilities, and discover how eigenvalues and eigenvectors power Google's PageRank algorithm.
Understand Principal Component Analysis (PCA), dimensionality reduction, eigenvectors, and eigenvalues. Learn how PCA identifies important directions in data, reduces features, and preserves…
Learn what the characteristic polynomial is, how to find eigenvalues, and how to diagonalize a matrix step by step. Explore the conditions…