Consider the following List-I and List-II in context of graph & model.
| LIST-I | LIST-II |
|---|---|
| A. Planar Graph | I. Probabilistic Model |
| B. Bipartite Graph | II. Deterministic Model |
| C. PERT | III. 4 - Colorable |
| D. CPM (Critical Path Method) | IV. 2 - Colorable |
Pick an option to check yourself, or open the answer below.
Show answer & explanation
Correct answer: A. A-III, B-IV, C-I, D-II
Explanation
By the Four Colour Theorem, every planar graph is 4-colorable, so A matches III. A graph is bipartite if and only if it is 2-colorable, so B matches IV. PERT (Program Evaluation and Review Technique) relies on probabilistic time estimates for activities, matching I, while CPM (Critical Path Method) uses deterministic activity durations, matching II. This gives the mapping A-III, B-IV, C-I, D-II.More Discrete Structures and Optimisation questions
- The number of vertices of odd degree in any graph of 'n' vertices with 'e' edges is :
- Let R = {(1, 2), (3, 4), (2, 2)} and S = {(4, 2), (2, 5), (3, 1), (1, 3)} be two relations. The composite relation R∘S of R and S is :
- Out of 32 people, 30 save paper and 14 people save plastic bottles. What is the total number of people who save both paper and plastic bott…
- Consider a linear program {max cᵀx | Ax ≤ b}. Which of the following statements is true?
- In a pack of 42 cards, 3 cards are chosen one after the other. Find the number of ways this can be done without replacement:
- A positive integer is selected at random from the set of positive integers not exceeding 200. What is the probability that the selected num…