• S
    SwaseekhGATE Preparation
General
  • Dashboard
  • Syllabus
  • Questions
  • Aptitude
  • Mock Tests
  • TCS NQT 2026
Account
  • Pricing
  • Contact
  1. GATE CS
  2. PYQs
  3. Discrete Mathematics

Let P be the partial order defined on the set {1, 2, 3, 4} as follows. P = {(a, b) | a, b ∈ {1, 2, 3, 4}} with relations: (1,1), (2,2), (3,3), (4,4), (1,3), (2,3), (2,4). The number of total orders on {1, 2, 3, 4} that contain P is __________.

GATE 2024 · Discrete Mathematics · Partial Order · medium

Answer: 5

  1. Identify cover relations and minimal elements: P has cover relations 1→3, 2→3, 2→4. Minimal elements (no predecessors): {1, 2}. Element 3 needs both 1 and 2 to be placed first. Element 4 needs 2 to be placed first.
  2. Branch on the first element and count: Case A — Start with 1: next minimal is {2}, must place 2 second. Then {3,4} are both free: 2 sub-cases (3,4) and (4,3). Gives extensions: 1,2,3,4 and 1,2,4,3. Case B — Start with 2: next minimal is {1, 4}. Sub-case B1: place 1 next, then {3,4} both free: 2,1,3,4 and 2,1,4,3. Sub-case B2: place 4 next, then {1} is only choice, then 3 last: 2,4,1,3. Total = 2 + 3 = 5.