Skip to content
跨考資工所筆記
Dynamic programming
Search
Gitlab
首頁
Algorithms
Computer architecture
Data structures
Discrete mathematics
Linear algebra
Operating systems
Other stuff
跨考資工所筆記
Gitlab
首頁
Algorithms
Algorithms
Complexity analysis
Complexity analysis
Amortized analysis
Asymptotic notations
The Master Theorem
Recursion tree
Subsitution method
Useful theorems
Divide and conquer
Divide and conquer
Divide and Conquer
The Maximum Subarray Problem
Dynamic programming
Dynamic programming
Dynamic programming
Graph
Graph
Graph
Computer architecture
Computer architecture
Arithemetic Logic Unit (ALU)
AMAT
CPI
CPU Cache
ECC
Exceptions
IEEE 754 floating point numbers
Memory Hierachy
Performance
Pipeline hazards
Pipeline
RISCV
Single cycle CPU
Virtual memory
Data structures
Data structures
Graph
Graph
Bfs
Dfs
Dijkstra
Disjoint set
Floyd cycle detect
Floyd warshall
Graph
Mst algorithms
Topological sorting
Hashing
Hashing
Hashing
List like
List like
Array
Linked list
Queue
Stack
Sorting
Sorting
External sort
Sorting
Tree
Tree
Avl tree
B tree
Desicion tree
Heap
Red black tree
Tree
Discrete mathematics
Discrete mathematics
Stirling numbers
Combination theory
Combination theory
Binomial theorem
Combinations
Inclusion exclusion
Permutations
Graph
Graph
Graph homeomorphism
Graph isomorphism
Graph
Planar graph
Number theory
Number theory
Chinese remainder theorem
Congruence
Euler totient function
Fermat little theorem
Fundamental theorem of arithemetics
Multiplicative function
Willson theorem
Relations
Relations
Equivalence relations
Hasse diagram
Ordering
Sequences
Sequences
Generating functions
Recurrence relations
Set theory
Set theory
Definitions
Good-to-know Stuff
Mathematical induction
Linear algebra
Linear algebra
Block matrices multiplication
Cayley hamilton
Change of basis
Determinant
Diagonalization
Eigenvalue calculations
Gram Schmidt
Important subspaces
Inner products
Jordan normal forms
Least squares
Linear differential equations
Linear equations
Linear Maps
Markov chain
Decompositions
Matrix exponentiation
Invertible matrices
Projection matrices
Pseudo inverse
Quadratic forms
The Rank Nullity Theorem
Rref
Spectral theorem
Steady states
Subspaces
Singular Value Decoposition
Symmetric matrices
Vector properties
Vector spaces
Numerical methods
Numerical methods
Gaussian
Jacobi gauss seidel
Power iteration
Operating systems
Operating systems
Overview
Historical view
Historical view
Distributed systems
Handheld/Embedded systems
History of os
Mainframe systems
Multimedia system
Parallel systems
Real-Time Operation Systems
Introduction
Introduction
Caching
Hardware protection
Interrupt
Storage device Hierarchy
What is an Operating system
Memory management
Memory management
Address Binding
Loading and Linking
Contiguous memory allocation
Memory managment calculations
Page Table Memory Structure
Page and frames
Segmentation
Swapping
Os structure
Os structure
Applications OS interface
OS services
System structure
Processes
Processes
Interprocess Communication IPC
Process Scheduling
Process
Virtual memory
Virtual memory
Demand Paging
Examples
Allocation of Frames
Page Replacement
Thrashing
Virtual memory
Other stuff
Other stuff
Schedule
What is missing
首頁
Algorithms
Dynamic programming
Dynamic programming
¶
Dynamic programming (DP)
在divide and conquer的naive implementation中，常常
Back to top