OS lab1 Posted on 2021-10-20 Edited on 2026-08-14 In Computer Science Outline: 汇编问答 调用约束 汇编避坑 NASM tutorial NASM教程 Read more »
OS Basic Posted on 2021-10-05 Edited on 2026-08-14 In Computer Science My understanding of OS Read more »
Application Layer Posted on 2021-09-20 Edited on 2026-08-14 In Computer Science Outline: DNS P2P 文件传送协议 TELNET 万维网 Email DHCP Read more »
L13 Undirected Graph Posted on 2021-08-23 Edited on 2026-08-14 In Computer Science Outline: UAG的DFS树 UAG的DFS框架 UAG的DFS应用 容错连通 寻找割点 寻找桥 Ref: 算法设计与分析(Algorithm design and analysis) by 黄宇 Read more »
L22 BFS and DFS Posted on 2021-08-23 Edited on 2026-08-14 In Computer Science Outline: BFS skeleton 证明: \(v.dis = \delta(s,v)\) BFS树 应用 DFS s → all Ref: 算法设计与分析(Algorithm design and analysis) by 黄宇 Read more »
L21 Balancing Posted on 2021-08-21 Edited on 2026-08-14 In Computer Science Outline: 找前k大元素 找离medium最近的k个元素 Weighted medium 找unique Ref: 算法设计与分析(Algorithm design and analysis) by 黄宇 Read more »
L24 NPC Posted on 2021-08-17 Edited on 2026-08-14 In Computer Science Outline: NPC = P ? NPC判定问题 规约: 等价 Ref: 算法设计与分析(Algorithm design and analysis) by 黄宇 Read more »
L16 图优化 Posted on 2021-08-13 Edited on 2026-08-14 In Computer Science Outline: BestFS MCE Ref: 算法设计与分析(Algorithm design and analysis) by 黄宇 Read more »
L19&L20 NP Posted on 2021-08-12 Edited on 2026-08-14 In Computer Science Outline: Decision Problem The class P The class NP Reduction between problems NP-Complete Problems Other advanced topics Ref: 算法设计与分析(Algorithm design and analysis) by 黄宇 Read more »
L17&L18 DP Posted on 2021-08-11 Edited on 2026-08-14 In Computer Science Outline: Basic Idea of Dynamic Programming(DP) Smart scheduling of subproblems Minimum Cost Matrix Multiplication BF1, BF2 A DP solution Weighted Binary Search Tree The "same" DP with matrix multiplication From the DP perspective All-pairs shortest paths SSSP over DAG More DP problems Edit distance Highway restaurants; Separating Sequence of words Changing coins Elements of DP Ref: 算法设计与分析(Algorithm design and analysis) by 黄宇 Read more »