Statistical Measures and Distribution Analysis Notes for XAT: Concepts, Formulas, Worked Examples & Practice

    Statistical Measures and Distribution Analysis notes for XAT: 36 study cards covering concepts, formulas, shortcuts and exam traps, plus solved practice questions.

    Box Plots and Hinge Analysis

    Box Plots and Hinge Analysis

    Visualize the spread, center, and outliers of any dataset in a single glance.

    What you will learn here

    • Construct and interpret box plots for quick data comparison.
    • Master the XAT-specific definition of hinges to avoid calculation traps.
    • Calculate the five-number summary flawlessly for any dataset.
    • Identify skewness and spread directly from the shape of the box.

    Chapter: Statistical Measures and Distribution Analysis

    The Anatomy of a Box Plot

    The Anatomy of a Box Plot

    A box plot is a standardized way of displaying a dataset based on a five-number summary. It provides a visual snapshot of the data's center, spread, and range.

    Min Lower Hinge Median Upper Hinge Max

    The Box: Represents the middle 50 percent of the data, stretching from the lower hinge to the upper hinge.

    The Median Line: A vertical line inside the box marking the exact center of the dataset.

    The Whiskers: Lines extending from the box to the minimum and maximum values, showing the full range.

    The Five-Number Summary

    The Five-Number Summary

    Every box plot is built on five critical values, arranged in ascending order.

    1
    Minimum — The smallest value in the dataset.
    2
    Lower Hinge — The median of the lower half of the data.
    3
    Median — The exact middle value of the entire dataset.
    4
    Upper Hinge — The median of the upper half of the data.
    5
    Maximum — The largest value in the dataset.

    These five points divide the data into four equal quarters, each containing 25 percent of the observations.

    XAT's Specific Definition of Hinges

    XAT's Specific Definition of Hinges

    XAT uses a very specific method for hinges, often called the position-split method. It differs slightly from standard textbook quartiles.

    The Rule

    1. Sort the data in ascending order.
    2. Find the median (the middle value).
    3. Lower Hinge: The median of all values strictly to the left of the median's position.
    4. Upper Hinge: The median of all values strictly to the right of the median's position.

    Crucial Note: The median itself is excluded from both halves when finding the hinges.

    Statistical Measures and Distribution Analysis: Solved Questions with Step-by-Step Explanations (2 Problems)

    Question 1 · Quantitative Aptitude and Data Interpretation (QA & DI) NAT

    A dataset consists of distinct positive integers. When arranged in ascending order, the median is , the lower hinge is , and the upper hinge is .

    The minimum value in the dataset is and the maximum value is .

    The sum of all integers is exactly .

    What is the maximum possible value of the th integer in the ascending arrangement?

    Correct Answer:

    21

    Step-by-Step Solution

    Key idea: This is a constrained optimization problem involving the XAT-specific definition of hinges for an even-sized dataset. We must maximize a specific element by minimizing all other elements subject to the ordering and sum constraints.

    Step 1: Map the indices and hinge definitions.

    For , the sorted data is .

    • Median is the average of and . Given Median .
    • Lower Hinge is the median of the lower half . Since there are 7 elements, the median is the 4th element. Thus, .
    • Upper Hinge is the median of the upper half . The median of these 7 elements is the 4th element of this subset, which corresponds to . Thus, .
    • We are given and .

    Step 2: Set up the sum equation.

    The total sum is .

    .

    Substitute the known values:

    .

    .

    .

    Step 3: Maximize by minimizing the other variables.

    To maximize , we must minimize and .

    • Minimize : Since and , the smallest distinct integers for are and .
    • Minimize : Since , the smallest integer for is .
    • Minimize : These depend on . To minimize them, we must minimize . Since and , the minimum possible value for occurs when is maximized. However, must be strictly greater than . Let's assume is large, which forces to be large. To find the absolute minimum for , we look at the constraint . The maximum possible is , which gives .

    If , then and .

    • Minimize : Since and , the smallest distinct integers are and .

    Step 4: Calculate the maximum .

    Sum of minimized variables (excluding ):

    .

    Substitute back into the sum equation:

    .

    Step 5: Verify validity.

    If , then must be at least .

    If , then .

    Then .

    The sum of these would be , which is greater than . This would force to be smaller than 21.

    Therefore, to keep at its maximum of 21, we must use the configuration that minimizes the upper variables: , which allows .

    The sequence is strictly increasing, satisfies all hinge/median conditions, and sums to 337.

    Answer: 21

    Question 2 · Quantitative Aptitude and Data Interpretation (QA & DI) MCQ

    If the run rate at the end of the 4th over is 8, what is the minimum possible run rate at the end of the 5th over, given that runs scored in any over must be non-negative?

    1. A.

      0

    2. B.

      6.4

    3. C.

      8

    4. D.

      10

    Correct Answer:

    B

    Step-by-Step Solution

    Key idea: This is a boundary case question, recognizable because it applies a physical constraint (non-negative runs) to find the minimum possible future run rate.

    Step 1: Calculate the total runs after 4 overs. .

    Step 2: Apply the non-negative constraint. The minimum runs that can be scored in the 5th over is 0.

    Step 3: Calculate the minimum total runs after 5 overs. .

    Step 4: Calculate the minimum run rate after 5 overs. .

    Answer: 6.4

    More notes in this unit

    chapter
    Statistical Measures and Distribution Analysis Notes for XAT: Concepts, Formulas, Worked Examples & Practice

    Statistical Measures and Distribution Analysis notes for XAT: 36 study cards covering concepts, formulas, shortcuts and exam traps, plus solved practice quest

    A question from this chapter

    Question 1

    A dataset consists of distinct positive integers. When arranged in ascending order, the median is , the lower hinge is , and the upper hinge is .

    The minimum value in the dataset is and the maximum value is .

    The sum of all integers is exactly .

    What is the maximum possible value of the th integer in the ascending arrangement?

    Question 2

    If the run rate at the end of the 4th over is 8, what is the minimum possible run rate at the end of the 5th over, given that runs scored in any over must be non-negative?

    Free preview ends here

    Login to view the complete 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.