Sets, Venn Diagrams and Functions Short Notes for CAT: Concepts, Formulas, Worked Examples & Practice

    Sets, Venn Diagrams and Functions short notes for CAT: 29 study cards covering concepts, formulas, shortcuts and exam traps, plus solved practice questions.

    Why Venn Diagrams Exist

    A Venn diagram is a “count once” machine

    When groups overlap, a person can belong to more than one group. Venn diagrams split the universe into non-overlapping regions.

    A B A only Both B only Neither
    The goal is not drawing circles beautifully. The goal is counting every person exactly once.

    Two-Set Inclusion-Exclusion

    The first overlap formula

    When two groups overlap, adding their totals counts the common part twice.

    At least one:
    Both:
    Neither: total universe minus

    Two-Set Max-Min Overlap

    How small or large can “both” be?

    For two sets and inside a universe of size :

    Minimum overlap

    Forced overlap when totals exceed the universe.

    Maximum overlap

    The smaller set can fit inside the larger one.

    CAT often hides this inside percentages or gender-wise data.

    PYQ: Swimming and Running with Boys and Girls

    CAT PYQ PATTERN

    Minimum and maximum students who chose both

    Let girls be . Then boys are .
    Girls are between and of , so .
    Swimming:
    Running:
    Since every student chose swimming or running or both:
    For all percentage counts to be integers, can be .
    Therefore both ranges from:
    Answer: minimum , maximum .

    Sets, Venn Diagrams and Functions: Solved Questions with Step-by-Step Explanations (2 Problems)

    Question 1 · Quantitative Ability MCQ

    In a class of students, every student likes at least one of four sports: A, B, C, and D. like A, like B, like C, and like D. What is the difference between the maximum and minimum possible number of students who like EXACTLY three of these sports?

    1. A.

      70

    2. B.

      50

    3. C.

      60

    4. D.

      80

    Correct Answer:

    A

    Step-by-Step Solution

    Key idea: This is a "multi-set range" question. The signal is four overlapping sets with high totals, asking for the range of an "exactly k" region.

    Step 1: Set up the core equations.

    Let be the number of students in exactly sets. Since everyone likes at least one, .

    Total students: . (Eq 1)

    Sum of sets: .

    . (Eq 2)

    Step 2: Find the maximum .

    Subtract (Eq 1) from Eq 2:

    .

    Substitute into Eq 1:

    .

    To maximize , minimize and . Let .

    Max . (This is valid as , and individual sets can be formed).

    Step 3: Find the minimum .

    From , we minimize by maximizing .

    Notice that represents the total number of "missing" elements (complements) if .

    The complements of the sets are: .

    Total missing elements = .

    Each student in misses 3 sets. Each in misses 2 sets.

    So, .

    Substitute this back into the equation:

    .

    Min . (This is valid as we can distribute the 70 missing elements using only 2s and 3s).

    Step 4: Calculate the difference.

    Max - Min .

    Answer: 70.

    Question 2 · Quantitative Ability MCQ

    In a class of students, exactly students like none of three genres: Fiction, Non-fiction and Poetry. students like Fiction, like Non-fiction and like Poetry. What is the difference between the maximum and the minimum possible number of students who like all three genres?

    1. A.

      45

    2. B.

      47

    3. C.

      48

    4. D.

      55

    Correct Answer:

    B

    Step-by-Step Solution

    Key idea: this is a three-set max-min question with a FIXED union, recognisable because the number who like none is pinned at exactly 5, so the union is exactly 95 rather than flexible.

    Step 1: Write the region equations. Let be the counts of students in exactly one, exactly two and all three genres. The union is , so .

    Step 2: Add the set sizes. Each exactly-two student is counted twice and each all-three student thrice, so .

    Step 3: Subtract the first equation from the second: .

    Step 4: Maximise . Since , , so , giving (integer). Construction: , ; put the single exactly-two person in Fiction-Poetry, then Fiction-only , Non-fiction-only , Poetry-only , which sums to . Valid.

    Step 5: Minimise . Try : then and . Solve the pair splits against the set sizes: , ... checking: Fiction needs , Non-fiction , Poetry ; solving gives , , , all non-negative. Valid, so .

    Step 6: Difference .

    Answer: B.

    Common trap: taking the maximum as the smallest set (). That bound only applies when the union can stretch to absorb it; here the union is fixed at , and the surplus equation caps at .

    More short notes in this unit

    chapter
    Sets, Venn Diagrams and Functions Short Notes for CAT: Concepts, Formulas, Worked Examples & Practice

    Sets, Venn Diagrams and Functions short notes for CAT: 29 study cards covering concepts, formulas, shortcuts and exam traps, plus solved practice questions.

    A question from this chapter

    Question 1

    In a class of students, every student likes at least one of four sports: A, B, C, and D. like A, like B, like C, and like D. What is the difference between the maximum and minimum possible number of students who like EXACTLY three of these sports?

    Question 2

    In a class of students, exactly students like none of three genres: Fiction, Non-fiction and Poetry. students like Fiction, like Non-fiction and like Poetry. What is the difference between the maximum and the minimum possible number of students who like all three genres?

    Free preview ends here

    Login to view the complete short notes

    Creating an account is free. You get the rest of this chapter, step-by-step solutions, and a study plan built around the topics you are actually weak at.

    Why MastersUp

    Personalised first. High quality throughout.

    Most platforms hand everyone the same content. Here the content moves with your performance, topic by topic.

    Built around you, not around a syllabus PDF

    Every answer you give moves your topic-level intelligence rate. The next question, the next revision card and tomorrow's plan all change with it.

    Revision that hits your weak spots

    We only revise topics you have actually attempted and are still below the safe bar on — never the same chapter on repeat.

    Questions calibrated to the real exam

    Each question carries a measured toughness. You are served a rung above your current level, so practice keeps stretching you.

    Notes written for recall, not for volume

    Full lesson cards for first study, curated short-note cards for the last mile — with derivations, traps and exam patterns marked.

    One place for everything

    Notes, chapter practice, previous-year questions, test series and full-length papers — all feeding one picture of your preparation.

    Honest progress

    No vanity streaks. Progress here means chapters mastered and accuracy that held up on harder questions.

    Unlock the whole course

    Full notes and short notes, the complete question bank with worked solutions, mock tests, full-length papers, and an adaptive plan that rebuilds itself as you improve.