---
title: "CS161 REVIEW"
type: course-overview
source-count: 2
status: active
confidence: high
---

# CS161 REVIEW

Stanford course with 2 lecture notes.

## Other Notes

- [SU-CS161 Review](../raw/course/cs161_review/kbhsu_cs161_review.md)
- [SU-CS161 TA Review](../raw/course/cs161_review/kbhsu_cs161_review_2.md)

## Key Topics Referenced

- [[Amortized Analysis]]
- [[Bellman Ford Algorithm]]
- [[Breadth First Search]]
- [[Depth First Search]]
- [[Dijikstra S Algorithm]]
- [[Dynamic Programming]]
- [[Floyd Warshall Algorithm]]
- [[Graph]]
- [[Greedy Algorithm]]
- [[Hashing]]
- [[Huffman Coding]]
- [[K Select]]
- [[Knapsack]]
- [[Longest Common Subsequence]]
- [[Master Theorem]]
- [[Merge Sort]]
- [[Minimum Cut]]
- [[Minimum Spanning Tree]]
- [[Principle Of Induction]]
- [[Quicksort]]
- [[Recurrence Relation]]
- [[Red Black Tree]]
- [[Strongly Connected Components]]
- [[Substitution Method]]
- [[Topological Sort]]
- [[Universal Hash Family]]
- [[Worst Case Analysis]]

