Match List I with List II List I List II A. Planer Graph I. Probabilistic…
2022
Match List I with List II
List I List II A. Planer Graph I. Probabilistic Model B. Bipartite Graph II. Deterministic Model C. PERT III. 4-Colorable D. CPM IV. 2-ColorableChoose the correct answer from the options given below:
- A.
A-IV; B-III; C-I; D-II
- B.
A-III; B-IV; C-II; D-I
- C.
A-II; B-IV; C-I; D-III
- D.
A-III; B-IV; C-I; D-II
Attempted by 20 students.
Show answer & explanation
Correct answer: D
Correct matching: Planar Graph → 4-Colorable; Bipartite Graph → 2-Colorable; PERT → Probabilistic Model; CPM → Deterministic Model.
Planar Graph → 4-Colorable: By the Four Color Theorem, every planar graph can be colored with at most four colors, so it is 4-colorable.
Bipartite Graph → 2-Colorable: Bipartite graphs have no odd cycles, which allows a 2-coloring of vertices (one color per partition).
PERT → Probabilistic Model: Program Evaluation Review Technique uses probabilistic time estimates (optimistic, most likely, pessimistic) and computes expected durations.
CPM → Deterministic Model: The Critical Path Method uses single (deterministic) time estimates for activities to compute the project schedule.