CAT 2025 Slot 3 Answer Key DILR: Download Question Paper with Answer Key PDF

Chanpreet Kaur's profile photo

Chanpreet Kaur

Content Writer | MBA Professional | Updated on - Dec 1, 2025

CAT 2025 Slot 3 DILR Answer Key is available here for free download. CAT 2025 Slot 3 paper is scheduled for November 30 from 4.30 PM to 6.30 PM. CAT 2025 Slot 3 Answer Key DILR has answers to 22 questions. CAT 2025 Slot 3 DILR Answer Key helps candidates to check their correct answers and predict CAT percentile.

Latest Updates

CAT 2025 Slot 3 DILR Answer Key PDF (Memory Based)

CAT 2025 Slot 3 DILR Answer Key PDF
Question Paper PDF Check Answer Key
CAT 2025 Slot 3 DILR Answer Key PDF

Question 1:

Six employees A, B, C, D, E, F are to be assigned to three projects (P1, P2, P3), each with exactly two employees, under the following constraints:

A and D cannot be together;
B must be with C or F;
E must be in a project different from C;
F cannot be in P1.

How many valid assignments are possible?

  • (A) 8
  • (B) 10
  • (C) 12
  • (D) 14

Question 2:

Eight people P, Q, R, S, T, U, V, W are seated in two rows of four each.

Rules:
1. P sits directly in front of R.
2. Q is somewhere to the right of P (same row).
3. T and S cannot be in the same row.
4. W must be in the front row.
5. U must sit immediately left of V (same row).

How many seating arrangements are possible?

  • (A) 12
  • (B) 16
  • (C) 18
  • (D) 20

Question 3:

Four companies C1, C2, C3, C4 must interview candidates P, Q, R, S over four time slots (T1--T4).
Each candidate gets one unique slot and each company interviews exactly one candidate per slot.

Constraints:
1. P cannot be interviewed by C1 or C3.
2. Q must be interviewed in either T1 or T4.
3. R must be interviewed before S.
4. C4 only interviews in T2 or T3.
5. No company interviews the same candidate as last year:
(C1--P), (C2--Q), (C3--R), (C4--S).

How many valid interview schedules are possible?

  • (A) 6
  • (B) 8
  • (C) 10
  • (D) 12

Question 4:

In a survey of 250 people about three activities (Reading, Sports, Travel), the following data are given:
 

  • 130 like Reading,
  • 110 like Sports,
  • 120 like Travel,
  • 55 like both Reading and Sports,
  • 50 like both Sports and Travel,
  • 45 like both Reading and Travel,
  • 25 like all three.


How many like only Travel?

  • (A) 35
  • (B) 40
  • (C) 45
  • (D) 50

Question 5:

Five lectures L1, L2, L3, L4, L5 must be scheduled from Monday to Friday (one each day).

Five professors A, B, C, D, E will take one lecture each.
Constraints:
1. A takes L3.
2. L2 must be scheduled after L5.
3. C does not teach on Wednesday or Friday.
4. D teaches before E.
5. B does not teach L4.

How many valid schedules are possible?

  • (A) 12
  • (B) 15
  • (C) 18
  • (D) 20

Question 6:

A delivery driver must travel from Source (S) to Destination (D).

Possible paths:
S → A → C → D,
S → B → C → D,
S → A → E → D,
S → B → F → D.

Rules:
1. A route cannot repeat a node.
2. A route cannot have more than 3 edges.
3. C cannot be visited if E is visited.
4. B cannot be used if F is used.

How many valid routes exist from S to D?

  • (A) 3
  • (B) 4
  • (C) 5
  • (D) 6

Question 7:

Four teams T1, T2, T3, T4 play a tournament where each team plays exactly two matches.

Rules:
1. No match ends in a draw.
2. T1 defeats T3.
3. T4 plays exactly one match before it plays T2.
4. T2 wins exactly one match.
5. T3 does not defeat T4.
6. Total matches = 4.

How many valid sequences of wins/losses across all matches are possible?

  • (A) 6
  • (B) 8
  • (C) 10
  • (D) 12

How to Raise Objections Against the Answer Key

If you find any errors in the provisional answer key:

  1. Log in to iimcat.ac.in during the objection window
  2. Navigate to the "Objection Management" section
  3. Select the question you want to challenge
  4. Provide proper justification with supporting documents
  5. Pay the objection fee (approximately Rs. 1,200 per question)
  6. Submit before the deadline

Important Points:

  • Objections submitted via email or other channels will not be entertained
  • If your objection is valid, the fee may be refunded
  • Final decision rests with IIM Kozhikode

Check:

CAT Questions

  • 1.
    A, B, C, D, E, and F are seated around a circular table facing the center.
    B sits third to the left of A.
    Only one person sits between C and D.
    E is not a neighbor of A or C.
    F sits immediately to the right of D.
    How many distinct seating arrangements satisfy all conditions?


      • 2.
        Six employees — A, B, C, D, E, F — each specialize in exactly one of three skills: Data, Design, or Marketing (two per skill).
        1. A and D do not share a skill.
        2. B’s skill is the same as either E or F (but not both).
        3. C is not in Marketing.
        How many valid assignments of skills are possible?


          • 3.
            A delivery driver must travel from Source (S) to Destination (D).
            Possible paths:
            S → A → C → D,
            S → B → C → D,
            S → A → E → D,
            S → B → F → D.
            Rules:
            1. A route cannot repeat a node.
            2. A route cannot have more than 3 edges.
            3. C cannot be visited if E is visited.
            4. B cannot be used if F is used.
            How many valid routes exist from S to D?

              • 3
              • 4
              • 5
              • 6

            • 4.
              A delivery network allows routes from Start (S) to End (E) through intermediate hubs A, B, C.
              Allowed edges:
              S→A, S→B, A→C, A→E, B→C, C→E.
              A route cannot visit more than 3 nodes including S and E.
              How many valid routes from S to E are possible?


                • 5.
                  Four teams T1, T2, T3, T4 play a tournament where each team plays exactly two matches.
                  Rules:
                  1. No match ends in a draw.
                  2. T1 defeats T3.
                  3. T4 plays exactly one match before it plays T2.
                  4. T2 wins exactly one match.
                  5. T3 does not defeat T4.
                  6. Total matches = 4.
                  How many valid sequences of wins/losses across all matches are possible?

                    • 6
                    • 8
                    • 10
                    • 12

                  • 6.
                    Four companies C1, C2, C3, C4 must interview candidates P, Q, R, S over four time slots (T1--T4).
                    Each candidate gets one unique slot and each company interviews exactly one candidate per slot.
                    Constraints:
                    1. P cannot be interviewed by C1 or C3.
                    2. Q must be interviewed in either T1 or T4.
                    3. R must be interviewed before S.
                    4. C4 only interviews in T2 or T3.
                    5. No company interviews the same candidate as last year:
                    (C1--P), (C2--Q), (C3--R), (C4--S).
                    How many valid interview schedules are possible?

                      • 6
                      • 8
                      • 10
                      • 12

                    Fees Structure

                    Structure based on different categories

                    CategoriesState
                    General2400
                    sc1200
                    pwd1200

                    In case of any inaccuracy, Notify Us! 

                    Comments


                    No Comments To Show