Chapter 1

Programming in C

Recursion

medium • 1 min read

Arrays

medium • 2 min read

Pointers

medium • 3 min read

Structures

medium • 4 min read

Unions

medium • 5 min read

Chapter 2

Data Structures

Stacks

medium • 1 min read

Queues

medium • 2 min read

Linked lists

medium • 3 min read

Trees

medium • 4 min read

Binary search trees

medium • 5 min read

Chapter 3

Binary Heaps

Min-heap

medium • 1 min read

Max-heap

medium • 2 min read

Heapify operation

medium • 3 min read

Priority queues

medium • 4 min read

Heap sort

medium • 5 min read

Chapter 4

Hashing

Hash functions

medium • 1 min read

Collision resolution

medium • 2 min read

Chaining

medium • 3 min read

Open addressing

medium • 4 min read

Load factor

medium • 5 min read

Chapter 5

Graphs

Representation (Adjacency list/matrix)

medium • 1 min read

Breadth-first search

medium • 2 min read

Depth-first search

medium • 3 min read

Iterative deepening

medium • 4 min read

Connected components

medium • 5 min read

Chapter 6

String Matching

Knuth-Morris-Pratt

medium • 1 min read

Rabin-Karp

medium • 2 min read

Suffix trees

medium • 3 min read

Tries

medium • 4 min read

Pattern matching

medium • 5 min read

Chapter 7

Advanced Trees

AVL trees

medium • 1 min read

B+ trees

medium • 2 min read

Red-black trees

medium • 3 min read

Splay trees

medium • 4 min read

Chapter 8

File Structures

Sequential files

medium • 1 min read

Indexed files

medium • 2 min read

Direct files

medium • 3 min read

B-tree indexing

medium • 4 min read

File sorting

medium • 5 min read