Summaries
Ready-made academic summaries
Computer Science(14)
Data Structures
Trees & Heaps — Data Structures
Trees & Heaps — Data Structures
Binary trees, heaps, and hierarchical data processing
Systems Programming in C
Lecture 2 — Systems Programming in C
Lecture 2 — Systems Programming in C
Core concepts in systems programming, memory and processes
Operating Systems
Linux Commands
Linux Commands
Essential Linux commands guide for daily use
Data Structures
Exercise 2 — Amortized Analysis & Binary Heaps | Data Structures
Exercise 2 — Amortized Analysis & Binary Heaps | Data Structures
Amortized analysis, binary heaps and heap operations
Data Structures
Lecture 1 — Introduction: Algorithms, Data Structures & ADT | Data Structures
Lecture 1 — Introduction: Algorithms, Data Structures & ADT | Data Structures
Insertion Sort, ADT, Sequence/Stack/Queue/Deque, linked lists, dynamic array
Data Structures
Lecture 2 — Priority Queue, Trees & Heaps | Data Structures
Lecture 2 — Priority Queue, Trees & Heaps | Data Structures
Binary trees, min/max heaps, Heapify, BuildHeap
Data Structures
Lecture 3 — Priority Queue (Heap) Complexity Analysis | Data Structures
Lecture 3 — Priority Queue (Heap) Complexity Analysis | Data Structures
Heap operations complexity, linear-time BuildHeap, HeapSort
Data Structures
Recitation 3 — Asymptotic Analysis & Recurrence | Data Structures
Recitation 3 — Asymptotic Analysis & Recurrence | Data Structures
Recitation: asymptotic O/Ω/Θ, recurrence relations, Master Theorem
Data Structures
Lecture 4 — Sorting: HeapSort, MergeSort, QuickSort | Data Structures
Lecture 4 — Sorting: HeapSort, MergeSort, QuickSort | Data Structures
Comparison-based sorting algorithms: HeapSort, MergeSort, QuickSort
Data Structures
Recitation 4 — Comparison-Based Sorting Algorithms | Data Structures
Recitation 4 — Comparison-Based Sorting Algorithms | Data Structures
Recitation: analysis of comparison sorts, stability, in-place
Data Structures
Lecture 5 — QuickSort & Lower Bounds | Data Structures
Lecture 5 — QuickSort & Lower Bounds | Data Structures
QuickSort: randomized version, analysis, Ω(n log n) lower bound for comparison sorting
Data Structures
Recitation 5 — QuickSort & Lower Bounds | Data Structures
Recitation 5 — QuickSort & Lower Bounds | Data Structures
Recitation: randomized QuickSort analysis, decision tree, lower bounds
Data Structures
Lecture 6 — Linear-time Sorting & Order Statistics | Data Structures
Lecture 6 — Linear-time Sorting & Order Statistics | Data Structures
Counting Sort, Radix Sort, Bucket Sort, linear-time Selection (Median)
Data Structures
Recitation 6 — Linear-time Sorting | Data Structures
Recitation 6 — Linear-time Sorting | Data Structures
Recitation: linear-time sorting, Counting/Radix/Bucket, linear-time selection
Mathematics(17)
Linear Algebra 2
Lecture 1 — Linear Transformations | Linear Algebra 2
Lecture 1 — Linear Transformations | Linear Algebra 2
Linear transformations, properties and matrix representation
Logic & Set Theory
Lecture 2 — Comparing Sets | Logic & Set Theory
Lecture 2 — Comparing Sets | Logic & Set Theory
Comparing sets, cardinalities and fundamental theorems
Linear Algebra 2
Lecture 2 — Existence & Uniqueness, Dimension Theorem | Linear Algebra 2
Lecture 2 — Existence & Uniqueness, Dimension Theorem | Linear Algebra 2
Existence and uniqueness theorem, dimension theorem and applications
Linear Algebra 1
Summary — Linear Algebra 1
Summary — Linear Algebra 1
Comprehensive summary of Linear Algebra 1 material
Linear Algebra 1
Dimensions — Linear Algebra 1
Dimensions — Linear Algebra 1
Dimensions, bases and linear spaces
Calculus 1
Critical Theorems for Exam B — Calculus 1
Critical Theorems for Exam B — Calculus 1
Essential theorems for Exam B preparation
Calculus 1
Functions Summary + Counterexamples — Calculus 1
Functions Summary + Counterexamples — Calculus 1
Functions, continuity, limits and counterexamples
Linear Algebra 1
Linear Algebra 1 Summary by Topics
Linear Algebra 1 Summary by Topics
Organized by topics — matrices, determinants, spaces
Logic & Set Theory
Lecture 2 — Comparing Sets | Logic & Set Theory
Lecture 2 — Comparing Sets | Logic & Set Theory
Cardinalities, comparing sets, injective and surjective functions
Logic & Set Theory
Lecture 3 — Countable Sets | Logic & Set Theory
Lecture 3 — Countable Sets | Logic & Set Theory
Countable sets, ℵ₀, closure under union and Cartesian product
Logic & Set Theory
Recitation 3 — Countable Sets & Operations | Logic & Set Theory
Recitation 3 — Countable Sets & Operations | Logic & Set Theory
Recitation: closure of countable sets under union, product, composition
Logic & Set Theory
Lecture 4 — Uncountable Sets | Logic & Set Theory
Lecture 4 — Uncountable Sets | Logic & Set Theory
Cantor diagonal, P(ℕ) uncountable, continuum, CH
Logic & Set Theory
Recitation 4 — Uncountable Sets | Logic & Set Theory
Recitation 4 — Uncountable Sets | Logic & Set Theory
Recitation: continuum cardinalities, P(S), complex cardinality calculations
Logic & Set Theory
Lecture 5 — Cardinal Arithmetic & Cantor-Schröder-Bernstein | Logic & Set Theory
Lecture 5 — Cardinal Arithmetic & Cantor-Schröder-Bernstein | Logic & Set Theory
Cardinal arithmetic: addition, multiplication, exponentiation; CSB theorem proof
Logic & Set Theory
Recitation 5 — Cardinal Arithmetic | Logic & Set Theory
Recitation 5 — Cardinal Arithmetic | Logic & Set Theory
Recitation: cardinal exponent laws, β^α=2^α, convergent sequences, bijections ℤ↔ℤ
Logic & Set Theory
Lecture 6 — Propositional Logic: Syntax & Semantics | Logic & Set Theory
Lecture 6 — Propositional Logic: Syntax & Semantics | Logic & Set Theory
Formal logic, syntax vs semantics, wff, structural induction, deduction theorem
Logic & Set Theory
Recitation 6 — Propositional Calculus: Syntax & Semantics | Logic & Set Theory
Recitation 6 — Propositional Calculus: Syntax & Semantics | Logic & Set Theory
Recitation: parsing trees, rank, truth tables for entailment, proof by cases
Need a summary for your course?
Create Summary