CS 251 Archive

Benjamin Lobos Lertpunyaroj

Course information

Spring 2025
CS 25100 Data Structures and Algorithms @ Purdue
Prof. Andrés Bejarano Posada

Slides

01 Course Overview

02 Runtime Expressions

03 Asymptotic Runtime Analysis

04 Recursive Algorithms

05 Array

06 Linked List

07 Stack and Queue

08 Tree

09 Binary Heap

10 Heapify

11 Linearithmic Sorting

12 More Linearithmic Sorting

13 Linear Sorting

14 Hashing

15 Hash Table Chaining

16 Hash Table Open Addressing

17 Binary Search Tree

18 B-Tree

 

19 Red-Black Tree

20 Insert in Red-Black Tree

21 Introduction to Graphs

22 Graph Traversals

23 Directed Graph

24 Transitive Closure

25 Topological Ordering

26 Strongly Connected Components

27 Weighted Graph

28 Bellman Ford

29 Minimum Spanning Tree

30 Kruskals Algorithm

31 Union-Find

32 String Pattern Matching

33 Tries

34 Huffman Coding

35 Point-Region Quadtree

36 Bintree and K‑D Tree

Exam Sheet

Final Exam Sheet

PSOs

Justin Zhang Notes

Past PSO Archive

Bejarano Notes

Fall 2024 Notes

Spring 2025 Notes