演算法›Ch4 圖論演算法
第 42 題/共 111 題
◀ AL 42/111
42. DAG、Critical Path、Combinational Logic
#AL-04-042中DAGCritical PathCombinational Logic
  1. Consider the same logic network as in Question 10 (4-bit ripple carry adder gate-level network). Among all of the possible paths (from any input, to any output), the one passing through the largest number of gates (vertices) is defined as the critical path. In this particular logic network, how many gates does the critical path pass through?
題目附圖
📄 交大115
跳轉到第題
▤完整推導請見《WH 資工筆記 · 演算法》Ch4 圖論演算法
本章題號 · 41–60 / 111