# Courses Collection

- [Academic In IT](/wiki/courses-collection/courses-collection/academic-in-it.md)
- [Reflective Writing](/wiki/courses-collection/courses-collection/academic-in-it/reflective-writing.md)
- [UCB](/wiki/courses-collection/courses-collection/ucb_courses.md)
- [CS 61A](/wiki/courses-collection/courses-collection/ucb_courses/cs_61a.md)
- [Computer Science](/wiki/courses-collection/courses-collection/ucb_courses/cs_61a/computer-science.md)
- [Scheme](/wiki/courses-collection/courses-collection/ucb_courses/cs_61a/scheme.md)
- [Python](/wiki/courses-collection/courses-collection/ucb_courses/cs_61a/python.md)
- [Data Abstraction](/wiki/courses-collection/courses-collection/ucb_courses/cs_61a/data-abstraction.md)
- [Object-Oriented Programming](/wiki/courses-collection/courses-collection/ucb_courses/cs_61a/object-oriented-programming.md)
- [Interpreters](/wiki/courses-collection/courses-collection/ucb_courses/cs_61a/interpreters.md)
- [Streams](/wiki/courses-collection/courses-collection/ucb_courses/cs_61a/streams.md)
- [MIT Algorithm Courses](/wiki/courses-collection/courses-collection/mit-algorithm-courses.md): This page is the cover for MIT algorithm courses
- [MIT 18.01](/wiki/courses-collection/courses-collection/mit-algorithm-courses/mit-18.01.md)
- [Limits and continuity](/wiki/courses-collection/courses-collection/mit-algorithm-courses/mit-18.01/limits.md)
- [Derivatives](/wiki/courses-collection/courses-collection/mit-algorithm-courses/mit-18.01/derivatives.md)
- [Integrals](/wiki/courses-collection/courses-collection/mit-algorithm-courses/mit-18.01/integrals.md)
- [MIT 6.042J](/wiki/courses-collection/courses-collection/mit-algorithm-courses/mit-6.042j.md): Also known as Mathematics for Computer Science
- [Number Theory](/wiki/courses-collection/courses-collection/mit-algorithm-courses/mit-6.042j/number-theory.md)
- [Graph Theory](/wiki/courses-collection/courses-collection/mit-algorithm-courses/mit-6.042j/graph-theory.md): Graph Theory is a fundamental field of mathematics
- [Graph and Trees](/wiki/courses-collection/courses-collection/mit-algorithm-courses/mit-6.042j/graph-theory/graph-and-trees.md)
- [Shortest Paths and Minimum Spanning Trees](/wiki/courses-collection/courses-collection/mit-algorithm-courses/mit-6.042j/graph-theory/shortest-paths-and-minimum-spanning-trees.md)
- [MIT 6.006](/wiki/courses-collection/courses-collection/mit-algorithm-courses/mit-6.006.md)
- [Intro and asymptotic notation](/wiki/courses-collection/courses-collection/mit-algorithm-courses/mit-6.006/intro-and-asymptotic-notation.md)
- [Sorting and Trees](/wiki/courses-collection/courses-collection/mit-algorithm-courses/mit-6.006/sorting-and-trees.md)
- [Sorting](/wiki/courses-collection/courses-collection/mit-algorithm-courses/mit-6.006/sorting-and-trees/sorting.md)
- [Trees](/wiki/courses-collection/courses-collection/mit-algorithm-courses/mit-6.006/sorting-and-trees/trees.md)
- [Hashing](/wiki/courses-collection/courses-collection/mit-algorithm-courses/mit-6.006/hashing.md)
- [Graphs](/wiki/courses-collection/courses-collection/mit-algorithm-courses/mit-6.006/graphs.md)
- [Shortest Paths](/wiki/courses-collection/courses-collection/mit-algorithm-courses/mit-6.006/shortest-paths.md)
- [Dynamic Programming](/wiki/courses-collection/courses-collection/mit-algorithm-courses/mit-6.006/dynamic-programming.md)
- [Advanced](/wiki/courses-collection/courses-collection/mit-algorithm-courses/mit-6.006/advanced.md)
- [MIT 6.046J](/wiki/courses-collection/courses-collection/mit-algorithm-courses/mit-6.046j.md): Design and Analysis of Algorithms
- [Divide and conquer](/wiki/courses-collection/courses-collection/mit-algorithm-courses/mit-6.046j/divide-and-conquer.md)
- [Dynamic programming](/wiki/courses-collection/courses-collection/mit-algorithm-courses/mit-6.046j/dynamic-programming.md)
- [Greedy algorithms](/wiki/courses-collection/courses-collection/mit-algorithm-courses/mit-6.046j/greedy-algorithms.md)
- [Graph algorithms](/wiki/courses-collection/courses-collection/mit-algorithm-courses/mit-6.046j/graph-algorithms.md)
