← 回題庫

卷別

資料結構與演算法

選擇

國立臺灣大學 2026 · 考試 · 第 7 題

考科演算法

(4 points) A company needs to assign 3 workers to 3 tasks. Each worker can perform only the tasks listed below:

  • Worker W1W_1: Tasks T1,T2T_1, T_2
  • Worker W2W_2: Task T1T_1
  • Worker W3W_3: Tasks T2,T3T_2, T_3

Each worker can be assigned to at most one task, and each task to at most one worker. Which of the following statements is true?

  • (A)
    The maximum matching has size 2.
  • (B)
    The maximum matching has size 1.
  • (C)
    No matching exists.
  • (D)
    There exist exactly two distinct maximum matchings.
  • (E)
    There exists a perfect matching.

標準解析

AI 已複查