PYQ Quiz Consolidation

Quiz 1

This is a comprehensive breakdown for Mathematics for Data Science I (Maths 1) based on the IIT Madras BS Degree Qualifier/Foundation level.

I have analyzed the Qualifier Exam Paper (26 Oct 2025) provided in your screenshots and the official syllabus.

Here is your layered, nuanced, “Dawg-tier” preparation guide.

---

Maths Part 1: Detailed Exam Solutions (Paper Analysis)

Context: This paper is a “Qualifier Level” exam. Pattern Analysis: Qualifier exams in this program are heavily biased towards Weeks 1-4 (Sets, Relations, Coordinate Geometry, Quadratics, and Polynomials). You will rarely see heavy Calculus (Weeks 7-12) in the Qualifier, though it appears in the Final End Term.

Question 4 (Paper Page 4): Quadratics & Intersection

The Question: Consider $y_1=x^2-4x+1$ and $y_2=x^2-6x-3$. A quadratic function $f(x)=a{x}^2+bx+c$ has its vertex at the intersection of $y_1$ and $y_2$. Its y-intercept is 2. Axis of symmetry is parallel to y-axis. Find $f(x)$.

Nuanced Solution:

1. Find the Intersection: Set $y_1=y_2$. $x^2-4x+1=x^2-6x-3$ $-4x+6x=-3-1$ $2x=-4\Rightarrow \mathbf{x}=-2$
2. Find the y-coordinate of intersection: Plug $x=-2$ into either equation. $y=(-2{)}^2-4(-2)+1=4+8+1=13$ Vertex (h, k) = (-2, 13).
3. Use Vertex Form: Since the axis is parallel to the y-axis, it’s a standard vertical parabola: $f(x)=a(x-h{)}^2+k$ $f(x)=a(x-(-2){)}^2+13$ $f(x)=a(x+2{)}^2+13$
4. Find ‘a’ using the y-intercept: We are told y-intercept is 2. This means $f(0)=2$. $2=a(0+2{)}^2+13$ $2=4a+13$ $-11=4a\Rightarrow \mathbf{a}=\frac{-11}{4}$
5. Final Equation: $y=\frac{-11}{4}(x+2{)}^2+13$

Correct Option: Corresponds to Option 6406535107144 (matches the math above).

---

Question 4 (Second Instance, Page 4): Polynomial Intersections

The Question: $r_1(x)=0.02(x-5)(x-7)(x-9)(x-11)(x-13)$ $r_2(x)=0.02(x-5{)}^2(x-7)(x-9)(x-11)(x-13)$ Determine intersection points.

Nuanced Solution:

1. Intersection Logic: Intersection means $r_1(x)=r_2(x)$.
2. The Algebra: $0.02(x-5)(x-7)(x-9)(x-11)(x-13)=0.02(x-5{)}^2(x-7)(x-9)(x-11)(x-13)$ Crucial Step: Do not just cancel terms! If you divide by $(x-5)$, you lose a root. Bring everything to one side. Let $P(x)=0.02(x-7)(x-9)(x-11)(x-13)$. $Equation:(x-5)P(x)=(x-5{)}^{2}P(x)$ $(x-5)P(x)-(x-5{)}^{2}P(x)=0$ Factor out the common term $(x-5)P(x)$: $(x-5)P(x)[1-(x-5)]=0$
3. Find Roots:
   • From $(x-5)=0\Rightarrow x=5$
   • From $P(x)=0\Rightarrow x=7,9,11,13$
   • From $[1-(x-5)]=0\Rightarrow 1-x+5=0\Rightarrow x=6$
4. Result: The intersection points are at $x=5,6,7,9,11,13$. The number of intersections is 6.

Correct Option: “The number of x-intercepts of $r_1(x)$ and $r_2(x)$ are 6.” (Wait, intercepts of $r_1$ are 5,7,9,11,13 = 5 intercepts. Intercepts of $r_2$ are same. This option is false). Look for Option: “The number of intersection points… is 6.” (Option 6406535107159).

---

Question 5 (Page 5): Relations (Sets)

The Question: Set $M$ = Courses. $R=\{(A,B)|A,B\text{ are same level}\}$ $S=\{(A,B)|A\text{ is prerequisite for }B\}$

Nuanced Solution:

1. Analyze R (Same Level):
   • Reflexive: Is A same level as A? Yes.
   • Symmetric: If A is same level as B, is B same level as A? Yes.
   • Transitive: If A same level as B, and B same level as C, is A same level as C? Yes.
   • Verdict: R is an Equivalence Relation.
2. Analyze S (Prerequisite):
   • Reflexive: Is A a prereq for A? No (usually).
   • Symmetric: If A is prereq for B, is B prereq for A? Absolutely not (that’s a loop).
   • Transitive: If A prereq for B, and B prereq for C, is A prereq for C? Yes.
   • Verdict: S is Transitive, but NOT Reflexive/Symmetric. S is NOT an equivalence relation.

Correct Option: “R is an equivalence relation.” (Option 6406535107148).

---

Question 6 (Page 5): Parabola & Lines

The Question: Equation: $y-6=3(x-10{)}^2$. Identify correct statements about vertex and lines: $-5x+4y-1=0$ and $\frac{x}{4}-\frac{y}{5}=1$.

Nuanced Solution:

1. Parabola Vertex: Standard form is $y-k=a(x-h{)}^2$. Here, $h=10,k=6$. Vertex is (10, 6). (Matches Option 6406535107152).
2. Lines Analysis:
   • Line 1: $-5x+4y=1\Rightarrow 4y=5x+1\Rightarrow y=\frac{5}{4}x+\dots$ (Slope $m_1=1.25$)
   • Line 2: $\frac{x}{4}-\frac{y}{5}=1\Rightarrow \frac{y}{5}=\frac{x}{4}-1\Rightarrow y=\frac{5}{4}x-5$ (Slope $m_2=1.25$)
3. Relationship: Since $m_1=m_2$, the lines are Parallel.

Correct Options:

• Option ending in “…vertex is at (10, 6).”
• Option ending in “…are parallel to each other.”

---

Question 8 (Page 6): Quadratic Error (NAT)

The Question: Quadratic $a{x}^2+bx+c=0$. Vertex at $(3,-2)$. y-intercept at 4. $b$ was wrongly written as 5. Find absolute difference between correct sum of roots and incorrect sum of roots.

Nuanced Solution:

1. Find the Correct Equation: Vertex form: $y=a(x-3{)}^2-2$. Use y-intercept (0, 4): $4=a(0-3{)}^2-2$ $6=9a\Rightarrow a=\frac{6}{9}=\frac{2}{3}$ Expand to find correct $b$: $y=\frac{2}{3}(x^2-6x+9)-2$ $y=\frac{2}{3}{x}^2-4x+6-2$ $y=\frac{2}{3}{x}^2-4x+4$ Correct values: $a=2/3,b=-4,c=4$.
2. Sum of Roots Formula: $\text{Sum}=\frac{-b}{a}$.
3. Calculate Sums:
   • Correct Sum: $\frac{-(-4)}{2/3}=\frac{4}{2/3}=6$.
   • Incorrect Sum: The problem says $b$ was written as 5. So use $b_{wrong}=5$. Sum${}_{wrong}=\frac{-5}{2/3}=-7.5$.
4. Difference: $|\text{Correct}-\text{Incorrect}|=|6-(-7.5)|=|6+7.5|=13.5$

Answer: 13.5 (Range 13 to 14 is accepted).

---

Question 9 (Page 6): Set Theory (NAT)

The Question: 72 took Math ($M$). 85 took Stats ($S$). 30 took Both ($M\cap S$). How many took “only one of the two”?

Nuanced Solution: This is the “Symmetric Difference” of sets. Formula: $n(M\Delta S)=n(M\cup S)-n(M\cap S)$ OR $[n(M)-n(Both)]+[n(S)-n(Both)]$.

• Only Math = $72-30=42$.
• Only Stats = $85-30=55$.
• Total “Only One” = $42+55=97$.

Answer: 97.

---

Question 10 (Page 7): Cardinality of Relation Difference

The Question: $S=\{1,2,...,10\}$. $R_1=\{(x,y)|y=3x\}$ inside $S\times S$. $R_2=\{(x,y)|y=x^2\}$ inside $S\times S$. Find cardinality of $R_1\setminus R_2$ (Elements in R1 but NOT in R2).

Nuanced Solution:

1. List $R_1$ (y=3x):
   • If x=1, y=3. (1,3)
   • If x=2, y=6. (2,6)
   • If x=3, y=9. (3,9)
   • If x=4, y=12 (12 is not in S, so stop).
   • $R_1=\{(1,3),(2,6),(3,9)\}$. (Cardinality = 3).
2. List $R_2$ (y=x^2):
   • If x=1, y=1. (1,1)
   • If x=2, y=4. (2,4)
   • If x=3, y=9. (3,9)
   • $R_2=\{(1,1),(2,4),(3,9)\}$.
3. Find Difference $R_1\setminus R_2$: Look at $R_1$. Which pairs are also in $R_2$? Only (3,9) appears in both. Remove (3,9) from $R_1$. Remaining: $\{(1,3),(2,6)\}$.
4. Count: There are 2 elements left.

Answer: 2.

---

Question 13 (Page 8): Polynomials & Vertex

The Question: $p(x)=a(x-4)(x-6)(x-8)(x-10)$ passes through the vertex of $q(x)=-(x-7{)}^2-9$. Calculate $a$.

Nuanced Solution:

1. Find Vertex of q(x): $q(x)$ is in vertex form: $y=-1(x-7{)}^2-9$. Vertex $(h,k)=(7,-9)$.
2. Plug Vertex into p(x): The polynomial passes through $(7,-9)$. So, when $x=7,p(x)=-9$. $-9=a(7-4)(7-6)(7-8)(7-10)$ $-9=a(3)(1)(-1)(-3)$ $-9=a(9)$ $a=-1$

Answer: -1.

---

Part 2: Weekly Theory & Nuanced Notes (Weeks 1-12)

Since the Qualifier focuses on Weeks 1-4, study those most intensely.

Week 1: Sets, Relations & Functions

• The “Vibe”: This is the language of the course. If you don’t speak “Set”, you fail “Math”.
• Key Concepts:
  • Sets: Unions ($\cup$), Intersections ($\cap$), Differences ($\setminus$), Symmetric Difference ($\Delta$).
    • Nuance: Remember De Morgan’s Laws: $(A\cup B{)}^{\prime }=A^{\prime }\cap B^{\prime }$.
  • Relations:
    • Reflexive: $(a,a)\in R$ for all $a$. (Every loop exists).
    • Symmetric: If $(a,b)$, then $(b,a)$. (Two-way streets).
    • Transitive: If $(a,b)$ and $(b,c)$, then $(a,c)$. (Shortcuts exist).
    • Equivalence Relation: All three above. Partitions the set into disjoint clusters.
  • Functions:
    • One-to-One (Injective): Distinct inputs $\to$ Distinct outputs. (Horizontal Line Test passes).
    • Onto (Surjective): Range = Codomain.
    • Bijective: Both. (Invertible).

Week 2: Coordinate Geometry (Straight Lines)

• The “Vibe”: Visualizing algebra.
• Key Concepts:
  • Slope ($m$): Rise/Run. $\tan \theta$.
  • Parallel/Perpendicular: $m_1=m_2$ vs $m_1{m}_2=-1$.
  • Distance Formula: $\sqrt{(x_2-x_1{)}^2+(y_2-y_1{)}^2}$.
  • Section Formula: $P=\frac{m{x}_2+n{x}_1}{m+n}$. (Internal division).
  • Nuanced Tip: Always draw a rough sketch. It prevents sign errors in quadrants.

Week 3: Quadratic Functions

• The “Vibe”: The U-shape.
• Forms:
  1. Standard: $y=a{x}^2+bx+c$.
  2. Vertex: $y=a(x-h{)}^2+k$. Vertex is $(h,k)$.
  3. Intercept: $y=a(x-p)(x-q)$. Roots are $p,q$.
• Roots:
  • Sum: $\alpha +\beta =-b/a$.
  • Product: $\alpha \beta =c/a$.
  • Discriminant ($D=b^2-4ac$):
    • $D>0$: 2 real roots.
    • $D=0$: 1 real root (touching x-axis).
    • $D<0$: No real roots.

Week 4: Polynomials

• The “Vibe”: Wiggles and Ends.
• Multiplicity:
  • If factor is $(x-r{)}^k$:
  • $k$ is Odd: Graph crosses axis at $r$.
  • $k$ is Even: Graph bounces (touches) axis at $r$.
• End Behavior: Determined by the term with the highest power (Leading Coefficient Test).
  • Even degree, positive $a$: Up-Up (Like $x^2$).
  • Odd degree, positive $a$: Down-Up (Like $x^3$).

Weeks 5-6: Functions (Exponential/Log)

• Exponential: Growth/Decay. Domain $\mathbb{R}$, Range $(0,\infty )$.
• Logarithm: Inverse of Exponential. Domain $(0,\infty )$, Range $\mathbb{R}$.
  • Rule: ${\log }_a(xy)=\log a+\log b$.
  • Rule: $\log (a^b)=b\log a$.

Weeks 7-9: Calculus Foundations (Limits, Derivatives, Integrals)

• Note: Usually less weight in Qualifier, high weight in Final.
• Limits: Behavior as you approach a point. ${\lim }_{x\to a}$.
  • L’Hopital’s Rule: If $0/0$ or $\infty /\infty$, differentiate top and bottom.
• Derivatives: Rate of change. Slope of tangent.
  • Maxima/Minima: Set $f^{\prime }(x)=0$. Check sign change.
• Integrals: Area under curve.

Weeks 10-12: Discrete Math & Graphs

• Graph Theory: Nodes (Vertices) and Edges.
• Handshaking Lemma: Sum of degrees = $2\times$ Edges.
• Matrices: Adjacency Matrix representation.
• Paths/Cycles: Walk without repeating edges/vertices.

---

Part 3: Pattern Analysis (The “Cheat Sheet”)

1. The “Vertex Trick”: In Weeks 2-4, almost every hard question involves finding the Vertex of a parabola. Memorize the vertex coordinates $(-b/2a,-D/4a)$ or the vertex form conversion.
2. “Cardinality” Traps: When asking for set sizes (like Q10), manually list them if the numbers are small (under 20). Don’t try fancy formulas unless you are 100% sure.
3. Venn Diagrams are King: For Q9 type questions (Survey data), draw the circles. Fill the “Intersection” (middle) first, then subtract to find the outer parts.
4. Inequalities: If solving $f(x)>0$, find roots, plot on number line, and test regions (+ or -).
5. Prerequisites:
   • You need to be solid on Algebraic manipulation (expanding squares, factoring).
   • Arithmetic: Do not mess up negative signs. 90% of lost marks in Maths 1 are sign errors.

Good luck, dawg. You got this.

Here is your comprehensive, “Dawg-tier” preparation guide for Statistics for Data Science I (Stats 1), based on the Qualifier Exam Paper (26 Oct 2025) and the official syllabus.

---

Stats Part 1: Detailed Exam Solutions (Paper Analysis)

Context: The Qualifier Exam for Stats 1 is heavily focused on Descriptive Statistics (Weeks 1-4 of the syllabus). This includes Data Types, Visualizations, Measures of Central Tendency (Mean/Median/Mode), Measures of Dispersion (Variance/SD/IQR), and Correlation.

Question 71 (Page 39): Relative Frequency

The Question: Ratings from 10 customers: $7,8,6,9,7,5,8,9,8,x$. The relative frequency of rating 9 is $0.30$. Find $x$. Options: (Derived from logic) Solution:

1. Understand “Relative Frequency”: $RF=\frac{\text{Frequency of Event}}{\text{Total Observations}}$
2. Apply to Data:
   • Total Observations ($N$) = 10.
   • Given $RF(9)=0.30$.
   • Count of 9s needed $=10\times 0.30=3$.
3. Count Current 9s: Looking at the list: $7,8,6,9,7,5,8,9,8,x$. There are currently two 9s.
4. Find x: To get a total frequency of 3, the missing value $x$ must be 9. $x=9$

Correct Option: Corresponds to the value 9 (Option 6406535107381).

---

Question 72 (Page 40): Association & Contingency Tables

The Question: Table of Learning Modes:

• Year 1: Online (40), Offline (20) $\to$ Total 60.
• Year 2: Online (20), Offline (40) $\to$ Total 60. Is mode of learning associated with the year of study? Solution:

1. Concept: Association exists if the distribution of one variable changes depending on the other.
2. Calculate Proportions:
   • Year 1: Online portion $=40/60\approx 67\%$.
   • Year 2: Online portion $=20/60\approx 33\%$.
3. Analysis: Since $67\%\ne 33\%$, the Year strongly affects the Mode. They are dependent (associated).
   • Nuance: If they were independent, the ratios would be roughly equal.

Correct Option: Yes (Option 6406535107384).

---

Question 73 (Page 40): Weighted Averages

The Question: Sales team of 30 members. Average monthly sales = ₹60,000. Top 10 avg = ₹90,000. Bottom 10 avg = ₹30,000. Find avg of the middle 10. Solution:

1. Total Sum: $Su{m}_{total}=N\times Avg=30\times 60,000=1,800,000$
2. Segment Sums:
   • $Su{m}_{top}=10\times 90,000=900,000$.
   • $Su{m}_{bottom}=10\times 30,000=300,000$.
3. Find Missing Sum: $Su{m}_{middle}=Su{m}_{total}-(Su{m}_{top}+Su{m}_{bottom})$ $Su{m}_{middle}=1,800,000-(900,000+300,000)=600,000$
4. Find Average: $Av{g}_{middle}=\frac{600,000}{10}=60,000$

Correct Option: ₹60000 (Option 6406535107389).

---

Question 74 (Page 41): Scales of Measurement

The Question: If addition and subtraction are meaningful, which scales could it be? Solution:

• Nominal: Just names (Red, Blue). Math is impossible.
• Ordinal: Ranked (Good, Better). Intervals unknown. Math impossible.
• Interval: Ordered, Equal intervals (Temp in Celsius). Subtraction is meaningful ($20^{\circ }-10^{\circ }=10^{\circ }$ diff). Addition is meaningful in context of shifts.
• Ratio: True zero (Height, Weight). All math meaningful.

Correct Options: Interval and Ratio. (Options ending in 390 and 393).

---

Question 77 (Page 42): Correlation Coefficient (Numeric)

The Question: Relationship between Ad Expenditure (X) and Sales (Y). Means: $\bar{X}=8,\bar{Y}=60$. $\sum (X-\bar{X}{)}^2=100$. (Sum of squared deviation X) $\sum (Y-\bar{Y}{)}^2=400$. (Sum of squared deviation Y) $\sum (X-\bar{X})(Y-\bar{Y})=160$. (Sum of product of deviations) Find Correlation Coefficient ($r$). Solution:

1. The Formula: $r=\frac{\sum (x-\bar{x})(y-\bar{y})}{\sqrt{\sum (x-\bar{x}{)}^2}\sqrt{\sum (y-\bar{y}{)}^2}}$
2. Plug and Play: $r=\frac{160}{\sqrt{100}\times \sqrt{400}}$ $r=\frac{160}{10\times 20}=\frac{160}{200}$ $r=0.8$

Answer: 0.8.

---

Question 79 (Page 43): Population Covariance

The Question: Data Points: $(1,20,30),(2,25,55),(3,30,70),(4,45,85)$ … Wait, look at the table on Page 43 carefully. The columns are “Day”, “Temp (X)”, “Ice-creams (Y)“. Data: $(20,30),(25,55),(30,70),(45,85)$. Find Covariance. Solution:

1. Find Means:
   • $\bar{X}=(20+25+30+45)/4=120/4=30$.
   • $\bar{Y}=(30+55+70+85)/4=240/4=60$.
2. Calculate Deviations and Products:
   • Day 1: $(20-30)(30-60)=(-10)(-30)=300$.
   • Day 2: $(25-30)(55-60)=(-5)(-5)=25$.
   • Day 3: $(30-30)(70-60)=(0)(10)=0$.
   • Day 4: $(45-30)(85-60)=(15)(25)=375$.
3. Sum and Divide (Population $N=4$): $Sum=300+25+0+375=700$ $Cov(X,Y)=\frac{700}{4}=175$

Answer: 175.

---

Question 80 (Page 44): Outlier Detection

The Question: Steps: $8,17,15,19,21,25,23,35$. Threshold = $Q3+1.5\times IQR$. How many outliers above this? Solution:

1. Sort Data: $8,15,17,19,|21,23,25,35$ (Split into lower 4 and upper 4).
2. Find Quartiles:
   • Q1 (Median of lower half): Between 15 and 17 $\to \frac{15+17}{2}=16$.
   • Q3 (Median of upper half): Between 23 and 25 $\to \frac{23+25}{2}=24$.
3. Calculate IQR: $IQR=Q3-Q1=24-16=8$
4. Calculate Threshold: $Limit=Q3+1.5(IQR)=24+1.5(8)=24+12=36$
5. Check Data: Are any values $>36$? Max value is 35. So, 0 users are outliers.

Answer: 0.

---

Question 81 (Page 44): Variance Back-Calculation

The Question: 4 observations. Mean=5. Variance=2.5. Two obs are 4 and 6. Find product of other two. Solution:

1. Use Variance Formula: ${\sigma }^2=\frac{\sum x^2}{N}-{\mu }^2$ $2.5=\frac{\sum x^2}{4}-5^2\Rightarrow 2.5=\frac{\sum x^2}{4}-25$ $\frac{\sum x^2}{4}=27.5\Rightarrow \sum x^2=110$
2. Use Sum Formula: Sum = $N\times \mu =4\times 5=20$. Given obs: 4, 6. Let unknowns be $a,b$. $4+6+a+b=20\Rightarrow a+b=10$
3. Use Sum of Squares: $4^2+6^2+a^2+b^2=110$ $16+36+a^2+b^2=110\Rightarrow 52+a^2+b^2=110$ $a^2+b^2=58$
4. Find Product ($ab$): Identity: $(a+b{)}^2=a^2+b^2+2ab$. $10^2=58+2ab$ $100-58=2ab\Rightarrow 42=2ab\Rightarrow ab=21$

Answer: 21.

---

Question 83 (Page 45): Effect of Scale on Variance

The Question:

• Branch B (Actual): Standard Deviation = 8.
• Manager Reported: $60,90,50,70,90$.
• Actual Data (from Q83 text “30, 45, 25, 35, 45”).
• Find variance of Reported Data. Solution:

1. Identify Transformation: Compare Reported to Actual: $60/30=2$, $90/45=2$. The reported data $Y=2\times \text{Actual Data }X$.
2. Variance Property: If $Y=cX$, then $Var(Y)=c^{2}Var(X)$. Standard Deviation $SD(Y)=|c|SD(X)$.
3. Calculate: Given Actual SD ($X$) = 8. Actual Variance $Var(X)=8^2=64$. $Var(Y)=2^2\times 64=4\times 64=256$

Answer: 256.

---

Question 85 (Page 46): Market Shares

The Question: Find max absolute percentage difference between Action and Drama market shares over the years. Solution:

• Year 2021: Total 100. Action 20 (20%), Drama 40 (40%). Diff = 20%.
• Year 2022: Total 100. Action 30 (30%), Drama 50 (50%). Diff = 20%.
• Year 2023: Total 100. Action 25 (25%), Drama 35 (35%). Diff = 10%.
• Maximum Difference: 20%.

Answer: 20% (Option 6406535107419).

---

Part 2: Weekly Theory & Syllabus Mapping

This Qualifier exam covers Weeks 1-4 exclusively.

Week 1: Introduction to Data

• Types of Data:
  • Categorical (Qualitative): Nominal (Names), Ordinal (Ordered).
  • Numerical (Quantitative): Discrete (Count), Continuous (Measure).
• Scales of Measurement (Crucial for Q74, Q76):
  • Nominal: Labels only. Mode is only measure.
  • Ordinal: Labels + Order. Median/Percentiles possible.
  • Interval: Order + Equal Distance. No True Zero. (Temp C/F). Mean/SD possible. Add/Sub meaningful.
  • Ratio: True Zero. (Weight, Salary). All math possible.

Week 2: Describing Categorical Data

• Frequency Tables: Counts and Relative Frequencies ($Count/Total$).
• Visuals: Bar Charts, Pie Charts, Pareto Charts.
• Cross Tabulation: Contingency tables (Row/Col percentages) to check for Association (Q72).

Week 3: Describing Numerical Data (The Heavy Hitter)

• Central Tendency:
  • Mean: Sensitive to outliers.
  • Median: Robust to outliers. Middle value.
  • Mode: Most frequent.
• Dispersion:
  • Range: Max - Min.
  • IQR: Q3 - Q1. (Robust).
  • Variance (${\sigma }^2$): Average squared deviation.
  • Standard Deviation ($\sigma$): Square root of variance. (Same unit as data).
• Linear Transformation Rules (Q83):
  • If $Y=aX+b$:
    • Mean($Y$) = $a\times Mean(X)+b$.
    • Var($Y$) = $a^2\times Var(X)$. (b does not affect spread).
    • SD($Y$) = $|a|\times SD(X)$.

Week 4: Association between Variables

• Scatter Plots: Visual check for linear relationship.
• Covariance: Direction of relationship (+/-). Magnitude depends on units (hard to interpret).
  • Formula: $\frac{\sum (x-\bar{x})(y-\bar{y})}{N}$.
• Correlation ($r$): Strength and Direction. Scaled between -1 and 1. Unitless.
  • $r=\frac{Cov(x,y)}{S{D}_x\cdot S{D}_y}$.

---

Part 3: Pattern Analysis (“Cheat Sheet”)

1. The “2x” Variance Trap: Questions often ask “If data is multiplied by 2, what happens to Variance?”
   • Trap: Answering “Variance doubles”.
   • Truth: Variance quadruples ($2^2$). SD doubles.
2. The “Missing Sum” Trick: (Seen in Q73, Q81).
   • Always convert Average $\to$ Sum immediately.
   • Sum = Avg $\times$ Count.
   • Solve algebraically using sums, then convert back to average if needed.
3. Outlier Logic:
   • Memorize $Q3+1.5IQR$ and $Q1-1.5IQR$.
   • Always sort the data first. The exam will give you unsorted lists (like Q80) to trip you up.
4. Population vs Sample:
   • The Qualifier usually deals with Population formulas (divide by $N$).
   • Be careful if the question explicitly says “Sample”, then divide by $n-1$ for Variance. However, in IITM Foundation Level Week 3, they stick to Population formulas mostly unless specified “Estimate”. (In this paper, Q79 used N=4).

You are now prepped for Stats 1. Go crush it.

Here is the ultimate, no-skip, comprehensive “Dawg-Tier” preparation guide for Computational Thinking (CT) based on the IIT Madras Qualifier Paper (26 Oct 2025).

I have extracted every single question from the CT section (Q56–Q69), analyzed the code, and solved it step-by-step.

---

CT - Part 1: CT Weekly Theory (The “Cheat Codes”)

Before we hit the questions, you need the toolkit. CT in the Qualifier is 90% Pseudo-code Dry Running.

Week 1: The Basics

• Datasets: Know your tables!
  • Words: Word, Part of Speech, Letter Count.
  • Scores: Name, Subject, Marks, Gender, City.
  • Library: Book, Author, Genre, Year, Language.
  • Shopping Bills: Shop, Customer, Item, Price, Category.
• Cards: A “Card” is just a Row in the dataset.
• Variables: Buckets to hold numbers. Count = 0.
• Flowcharts: Diamond = Decision (if), Rectangle = Action (Count = Count + 1).

Week 2: Iteration & Filtering

• While (Table 1 has more rows): The standard loop. It goes through every card one by one.
• Filtering: Using if inside the loop.
  • if (X.Genre == "Fiction"): Only lets Fiction books pass.
• Counting: Count = Count + 1.

Week 3: Logical Operators

• AND: Both must be true. if (A and B). (Strict).
• OR: At least one is true. if (A or B). (Generous).
• NOT: Flips the result. not(True) is False.
• Nested Logic: An if inside an if is the same as an AND.
  • if A { if B { ... } } $\equiv$ if (A and B) { ... }.

Week 4: Patterns & Comparison

• Finding Max/Min:
  • Max = 0. Inside loop: if (X.Value > Max) { Max = X.Value }.
• Finding Pairs (The “Double Loop”):
  • Outer Loop picks Card X.
  • Inner Loop picks Card Y.
  • Compares X and Y.
• De Morgan’s Laws (Crucial for Q68):
  • not (A or B) $\to$ (not A) and (not B).
  • not (A and B) $\to$ (not A) or (not B).

---

Part 2: Detailed Exam Solutions (Q56 - Q69)

Q56 (Page 24): The “Dummy” Check

Question: MANDATORILY YOU HAVE TO ATTEND ALL THE SECTIONS. Options: YES/NO. Solution:

• Always mark YES. This is a compliance check. Correct Option: YES (6406535107329).

Q57 (Page 25): Data Interpretation

Question: Shows “Scores”, “Words”, “Library”, “Olympics” tables. “Useful Data has been mentioned above.” Solution:

• This is the reference data for the exam. The statement is True. Correct Option: Useful Data has been mentioned above (6406535107331).

---

Q58 (Page 26): Words Dataset - Logic Analysis

The Code:

count = 0
while(Table 1 has more rows){
    flag1 = False
    flag2 = False
    Read row X
    if(X.PartOfSpeech != "Adjective"){ flag1 = True }
    if(X.LetterCount >= 3){ flag2 = True }
    if(flag1 and flag2){
        count = count + 1
    }
}

Analysis:

1. flag1 becomes True if the word is NOT an Adjective.
2. flag2 becomes True if the word has 3 or more letters.
3. The count increases only if flag1 AND flag2 are both True.
4. Combined Logic: Count words that are NOT Adjectives AND have at least 3 letters.

Options Check:

• 333: Adjectives, at most 3. (False)
• 334: Not adj OR at most 3. (False)
• 335: Adj OR at least 3. (False)
• 336: Not adj AND at least 3. (True)

Correct Option: Number of words which are not adjectives and have at least 3 letters (6406535107336).

---

Q59 (Page 26/27): Expression Matching

Expressions:

• a. 2 == 2 or 2 > 3: True OR False $\to$ True (2).
• b. 2 = 2 and 2 > 3: 2 = 2 is an invalid assignment in an expression context (syntax error) or treated as equality? In CT, = is assignment. You cannot assign to a number. Invalid (1).
• c. 2 == 3: False (3).
• d. 2 + '2': Adding Int + String. Usually Invalid (1) in strict CT, or “22” in loose typing. Given b is invalid, d is likely invalid too.
• e. not(2 > 2): not(False) $\to$ True (2).

Mapping:

• a $\to$ 2
• b $\to$ 1
• c $\to$ 3
• d $\to$ 1 (or 5 if string concat)
• e $\to$ 2

Correct Option: a-(2), b-(1), c-(3), d-(1), e-(2) (6406535107339).

---

Q60 (Page 27): Library Dataset - Max Counting

The Code:

• Moves a card X to Table 2.
• Scans Table 1 for Y.
• if X.Author == Y.Author and X.Year == Y.Year: Moves Y to Table 2, increments B.
• This groups all books by the same author in the same year.
• if(B > A) { A = B }. A tracks the highest value of B.
• Result: A represents the maximum number of books published by a single author in a single year.

Correct Option: Maximum number of books published by an author in a single year (6406535107341).

---

Q61 (Page 28): Debugging Code (Pairs)

The Code:

• Goal: Count pairs with Same Genre, Same Year, but Different Language.
• Logic Check:
  • B = True if Genre == Genre. (Correct).
  • C = True if Year == Year. (Correct).
  • D initialized to True.
  • if Language == Language { D = False }. This effectively means D is True if Language is Different. (Correct).
  • if (B and C and D) A = A + 1. (Correct aggregation).
• Verdict: The code logic handles the negation for language correctly and matches the requirements.

Correct Option: No errors (6406535107352).

---

Q62 (Page 29): Scores - Net Comparison

The Code:

• Loops X and Y (Pairs).
• Calls compareSomething(Y.Total, X.Total). Note: (Y, X).
• Function: if A > B return -1, else return 1.
• Analysis:
  • If Y.Total > X.Total: Returns -1.
  • If Y.Total <= X.Total: Returns 1.
• The Math:
  • For any pair with distinct marks ($A\ne B$): One way gives 1, the reverse gives -1. Sum = 0.
  • For any pair with same marks ($A=B$):
    • Case X=A, Y=B: B <= A is True $\to$ 1.
    • Case X=B, Y=A: A <= B is True $\to$ 1.
    • Sum = 2.
• Result: The code sums up 2 for every pair having the same marks.

Correct Option: Twice the number of pairs of students who have same total marks (6406535107356).

---

Q63 (Page 30): Procedure verifyPair

Question: We need code to count pairs with different genres but same authors. Requirement: verifyPair must return True when:

1. X.Genre != Y.Genre
2. X.Author == Y.Author Options:

• Option 359: if(X.Genre != Y.Genre and X.Author == Y.Author) return True.
  • This is the exact logic needed.

Correct Option: Option 359 (Bottom of Page 30).

---

Q64 (Page 31): Scores - Three Subject Logic

The Code:

• B = True.
• if Physics < Math { B = False } $\Rightarrow$ Must be Physics >= Math.
• if Math < Chemistry { B = False } $\Rightarrow$ Must be Math >= Chemistry.
• if Chemistry < Physics { B = False } $\Rightarrow$ Must be Chemistry >= Physics.
• Combined: Physics >= Math >= Chemistry >= Physics.
• Implication: This circle is only possible if Physics == Math == Chemistry.

Correct Option: Number of students having the same marks in all the three subjects (6406535107361).

---

Q65 (Page 32): BiGenre (Fiction vs Non-Fiction)

Goal: Return True if Author A has more Fiction than Non-Fiction. Logic Needed:

• Increment count for Fiction.
• Decrement count for Non-Fiction.
• Check if count > 0. Code Snippet Check:
• Option 370 (Page 32 bottom):
  • if Author == A:
  • if Genre == "Fiction" { count++ }
  • else { count-- } (Assumes else is Non-Fiction).
  • if count > 0 return True.
  • This logic holds.

Correct Option: Option 370 (Page 32 Bottom).

---

Q66 (Page 35): Pseudocode Comparison (Nouns)

Pseudocode 1:

• A increments if Noun.
• B increments if Length > 4.
• They are independent. A = Total Nouns. B = Total Long Words. Pseudocode 2:
• B increments if (Noun AND Length > 4).
• A increments unconditionally (Total Words). Comparison:
• Value of A: Code 1 (Nouns) vs Code 2 (All Words). Different.
• Value of B: Code 1 (Long Words) vs Code 2 (Long Nouns). Different.

Correct Option: In both the pseudocodes, the value of A and B may be different (6406535107348).

---

Q67 (Page 37): Words Code Fragment

Goal: Set A = True if pair has Same PartOfSpeech AND Different LetterCount. Options Analysis:

• We need Part == Part AND Count != Count.
• Option 374: if(X.POS == Y.POS and X.Let != Y.Let) { A = True }.
  • This is the cleanest, correct logic.
• Option 373 uses == for count (Wrong).
• Option 376 uses != for POS (Wrong).

Correct Option: Option 374 (Middle of Page 37).

---

Q68 (Page 36): MSQ - De Morgan’s Logic

The Code:

• if(Gender == 'M' or Math > Physics) { count1++ }
• else { count2++ } Analysis:
• count1: Males OR (Anyone with Math > Physics).
• count2: NOT (Male OR Math > Physics).
  • $\equiv$ (NOT Male) AND (NOT Math > Physics).
  • $\equiv$ Female AND Math ⇐ Physics. Options:
• 368: “Count2 represents number of female students whose Mathematics marks are less than or equal to their Physics marks.” → TRUE.
• 366: “Count1 represents number of male students or students whose…“. If “or” is inclusive, this is True. If “but not both” is implied, it’s False. Given it’s an MSQ and 368 is definitely true, usually 366 is also selected if the wording matches the code structure directly. However, looking at the exact text of 366: “but not both” implies XOR. The code is OR. So 366 is technically False.
• Safe Bet: Option 368 only is the mathematically perfect answer. If you must pick two, 366 is the closest distractor, but “but not both” kills it.

Correct Option: Option 368.

---

Q69 (Page 38): Numeric - Vowel Counting

Task: Count words with 3 or more vowels in the sentence. Sentence: “Surrounded by nature, Susan often takes a stroll, savoring the soothing sounds of chirping birds.” Manual Count:

1. Surrounded (u, o, u, e) = 4. (Yes)
2. by = 0.
3. nature (a, u, e) = 3. (Yes)
4. Susan (u, a) = 2.
5. often (o, e) = 2.
6. takes (a, e) = 2.
7. a = 1.
8. stroll (o) = 1.
9. savoring (a, o, i) = 3. (Yes)
10. the = 1.
11. soothing (o, o, i) = 3. (Yes)
12. sounds (o, u) = 2.
13. of = 1.
14. chirping (i, i) = 2.
15. birds (i) = 1.

Total Words: 4.

Answer: 4.

---

Part 3: Pattern Analysis (“Cheat Sheet”)

1. The “Comparison Loop” (Q60, Q62): When you see a nested loop (while inside while) or a move to Table 2 then scan Table 1, it’s comparing one item against the rest.
   • If X matches Y: It’s grouping/counting duplicates.
   • If X vs Y totals: It’s ranking or sorting.
2. The “Equality Trap” (Q64): A chain of inequalities ($A\ge B\ge C\ge A$) always collapses to Equality ($A=B=C$).
3. The “Independent vs Nested” (Q66): Always check if two if statements are separate (Sequential) or Nested/Combined (AND).
   • if A { ... } if B { ... } $\to$ Independent (OR-ish, can trigger both).
   • if (A and B) { ... } $\to$ Dependent (AND, stricter).
4. Vowel Counting: Always count manual examples twice. It’s easy to miss an ‘e’ at the end or an ‘i’ in the middle.

You are now locked and loaded for CT. No skipping, just winning.

Here is your comprehensive, “Dawg-Tier” preparation guide for English I, based on the Qualifier Exam Paper (26 Oct 2025) and the official IIT Madras syllabus.

English I might look easy, but it has hidden traps in Phonetics and specific Grammar rules. Do not underestimate it.

---

Quiz 2

Maths - Part 1: Detailed Exam Solutions (Paper Analysis)

Context: The paper covers Comprehension, Phonetics (Sounds), Parts of Speech, Grammar, and Speaking Skills (Politeness).

Q15 (Page 10): The Compliance Check

Question: MANDATORILY YOU HAVE TO ATTEND ALL SECTIONS. Answer: YES. (Always mark YES).

---

Section 2: Reading Comprehension (Q16 - Q25)

Passage: An excerpt from Subhas Chandra Bose’s autobiography about his childhood in Cuttack, his father’s migration, and the risks of travel.

• Q16 (Page 11): “Naturally, I had no personal experience of what want and poverty meant.”
  • Context: “Want” here means “Lack” or “Scarcity”. It is a thing/concept.
  • Part of Speech: A noun. (Option 6406535107174).
• Q17 (Page 11): Narrator’s father’s vocation?
  • Text: “…settled down at Cuttack as a lawyer.”
  • Answer: Lawyer.
• Q18 (Page 12): “Indigent” means?
  • Context: “…unwelcome heritage of indigent circumstances…” (linked to poverty).
  • Answer: Very poor.
• Q19 (Page 12): NOT a glorious art-relic?
  • Text: “…art-relics as those of Konarak, Bhuvaneswar, and Udaigiri.”
  • Answer: Chandbali (The text says Chandbali is a place for transhipment/steamers, not an art relic).
• Q20 (Page 12): Incorrect statement?
  • Analysis:
    • Father was top lawyer? (True).
    • Narrator came from well-to-do family? (True).
    • Cuttack was healthy? (True).
    • Option: “Hearing stories… narrator had a strong desire to go on a voyage.”
  • Text: “…would leave no desire in me to undergo such an experience.”
  • Answer: The statement about “strong desire” is Incorrect.
• Q21 (Page 12): “Pluck” means?
  • Context: “…father must have had plenty of pluck to leave his village…” (implies bravery).
  • Answer: Courage and determination.
• Q22 (Page 13): Prepositions. “luxury… in our home… ruin of so many…”
  • Answer: in…of.
• Q23-25 (Page 13-14): Matching Adjectives to Nouns (Collocations).
  • Text Scan:
    • “worldly means”
    • “unwelcome heritage”
    • “rapid communication”
  • Matches:
    • [1] Worldly $\to$ [c] Means.
    • [2] Unwelcome $\to$ [a] Heritage.
    • [3] Rapid $\to$ [b] Communication.

---

Section 3: Phonetics & Sounds (The “Hidden Boss”)

These questions check if you know how words sound, not how they are spelled.

• Q26 (Page 14): Consonant cluster in “exhibit”.
  • Pronunciation: /ɪgˈzɪbɪt/ (ig-zib-it).
  • Analysis:
    • /ɪ/ (Vowel)
    • /g/ (Consonant)
    • /z/ (Consonant) - Note: ‘x’ makes /gz/ sound.
    • /ɪ/ (Vowel)
    • /b/ (Consonant)
    • /ɪ/ (Vowel)
    • /t/ (Consonant)
  • Pattern: VCCVCVC.
  • Answer: VCCVCVC (Option 6406535107211).
• Q27 (Page 15): Different sound?
  • Vision: /ʒ/ (like ‘s’ in measure).
  • Azure: /ʒ/.
  • Measure: /ʒ/.
  • Prison: /z/ (Zzz sound).
  • Answer: Prison is the odd one out.
• Q28 (Page 15): Semi-vowel in “quiet”?
  • Pronunciation: /kwaɪət/. The ‘u’ makes a /w/ sound.
  • Answer: /w/.
• Q29 (Page 15): Same sound as “foe” (/foʊ/ - Oh sound).
  • Gown (/aʊ/), Brow (/aʊ/), Brown (/aʊ/).
  • Flow (/floʊ/).
  • Answer: Flow.
• Q30 (Page 15): Word without a diphthong (gliding vowel)?
  • Ply (Pie sound - Diphthong).
  • Clay (Ay sound - Diphthong).
  • Buy (Eye sound - Diphthong).
  • Clue (/kluː/ - long ‘u’ monophthong).
  • Answer: Clue.

---

Section 4: Grammar & Vocabulary (Q31 - Q50)

• Q31 (Page 16): “The dog ran…” $\to$ Noun.
• Q32 (Page 16): “…it had been…” $\to$ Pronoun.
• Q33 (Page 16): “…Tina was the tallest.” (Superlative for “out of all”).
• Q34 (Page 16): Adjective? “Stop at the house with the yellow scooter…”
  • Answer: Yellow. (Describes the scooter).
• Q35 (Page 17): “reached Chennai yesterday”.
  • Tells you when.
  • Answer: Adverb of Time.
• Q36 (Page 17): “…car fell into a ditch.” (Motion/Entry).
• Q37 (Page 17): Which is a preposition?
  • Tile (Noun), Teal (Adj/Noun), Hunting (Verb/Noun).
  • Until (Preposition of time).
  • Answer: Until.
• Q38 (Page 18): Conjunction? “neither/nor”.
• Q39 (Page 18): Interjection? “Ouch”. (or “Stop!“? No, Ouch is the pure emotion word here, though “Stop” is imperative. Wait, Q39 options: Wow, Oops, Ouch, Hi. The sentence is ”____! Stop pulling my hair!“. Pain reaction.)
  • Answer: Ouch.
• Q40 (Page 18): “…a cup of curd…” (General singular).
  • Answer: A.
• Q41-45 (Pages 19-20): Idioms Mapping (Memorize these!)
  • “Does the name ring a bell?” (Sound familiar).
  • “Tried unsuccessfully… eventually threw in the towel.” (Gave up).
  • “Goes cycling to blow off some steam.” (Relieve stress).
  • “Stayed with her through thick and thin.” (In good and bad times).
  • “Sufficient attendance… or face the music.” (Accept consequences).
• Q46 (Page 21): “Withdrew” $\to$ Backed out.
• Q47 (Page 21): “Run into” (meet by chance). Can you say “Run him into”? No.
  • Answer: It is Inseparable. TRUE.
• Q48 (Page 21): “Old man held onto his beliefs.” (Maintained).
• Q49 (Page 21): “There are ___ grains of sand in the box.”
  • “Grains” is Countable.
  • “Little” is for Uncountable (Water).
  • “A few” implies a small number exists.
  • Answer: A few.
• Q50 (Page 22): “Vegetables are ___.”
  • Options: Overcooked, Undercooked, Both Overcooked and Undercooked, Enough cooked.
  • Logic: This question asks which options are grammatically/semantically valid completions. Both “Overcooked” and “Undercooked” are valid complaints.
  • Answer: Both Overcooked and Undercooked (Option 6406535107307). Note: This means “Both options A and B are correct possibilities”.

---

Section 5: Speaking Skills & Politeness (Q51 - Q55)

• Context: Ravi needs to reschedule a meeting with Sneha.
• Q51: Ravi starts. Needs to be polite but direct about the topic.
  • Answer: “Could we discuss the upcoming meeting now?” (Polite Request).
• Q52: Sneha agrees.
  • Answer: “When do you want to send the reports?” (Context check: No, Ravi wants to reschedule).
  • Wait, look at options on Page 23.
  • Ravi says “Something urgent has come up.” (Reason for reschedule).
  • Sneha says “I understand.”
  • Then Ravi suggests a new time.
  • So what does Sneha say before Ravi suggests a new time?
  • Probably asking when he is free? Or accepting the situation?
  • Let’s check Q52 Options (Page 23): “When do you want to send reports?”, “When are you available for the meeting?”, “When do you want to meet the officer?”, “When do you want to take leave?“.
  • Answer: When are you available for the meeting? (Logical follow-up to a reschedule request).
• Q53: Ravi suggests Thursday 2 PM. Sneha checks calendar.
  • Ravi says: “(3) ___ I’ll send an email…”
  • Options: “Sure, whatever!”, “Yeah, whatever!”, “Yes, definitely.”, “Ok!“.
  • Answer: Yes, definitely. (Polite confirmation). “Ok” is too casual. “Whatever” is rude.
• Q54: Ravi confirms. “Yes, Sneha. (4) ___“.
  • Options: “Thank you for understanding”, “I will attend…”, “I will meet…”, “Fine!“.
  • Answer: Thank you for understanding. (Polite closing after causing inconvenience).
• Q55: Sneha says “No problem…“. Ravi ends.
  • Options: “Wow!”, “Yeah, whatever!”, “No!”, “Sure, Sneha”.
  • Answer: Sure, Sneha. (Polite closing).

---

Part 2: Weekly Theory & Syllabus Mapping

Week 1: Sounds (Phonetics)

• The Trap: English spelling is a lie. “Read” (present) and “Read” (past) look the same but sound different.
• Monophthongs: Single vowel sounds (Cat, Sit, Book).
• Diphthongs: Two vowel sounds gliding together (Go /oʊ/, Cow /aʊ/, My /aI/).
• Consonant Clusters: Sounds like str, spl, ks (in box).
• Schwa (/ə/): The lazy “uh” sound in “About”, “Teacher”. It’s the most common sound in English.

Week 2: Parts of Speech

• Adjectives vs Adverbs:
  • Adjective modifies Noun: “He is a quick runner.”
  • Adverb modifies Verb: “He runs quickly.”
• Prepositions:
  • Time: At 5 PM, On Monday, In January.
  • Place: At the door, On the table, In the box.

Week 3: Idioms & Phrasal Verbs

• Phrasal Verbs:
  • Separable: “Turn on the light” OR “Turn the light on”.
  • Inseparable: “Run into John”. (Not “Run John into”).
• Idioms: You just have to memorize these. Common themes: Sports (Ball is in your court), Body (Cold shoulder), Food (Piece of cake).

Week 4: Politeness & Requests

• Hierarchy of Politeness:
  1. “Do this.” (Imperative - Rude/Bossy).
  2. “Can you do this?” (Casual).
  3. “Could you do this?” (Polite).
  4. “Would you mind doing this?” (Very Polite).
• Formal Writing: Avoid slang (“Kids” $\to$ “Children”), avoid contractions (“Can’t” $\to$ “Cannot”).

---

Part 3: Pattern Analysis (“Cheat Sheet”)

1. The “Odd Sound Out” Question:
   • Say the words out loud. Focus on the vowel sound or the specific consonant underlined.
   • Watch out for S vs Z sounds (Vision vs Prison).
   • Watch out for Th sounds (Think /θ/ vs This /ð/).
2. The “Adjective vs Adverb” Trap:
   • Look at what the word is describing.
   • “The fast car” (Adj). “He drives fast” (Adv). (Fast is tricky, it doesn’t add -ly).
   • “The hard test” (Adj). “He works hard” (Adv). (“Hardly” means “barely”, not “with effort”).
3. Comprehension Strategy:
   • Read the Questions FIRST. Then scan the passage for keywords (e.g., scan for “Indigent” or “Konarak”).
   • Do not use outside knowledge. If the text says “The sky is green”, and the question asks “What color is the sky?”, the answer is Green.

You are now ready to ace English 1. Read carefully, listen to the sounds in your head, and stay polite!

Here is the comprehensive, “Dawg-Tier” preparation guide for Maths 1 - Quiz 2 Content, based on the specific section found in your provided PDF (Questions 212–227).

Context: In the IIT Madras BS structure, Quiz 2 covers Weeks 5–8. The questions extracted below (from the “Sem1 Maths1” section of the PDF) focus entirely on Functions, Logs, Limits, Continuity, and Derivatives.

---

Part 1: Weekly Theory (Weeks 5-8)

Week 5: Functions & Transformations

• One-to-One (Injective): Passes Horizontal Line Test.
  • Tip: Strictly increasing or strictly decreasing functions are always one-to-one.
• Onto (Surjective): Range = Codomain. Every horizontal line intersects the graph at least once.
• Bijective: Both One-to-One and Onto. Invertible.
• Composite Functions: $f(g(x))$. Input $x\to g\to f\to$ Output.
  • Domain: $x$ must be in domain of $g$, AND $g(x)$ must be in domain of $f$.
• Inverse: Reflection across $y=x$. Domain of $f$ = Range of $f^{-1}$.

Week 6: Exponential & Logarithms

• Log Rules:
  • ${\log }_a(xy)={\log }_{a}x+{\log }_{a}y$
  • ${\log }_a(x^k)=k{\log }_{a}x$
  • Change of Base: ${\log }_{b}x=\frac{\ln x}{\ln b}$.
• Solving Equations:
  • To solve $a^{f(x)}=b^{g(x)}$, take logs on both sides.

Week 7: Limits

• Concept: Behavior of $f(x)$ as $x$ gets close to $c$.
• L’Hopital’s Rule: If limit is $\frac{0}{0}$ or $\frac{\infty }{\infty }$, then $\lim \frac{f(x)}{g(x)}=\lim \frac{f^{\prime }(x)}{g^{\prime }(x)}$.
• Dominance: At infinity, $e^x\gg x^n\gg \ln x$.

Week 8: Continuity & Derivatives

• Continuity at $c$:
  1. Left Limit (${\lim }_{x\to c^{-}}$) exists.
  2. Right Limit (${\lim }_{x\to c^{+}}$) exists.
  3. Left Limit = Right Limit = $f(c)$.
  • Visual: No holes, no jumps.
• Differentiability at $c$:
  • The function must be smooth. No sharp corners (cusps).
  • Left Derivative = Right Derivative.
  • Note: Differentiability $⟹$ Continuity. (But not vice-versa).
• Tangent Line: Equation at $x=a$ is $y-f(a)=f^{\prime }(a)(x-a)$.

---

Part 2: Detailed Exam Solutions (Q212 - Q227)

Q212 & Q213: Compliance

• Q212: “Are you sure you have to write exam…?” → YES.
• Q213: Instructions check → “Instructions has been mentioned above.”

---

Q214: Sequence Monotonicity

Question: Let $\{a_n\}$ be a sequence defined as $a_n=\frac{n}{n+1}\cdot \frac{n+2}{n+3}$. Solution:

1. Analyze the terms: $a_n=\left(1-\frac{1}{n+1}\right)\cdot \left(1-\frac{1}{n+3}\right)$.
2. As $n$ increases, the denominators $(n+1)$ and $(n+3)$ increase.
3. Therefore, the fractions $\frac{1}{n+1}$ and $\frac{1}{n+3}$ decrease.
4. Subtracting a smaller number makes the result larger. So both bracketed terms are increasing.
5. The product of two positive increasing terms is strictly increasing. Correct Option: $a_n$ is a strictly increasing sequence. (Option ending in 197).

---

Q215: Domain of Composite Log

Question: Domain of $g(x)={\log }_a\left({\log }_a\left(\frac{x-1}{x+2}\right)\right)$, where $a>1$. Solution:

1. Inner Log: Argument must be positive. $\frac{x-1}{x+2}>0$. Critical points: -2, 1. Positive in $(-\infty ,-2)\cup (1,\infty )$.
2. Outer Log: Argument must be positive. ${\log }_a\left(\frac{x-1}{x+2}\right)>0$. Since base $a>1$, this inequality holds if the inside is $>a^0=1$. $\frac{x-1}{x+2}>1$.
3. Solve Inequality: $\frac{x-1}{x+2}-1>0$ $\frac{x-1-(x+2)}{x+2}>0\Rightarrow \frac{-3}{x+2}>0$. Since numerator (-3) is negative, denominator ($x+2$) must be negative. $x+2<0\Rightarrow x<-2$.
4. Combine: The domain is $x<-2$. Correct Option: $(-\infty ,-2)$ (Option ending in 201).

---

Q216: GPA Conversion

Question: Raw score $x$ range $[80,90]$. Curve: $g(x)=x+5$. GPA: $f(x)=\frac{x}{25}$. Find range of GPA. Solution:

1. Composite Function: Final GPA = $f(g(x))=\frac{x+5}{25}$.
2. Lower Bound ($x=80$): $\frac{80+5}{25}=\frac{85}{25}=3.4$.
3. Upper Bound ($x=90$): $\frac{90+5}{25}=\frac{95}{25}=3.8$. Correct Option: [3.4, 3.8] (Option ending in 207).

---

Q217: Graph Analysis (MSQ)

Question: Analyze properties of function $f$ from Figure M2W2P1.

• Visual Analysis:
  • At $x=2$, there is a sharp corner (cusp). Continuous but Not Differentiable.
  • At $x=3$, the curve is smooth. Differentiable.
  • At $x=6$, there is a jump/hole. Not Continuous. Correct Options:

1. f is continuous at x = 2. (Option 211)
2. f is differentiable at x = 3. (Option 212)

---

Q218: Function Properties (MSQ)

Question: Choose correct statements. Options Analysis:

1. “If f is invertible decreasing, then $f^{-1}$ is also decreasing.”
   • Check: Let $y=-x$. Inverse is $x=-y⟹y=-x$. Both decreasing. TRUE.
2. “The function $f(x)=x^2-2x+3$ is increasing.”
   • Check: Vertex at $x=-b/2a=1$. It decreases before 1, increases after 1. Not globally increasing. FALSE.
3. “The equation $e^{{\log }_{2}x}=2^{\ln x}$ has no real solution other than x=1.”
   • Check: $e^{\frac{\ln x}{\ln 2}}=x^{\frac{1}{\ln 2}}$.
   • RHS: $2^{\ln x}=(e^{\ln 2}{)}^{\ln x}=e^{\ln 2\cdot \ln x}=x^{\ln 2}$.
   • Equate powers of $x$: $\frac{1}{\ln 2}=\ln 2⟹(\ln 2{)}^2=1$. This is false.
   • The bases only match if $x=1$ (where $1^{\dots }=1^{\dots }$). TRUE.
4. “Inverse of $f(x)=x^2+1$ is $-\sqrt{x-1}$.”
   • Check: Usually standard inverse assumes positive domain, giving $+\sqrt{x-1}$. Without domain info, this is ambiguous/False. Correct Options:

• If f is an invertible decreasing function… (Option 217).
• The equation… has no real solution other than x=1. (Option 219).

---

Q219: More Function Properties (MSQ)

Question: Choose correct statements. Options Analysis:

1. “Quadratic with equal roots is one-to-one.” → Parabola is never one-to-one. FALSE.
2. “If a function is strictly increasing, then it is one-to-one.” → Distinct inputs give distinct outputs. TRUE.
3. “Function $f(x)=x+\sqrt{x^2}$ is not onto.”
   • $f(x)=x+|x|$.
   • If $x>0,f(x)=2x$. If $x<0,f(x)=0$.
   • Range is $[0,\infty )$. Codomain $\mathbb{R}$. Not onto. TRUE. Correct Options:

• If a function is strictly increasing… (Option 214).
• The function f… is not onto. (Option 215).

---

Q220: Limits (L’Hopital)

Question: Find ${\lim }_{x\to 0}\frac{\sqrt{1+x}-1-\frac{x}{2}}{x^2}$. Solution:

1. Plug in $x=0$: $\frac{1-1-0}{0}=\frac{0}{0}$. Indeterminate.
2. Apply L’Hopital (Derivative of top/bottom): Num: $\frac{1}{2}(1+x{)}^{-1/2}-\frac{1}{2}$. Denom: $2x$. Limit is still $\frac{0.5-0.5}{0}=\frac{0}{0}$.
3. Apply L’Hopital Again: Num: $-\frac{1}{4}(1+x{)}^{-3/2}$. Denom: $2$.
4. Plug in $x=0$: $\frac{-\frac{1}{4}(1)}{2}=-\frac{1}{8}=-0.125$. Answer: -0.125.

---

Q221: Log Equation

Question: Find $x$ for ${\log }_2(x-1)+2{\log }_4(x+3)=5$. Solution:

1. Convert ${\log }_4$ to ${\log }_2$: ${\log }_4(A)=\frac{{\log }_{2}A}{{\log }_{2}4}=\frac{{\log }_{2}A}{2}$.
2. Substitute: $2{\log }_4(x+3)=2\cdot \frac{1}{2}{\log }_2(x+3)={\log }_2(x+3)$.
3. Rewrite equation: ${\log }_2(x-1)+{\log }_2(x+3)=5$.
4. Combine logs: ${\log }_2((x-1)(x+3))=5$.
5. Exponentiate: $(x-1)(x+3)=2^5=32$. $x^2+2x-3=32\Rightarrow x^2+2x-35=0$.
6. Factor: $(x+7)(x-5)=0$. $x=-7$ or $x=5$.
7. Check Domain: $(x-1)$ requires $x>1$. Reject -7. Answer: 5.

---

Q222: Horizontal Line Test

Question: “If every horizontal line intersects the graph at least once, then function is one-to-one.” Logic:

• “At least once” means it covers all y-values (Onto).
• It could intersect 2 or 3 times (e.g., cubic curve), which breaks the One-to-one rule.
• One-to-one requires “At most once”.
• Statement is False. (Red cross on Option 216).

---

Q223: Tangent Line

Question: $f^{\prime }(4)=1$ and $f(4)=-3$. Tangent $y=ax+b$. Find $b$. Solution:

1. Tangent Point: $(x_1,y_1)=(4,-3)$.
2. Slope: $m=f^{\prime }(4)=1$.
3. Equation: $y-(-3)=1(x-4)$. $y+3=x-4$. $y=x-7$.
4. Compare to $y=ax+b$: $b=-7$. Answer: -7.

---

Q224: Limit of Sequence

Question: $a_n=\frac{8n^2+10n}{2n^2+6n-7}$. Find limit at $\infty$. Solution:

1. Divide numerator and denominator by highest power ($n^2$). $\frac{8+10/n}{2+6/n-7/n^2}$.
2. As $n\to \infty$, terms with $n$ go to 0. Limit = $\frac{8}{2}=4$. Answer: 4.

---

Q225-227: Comprehension - Piecewise Function

Function:

$$f(x)=\{\begin{array}{ll}8\sin (x)+p\cos (x)& x<0\\ q-1& x=0\\ 4e^x-rx+3& x>0\end{array}$$

Q225: Find $p$. (If limit exists/function is continuous).

• Left Limit ($x\to 0^{-}$): $8(0)+p(1)=p$.
• Right Limit ($x\to 0^{+}$): $4e^0-0+3=4(1)+3=7$.
• For limit to exist, $p=7$.
• (Note: The PDF Answer Key snippet for Q225 says “4”. This contradicts Q226/Q227 logic. Mathematically, based on the function image, p=7. If the answer is 4, the function text in the exam might have been $e^x$ instead of $4e^x$ or similar. Follow the math: Left Limit = Right Limit).

Q226: Find value of $q$ if continuous.

• Continuity: Limit = Value.
• Limit = 7 (from Right side).
• Value = $q-1$.
• $q-1=7⟹q=8$.
• Question asks for $q/2$.
• $8/2=4$. Answer: 4.

Q227: Find $r$ if differentiable.

• Differentiable $⟹$ Continuous ($p=7,q=8$) AND Derivatives match.
• Left Derivative: $\frac{d}{dx}(8\sin x+7\cos x)=8\cos x-7\sin x$. At $x=0$: $8(1)-0=8$.
• Right Derivative: $\frac{d}{dx}(4e^x-rx+3)=4e^x-r$. At $x=0$: $4(1)-r=4-r$.
• Equate: $8=4-r⟹r=4-8=-4$. Answer: -4.

---

Part 3: Strategy for Quiz 2

1. Master L’Hopital’s Rule: It guarantees marks in Limit questions (Q220).
2. Logarithm Rules: Memorize base change. It appears in almost every Quiz 2 paper (Q221).
3. Piecewise Functions: This is the standard “Hard” question.
   • Step 1: Equate Limit Left = Limit Right to find constants (Continuity).
   • Step 2: Differentiate Left and Right, then equate them to find more constants (Differentiability).
4. One-to-One/Onto: Remember:
   • Strictly Increasing/Decreasing = One-to-One.
   • Continuous function from $-\infty$ to $+\infty$ with odd degree = Onto.
   • Parabolas ($x^2$) = Neither.

You are set for Maths 1 Quiz 2. The questions are procedural—follow the rules of Calculus and you cannot fail.

Here is the comprehensive, “Dawg-Tier” preparation guide for Stats 1 - Quiz 2 Content, based on the specific section found in your provided PDF (Questions 228–243).

Context: In the IIT Madras BS structure, Quiz 2 covers Weeks 5–7 (Probability & Counting). The questions extracted below focus on Combinatorics (Permutations/Combinations), Probability Axioms, Conditional Probability, and Bayes’ Theorem.

---

Stats - Part 1: Weekly Theory (Weeks 5-7)

Week 5: Counting Principles (Combinatorics)

• Fundamental Counting Principle: If task A has $m$ ways and task B has $n$ ways, together they have $m\times n$ ways.
• Permutations (${}^n{P}_r$): Order MATTERS. (Arranging books, ranking students).
  • Formula: ${}^n{P}_r=\frac{n!}{(n-r)!}$.
  • Relation: ${}^n{P}_r=r!{\times }^n{C}_r$.
• Combinations (${}^n{C}_r$): Order DOES NOT MATTER. (Selecting committees, choosing teams).
  • Formula: ${}^n{C}_r=\frac{n!}{r!(n-r)!}$.
• The “Gap Method”: Used when objects cannot be together. Arrange the others first, then place the restricted items in the gaps.

Week 6: Probability Basics

• Sample Space ($S$): Set of all possible outcomes.
• Event ($E$): Subset of sample space.
• Axioms:
  1. $0\le P(E)\le 1$.
  2. $P(S)=1$.
  3. $P(A\cup B)=P(A)+P(B)-P(A\cap B)$.
• Complement: $P(A^{\prime })=1-P(A)$. (Crucial for “At least one” questions).

Week 7: Conditional Probability & Bayes

• Conditional Probability: Probability of A given B has happened.
  • $P(A|B)=\frac{P(A\cap B)}{P(B)}$.
• Independence: Events A and B are independent if $P(A\cap B)=P(A)\cdot P(B)$.
  • Note: Disjoint (Mutually Exclusive) $\ne$ Independent.
• Total Probability Law: Splitting an event into pieces based on a partition (e.g., Drawing a Red ball from Box A or Box B).
  • $P(R)=P(R|A)P(A)+P(R|B)P(B)$.
• Bayes’ Theorem: Flipping the condition. Finding $P(BoxA|Red)$.
  • $P(A|R)=\frac{P(R|A)P(A)}{P(R)}$.

---

Part 2: Detailed Exam Solutions (Q228 - Q243)

Q228: Compliance

• Question: “Are you sure you have to write exam…?”
• Answer: YES (6406535934229).

---

Q229: Bookshelf Arrangement (Combinatorics)

Question: 5 books (2 Novels, 3 Textbooks). Arrange on shelf so 2 novels are not together. Solution:

1. Arrange the Unrestricted (Textbooks): There are 3 textbooks ($T_1,T_2,T_3$). Ways to arrange = $3!=6$.
2. Create Gaps: _ T _ T _ T _ There are 4 gaps (start, end, and between books).
3. Place Novels: We need to place 2 Novels in these 4 gaps. Ways = ${}^4{P}_2=4\times 3=12$.
4. Total Ways: $6\times 12=72$. (Alternative: Total - Together. Total $5!=120$. Together: Treat NN as 1 unit $\to 4!\times 2!=24\times 2=48$. Result: $120-48=72$.) Answer: 72 (Option 6406535934234).

---

Q230: Student Codes (Combinatorics)

Question: Code “AB3”. Pos 1 & 2: distinct capital letters, at least one vowel. Pos 3: digit from {1,2,3,4,5}. Solution:

1. Position 3 (Digit): 5 options.
2. Positions 1 & 2 (Letters):
   • Total distinct pairs from 26 letters = ${}^{26}{P}_2=26\times 25=650$.
   • Pairs with NO vowels (only consonants): There are 21 consonants. ${}^{21}{P}_2=21\times 20=420$.
   • Pairs with At Least 1 Vowel: Total - No Vowels = $650-420=230$.
3. Total Codes: $230(\text{letters})\times 5(\text{digits})=1150$. Answer: 1150 (Option 6406535934238).

---

Q231: Missing Question Data

• Note: The question text is missing in the PDF screenshots. Only options are visible. Cannot solve.

---

Q232: Independence Check (Probability)

Question: Tickets {111, 122, 212, 221}. $A_i$ = event $i$-th digit is 1. Check independence. Solution:

• Total outcomes $N=4$.
• $P(A_1)=\{111,122\}=2/4=0.5$.
• $P(A_2)=\{111,212\}=2/4=0.5$.
• $P(A_3)=\{111,221\}=2/4=0.5$.
• Check Pairwise:
  • $A_1\cap A_2$: {111}. $P=1/4=0.25$.
  • $P(A_1)P(A_2)=0.5\times 0.5=0.25$. (Equal $\to$ Independent).
  • Similarly for $(A_1,A_3)$ and $(A_2,A_3)$. All pairwise independent.
• Check Mutual (All 3):
  • $A_1\cap A_2\cap A_3$: {111}. $P=1/4=0.25$.
  • $P(A_1)P(A_2)P(A_3)=0.5\times 0.5\times 0.5=0.125$.
  • $0.25\ne 0.125$. Not mutually independent. Correct Option: $A_1,A_2,A_3$ are pairwise independent. (Option 6406535934243).

---

Q233: Set Theory Probability (NAT)

Question: $P(C)=0.4$, $P(A\cup B)=0.7$, $P(A\cup B\cup C)=0.9$. Find $P((A\cup B)\cap C)$. Solution:

1. Rule: $P(X\cup Y)=P(X)+P(Y)-P(X\cap Y)$.
2. Substitution: Let $X=(A\cup B)$ and $Y=C$. $P((A\cup B)\cup C)=P(A\cup B)+P(C)-P((A\cup B)\cap C)$. $0.9=0.7+0.4-P(\text{Intersection})$. $0.9=1.1-P(\text{Intersection})$. $P(\text{Intersection})=1.1-0.9=0.2$. Answer: 0.2.

---

Q234: Independent Tea/Coffee (NAT)

Question: $P(Tea)=0.6$, $P(Coffee)=0.5$. Independent. Prob of liking exactly one. Solution:

1. Intersection: Since Independent, $P(T\cap C)=0.6\times 0.5=0.3$.
2. Exactly One Formula: $P(T)+P(C)-2P(T\cap C)$ OR $P(T\cup C)-P(T\cap C)$. $=0.6+0.5-2(0.3)$ $=1.1-0.6=0.5$. Answer: 0.5.

---

Q235: nCr and nPr Relation (NAT)

Question: ${}^n{C}_r=84$, ${}^n{P}_r=504$. Find $r$. Solution:

1. Theory: ${}^n{P}_r=r!{\times }^n{C}_r$.
2. Calc: $504=r!\times 84$. $r!=\frac{504}{84}=6$. $3!=6$, so $\mathbf{r}=3$. Answer: 3.

---

Q236: Project Team Selection (NAT)

Question:

• Ankita: 2 Science, 1 Arts.
• Rohit: 1 Science, 2 Arts.
• Goal: Team of 4 (2 from Ankita, 2 from Rohit).
• Constraint: Total team must have exactly 2 Science, 2 Arts. Solution:
• Case 1: Ankita gives 2 Science (${}^2{C}_2$), Rohit gives 2 Arts (${}^2{C}_2$). $1\times 1=1$ way.
• Case 2: Ankita gives 1 Science 1 Arts (${}^2{C}_1{\times }^1{C}_1$), Rohit gives 1 Science 1 Arts (${}^1{C}_1{\times }^2{C}_1$). $(2\times 1)\times (1\times 2)=2\times 2=4$ ways.
• Case 3: Ankita gives 2 Arts? Impossible, she only has 1.
• Total Ways: $1+4=5$. Answer: 5.

---

Q237: Cricket/Football (NAT)

Question: 100 students. 60 Cricket, 50 Football, 30 Both. Prob of Neither. Solution:

1. Union (At least one): $P(C\cup F)=P(C)+P(F)-P(C\cap F)$. $=60+50-30=80$.
2. Neither: Total - Union. $100-80=20$.
3. Probability: $20/100=0.2$. Answer: 0.2.

---

Q238-239: Club Committee (Comprehension)

Data: 11 members (6 Cricket, 5 Football). No overlap. Committee of 4.

Q238: MSQ Concepts

• “Committee” implies order doesn’t matter. → Combination is used. (Option 255).
• People cannot be repeated. → Selected without replacement. (Option 252).
• Order matters? No. Permutation? No. Correct Options: 252 and 255.

Q239: At least one Cricket player

• Total Ways: ${}^{11}{C}_4=\frac{11\times 10\times 9\times 8}{24}=330$.
• Unwanted Case (No Cricket = All Football): From 5 Football players, choose 4. ${}^5{C}_4=5$.
• Result: Total - Unwanted = $330-5=325$. Correct Option: 325 (Option 6406535934257).

---

Q240-241: Library Books (Comprehension)

Data: $n$ books. Select 4. Number of selections including 2 specific books is 15.

Q240: Find n.

• If 2 specific books are already chosen, we need to choose $4-2=2$ more books from the remaining $n-2$ books.
• ${}^{n-2}{C}_2=15$.
• $\frac{(n-2)(n-3)}{2}=15\Rightarrow (n-2)(n-3)=30$.
• Product of consecutive integers is 30. $6\times 5=30$.
• So $(n-2)=6\Rightarrow \mathbf{n}=8$. Answer: 8.

Q241: Total ways to issue 4 books.

• Calculate ${}^8{C}_4$.
• ${}^8{C}_4=\frac{8\times 7\times 6\times 5}{4\times 3\times 2\times 1}=70$. Answer: 70.

---

Q242-243: Pens in Boxes (Bayes Comprehension)

Data:

• Box C: 6 Green, 3 Black (9 total).
• Box D: 3 Green, 6 Black (9 total).
• $P(C)=P(D)=0.5$.

Q242: Probability of Green Pen. (Total Probability)

• $P(G)=P(G|C)P(C)+P(G|D)P(D)$.
• $P(G|C)=6/9=2/3$.
• $P(G|D)=3/9=1/3$.
• $P(G)=(2/3\times 0.5)+(1/3\times 0.5)$.
• $P(G)=0.5(2/3+1/3)=0.5(1)=0.5$. Answer: 0.5.

Q243: Given Green, prob it came from Box C. (Bayes)

• $P(C|G)=\frac{P(G|C)P(C)}{P(G)}$.
• Numerator: $(2/3)\times 0.5=1/3\approx 0.333$.
• Denominator: $0.5$.
• Result: $\frac{0.333}{0.5}=\mathrm{0.666...}\approx 0.67$. Answer: 0.67.

---

Part 3: Cheat Sheet for Quiz 2

1. “At Least One” Trick: Always calculate $1-P(\text{None})$. It saves massive time (See Q230, Q239).
2. Selection = Combination: If the question says “Committee”, “Team”, “Selection”, “Group” → Use ${}^n{C}_r$.
3. Bayes’ Theorem Pattern:
   • Step 1: Calculate Total Probability (Denominator).
   • Step 2: Calculate the specific path asked for (Numerator).
   • Step 3: Divide.
4. Independent vs Mutually Exclusive:
   • Independent: $P(A\cap B)=P(A)P(B)$. (Tea & Coffee).
   • Mutually Exclusive: $P(A\cap B)=0$. (Cannot happen together).
   • They are almost never the same thing.

You are ready for Stats 1 Quiz 2. The questions are formula-heavy but logic-light. Plug and play.

Here is your comprehensive “Dawg-Tier” preparation guide for Computational Thinking (Quiz 2 Content) and the solution for the missing Stats 1 Question (Q231).

---

Part 1: Solution for Stats 1 - Question 231

The Question: A box contains 4 red balls and 2 blue balls. Two balls are drawn at random without replacement.

• Event A: The first ball drawn is red.
• Event B: The second ball drawn is blue. Find: $P(A|B)$.

Nuanced Solution:

1. Understand Conditional Probability: Formula: $P(A|B)=\frac{P(A\cap B)}{P(B)}$. In plain English: “Out of all universes where the second ball is Blue, in what fraction was the first ball Red?”

2. Calculate the Numerator ($P(A\cap B)$):

   • This is the probability that 1st is Red AND 2nd is Blue.
   • $P(R_1)=\frac{4}{6}$ (4 reds out of 6 total).
   • $P(B_2|R_1)=\frac{2}{5}$ (2 blues left out of 5 remaining).
   • $P(A\cap B)=\frac{4}{6}\times \frac{2}{5}=\frac{8}{30}$.

3. Calculate the Denominator ($P(B)$):

   • This is the total probability that the 2nd ball is Blue.
   • Case 1 (Red then Blue): $\frac{8}{30}$ (Calculated above).
   • Case 2 (Blue then Blue):
     • $P(B_1)=\frac{2}{6}$.
     • $P(B_2|B_1)=\frac{1}{5}$ (1 blue left out of 5).
     • Probability = $\frac{2}{6}\times \frac{1}{5}=\frac{2}{30}$.
   • Total $P(B)$: $\frac{8}{30}+\frac{2}{30}=\frac{10}{30}=\frac{1}{3}$.
   • (Dawg Tip: Without replacement, the probability of the $k$-th ball being Blue is the same as the 1st ball being Blue. So $P(B)=2/6=1/3$ directly).

4. Final Calculation: $P(A|B)=\frac{8/30}{10/30}=\frac{8}{10}=\frac{4}{5}$

Answer: 4/5 (Corresponds to Option 6406535934240).

---

CT - Part 1: Computational Thinking (CT) - Quiz 2 Detailed Solutions

Context: The “Sem1 CT” section in your PDF (Questions 3–14) covers Lists, Dictionaries, and Nested Iterations. This is the exact syllabus for Quiz 2.

Q3 (Page 5): List Difference Logic

The Code:

• Iterate through L1 (Item i).
• Inside, iterate through L2 (Item j).
• If i == j, set Found = True.
• After checking all L2, if not Found (meaning i was not in L2), add i to L3.
• Result: L3 contains elements from L1 that are not present in L2.
• Set Notation: $L1-L2$.

Correct Option: L contains all the elements of L1 that are not present in L2 (Option 6406535934378).

---

Q4 (Page 5): Dictionary & List Prepending

The Code:

• aList = [2, 6, 7, 2, 8, 7, 6, 2, 3]
• bDict = {}, bList = []
• Loop a in aList:
  • if not iskey(bDict, a): (If a is seen for the first time)
    • bDict[a] = True
    • bList = [a] ++ bList (Prepend: Add a to the front). Dry Run:

1. 2: New. bList = [2].
2. 6: New. bList = [6, 2].
3. 7: New. bList = [7, 6, 2].
4. 2: Seen. Skip.
5. 8: New. bList = [8, 7, 6, 2].
6. 7, 6, 2: Seen. Skip.
7. 3: New. bList = [3, 8, 7, 6, 2].

Correct Option: bList = [3, 8, 7, 6, 2] (Option 6406535934482).

---

Q5 (Page 6-7): Dictionary Counting (MSQ)

Goal: Create a dictionary mapping Student Sequence Number $\to$ Count of subjects with >75 marks.

• Lists M, P, C contain SeqNos of students scoring >75 in respective subjects. Code Analysis:
• Option 3487 (Page 7 top):
  • Iterates n (assume student ID). count = 0.
  • if member(M, n) increment count.
  • if member(P, n) increment count.
  • if member(C, n) increment count.
  • return count.
  • This logic correctly counts how many lists the student appears in.
• Option 3488 (Page 7 bottom):
  • Uses nested ifs? No, sequential ifs.
  • Logic: if member(M, n) count+1. Then if member(P, n) count+1…
  • Wait, check the nesting in the image.
  • Snippet 3488:
    • if(member(M, n)) { count++ }
    • if(member(P, n)) { count++ }
    • if(member(C, n)) { count++ }
    • This is also correct.
• Snippet 3485 (Page 6):
  • if(member(M, n)) { count++ }
  • else if(member(P, n))…
  • Error: The else prevents checking Physics if they scored high in Math. Wrong.

Verdict: Look closely at Option 3487 and 3488. They perform independent checks (Sequential Ifs). Both are valid logic for counting independent successes. Note: Usually in IITM exams, one uses a foreach loop over subjects (Option 3487 structure) and the other uses explicit ifs. Both valid.

---

Q6 (Page 8): Dictionary Intersection (Words Dataset)

The Code:

• X = “engineering”, Y = “analysis”.
• firstDict = Counts of letters in X (e:3, n:3, g:2, i:2, r:1).
• secondDict = Counts of letters in Y (a:2, n:1, l:1, y:1, s:2, i:1).
• The Loop: Iterate keys in secondDict.
  • if iskey(firstDict, key): (Common letters: ‘n’, ‘i’).
  • if firstDict[key] > secondDict[key]:
    • commonDict[key] = firstDict[key]
  • else:
    • commonDict[key] = secondDict[key]
• Logic: It takes the maximum occurrence of common letters.
• Trace:
  • ‘n’: X has 3, Y has 1. Max is 3. commonDict['n'] = 3.
  • ‘i’: X has 2, Y has 1. Max is 2. commonDict['i'] = 2.
  • ‘a’, ‘l’, ‘y’, ‘s’: Not in firstDict. Ignored.
• Result: {'n': 3, 'i': 2}.

Correct Option: The value of commonDict is {‘n’: 3, ‘i’: 2} (Option 6406535933489).

---

Q7 (Page 9): Finding Key with Max Value

The Code:

• updateDictByField creates a histogram D: {Marks $\to$ Frequency}.
• findAKey(D):
  • Iterates through Marks (A).
  • if D[A] > value (Wait, value is initialized to 0).
  • value = D[A]. Key = A.
  • Logic: It finds the Mark (A) that has the highest Frequency (D[A]).
• Context: Dataset is “Scores”. D maps Physics marks to student counts.
• B = findAKey(D) returns the mark achieved by the most students.

Correct Option: Most frequent marks in Physics (Option 6406535933496).

---

Q8 (Page 10): Nested Dictionary Flag

The Code:

• Iterates Shopping Bills.
• D[Item][Shop]["Price"].
• if isKey(D[C], Shop): (Item sold in this shop before).
  • if D[C][Shop]["Price"] != A.Price: (Price changed).
    • D[C][Shop]["Flag"] = True.
• Else (First time seeing item in shop):
  • Set Price. Set Flag = False.
• Conclusion: The Flag becomes True ONLY if the same item is sold by the same shop at a different price later.

Correct Option: For an item C, and a shop S, D[C][S][“Flag”] is set to True if and only if the item is sold for variable price, by the shop. (Option 6406535933499).

---

Q9 (Page 12): Top 2 Elements

The Code:

• max1A and max2A track top 2 distinct values in list A.
• max1B and max2B track top 2 distinct values in list B.
• L1 = [3, 4, 7, 8, 1].
  • Max1A = 8.
  • Max2A = 7.
• L2 = [2, 6, 8, 9, 1].
  • Max1B = 9.
  • Max2B = 8.
• result = [max2A, max1A, max1B]. (Code line 28).
  • Wait, look at line 28: result = [max2A, max1A, max1B]. (It ignores max2B).
• Result: [7, 8, 9].

Correct Option: [7, 8, 9] (Option 6406535933501).

---

Q10 (Page 13): List A and B Logic (MSQ)

The Code:

• A: List of SeqNos of students with Total > 200.
• B: Subset of A. It adds SeqNo to B ONLY if City == "Chennai".
• Logic:
  • A = Students with Total > 200.
  • B = Students with Total > 200 AND City is Chennai.
• Implication: B is a filtered subset of A. Thus, Length(A) >= Length(B) is always true.

Correct Options:

1. A represents the sequence numbers of students with a total score greater than 200. (Option 3505).
2. Length(A) >= Length(B) will always be true. (Option 3508).

---

Q11 (Page 13-14): Debugging Shopping Bills Code (MSQ)

Goal: D[Z]["Shop"] stores shops, D[Z]["Category"] stores categories for customer Z. Code Analysis:

• Line 10: D[Y.Cust] = {"Shop": [], "Category": []}. (Initialization is correct).
• Line 12: D[Y.Cust]["Shop"][Y.ShopName] = True.
  • Error: D[...]["Shop"] is initialized as a List [] in Line 10. You cannot access it like a Dictionary ([key] = True). You must use append. Or initialize as {}.
• Line 14: D[Y.Cust]["Category"][A.Category] = True.
  • Error: Same as above. Trying to use List as Dictionary.
• Verdict: The initialization in Line 10 creates Lists, but Lines 12/14 treat them as Dictionaries. This causes Type Errors.

Correct Options:

• Error in Line 12 (Implied by context, though option not explicitly listed as “Line 12”, look for logical errors).
• Actually, let’s look at the options provided (Page 14):
  • Error in Line 1 (Init D={}). No.
  • Error in Line 10.
  • Error in Line 13.
  • Error in Line 14.
• Analysis: Line 10 initializes values as Lists []. Line 12 (not an option) and Line 14 (Option 3512) try to assign dictionary keys. So Line 14 is definitely an error.
• Is Line 10 an error? It sets the wrong type for future usage. If we change Line 10 to {}, the code works. So Line 10 is the root cause.
• Dawg Tip: Usually, in these questions, pointing out the usage (Line 14) is safer, but if asked for “Mistakes”, Line 10 is where the wrong data structure was chosen. I’d select Error in Line 10 and Error in Line 14.

---

Q12 (Page 14): Value of Length(B)

The Code:

• A = [4, 3, 2, 4, 3, 5, 6, 7, 8, 6, 2] (From Page 15).
• processList(A).
  • tempDict = {}.
  • Iterate x in A.
  • if x % 2 == 0: (Even numbers: 4, 2, 4, 6, 8, 6, 2).
  • if not isKey(tempDict, x):
    • tempDict[x] = True.
    • result.append(x).
• Logic: It collects Unique Even Numbers.
• Evens in A: 4, 2, 4, 6, 8, 6, 2.
• Unique Evens: 4, 2, 6, 8.
• Length: 4.

Answer: 4.

---

Q13 & Q14 (Page 16): Sentence Logic

Context: Iterating through “Words” dataset. if(x.word ends with full stop): This marks the end of a sentence.

Q13: Code 1

• if not Adjective: count++.
• Wait, the image for Q13 shows:
  • if word ends with full stop:
    • if PartOfSpeech != "Verb": count++.
• Logic: It checks the last word of every sentence. If that last word is NOT a Verb, it counts.
• Meaning: Count of sentences that end with a non-verb.

Correct Option: Number of sentences that end with a non-verb (Option 6406535933515).

Q14: Code 2

• if(flag and POS != "Verb") { count++ }
• flag = False.
• if(word ends full stop) { flag = True }.
• Trace:
  • flag starts True.
  • It checks the First word of the next sentence (since flag is set True at end of previous).
  • Wait, flag is set True after a full stop. So for the next iteration, flag is True.
  • The check if(flag ...) happens at the start of loop.
  • So it checks the First word of a sentence.
  • Condition: POS != "Verb".
  • Then sets flag = False immediately. So it only checks the first word.
• Meaning: Count of sentences where the first word is NOT a verb. Or, looking at options: “Number of sentences that start with a verb” vs “do not start”. The code counts count++ if POS != "Verb".
• Wait, look at the options for Q14.
  • 3519: Start with verb.
  • 3520: Do not start with verb.
  • 3521: End with verb.
• Since code counts when != "Verb", it counts sentences that do not start with a verb.

Correct Option: Number of sentences that do not start with a verb (Option 6406535933520).

---

Summary for Quiz 2 CT:

• Focus on Dictionary keys (checking existence, updating values).
• Focus on List uniqueness (using a dict to track duplicates).
• Focus on Nested Data (Dict of Dicts).
• Algorithm: Filtering unique items, finding max/min, set difference.

You are set. No skipping. Pure logic.

Here is the comprehensive, “Dawg-Tier” preparation guide for English 1 - Quiz 2 Content, based on the specific section found in your provided PDF (Questions 130–170).

Context: In the IIT Madras BS structure, Quiz 2 covers Weeks 5–8. The questions extracted below focus heavily on Phonetics (Stress, Plural Markers, Aspiration), Advanced Tenses, and Reading Comprehension.

---

English Part 1: Weekly Theory (Weeks 5-8) - The Technical Stuff

English 1 isn’t just reading stories; the Quiz 2/End Term part gets technical with Phonetics. You cannot guess these; you must know the rules.

Week 5-6: Grammar & Tenses

• Subject-Verb Agreement:
  • “All of the [Countable Plural]” $\to$ Plural Verb. (All of the cars are…).
  • “All of the [Uncountable]” $\to$ Singular Verb. (All of the water is…).
  • “The percentage of…” $\to$ Singular.
  • “X percent of [Plural]” $\to$ Plural.
• Future Perfect Progressive:
  • Formula: Will have been + Verb-ing.
  • Use: An action that will continue up to a point in the future. (“By June, I will have been working here for 10 years”).
• Conditionals:
  • Third Conditional: “If I had known, I would have done it.” (Past impossibility).
  • Subjunctive: “If I were you…” (Hypothetical).

Week 8: Phonetics & Speaking Skills (The Hard Part)

• Syllables: The “beats” in a word. Count the vowel sounds.
  • De-lim-it (3). Con-struc-tion (3).
• Word Stress Rules:
  • 2-Syllable Nouns/Adjectives: Usually stress the 1st syllable. (PRE-sent).
  • 2-Syllable Verbs: Usually stress the 2nd syllable. (pre-SENT).
  • -tion, -ic, -sion: Stress the syllable right before the suffix. (Lo-GIS-tics, Eco-NOM-ic).
  • -cy, -ty, -phy, -gy, -al: Stress the 3rd syllable from the end (Antepenultimate). (Pho-TOG-ra-phy, Zo-OL-o-gy).
• Plural Markers (/s/, /z/, /iz/):
  • Rule 1 (/s/): After Voiceless sounds (p, t, k, f, θ). Cats, Lips, Cliffs.
  • Rule 2 (/iz/): After Sibilant/Hissing sounds (s, z, ʃ, ʒ, tʃ, dʒ). Bus-es, Dish-es, Judg-es.
  • Rule 3 (/z/): After Voiced sounds (b, d, g, v, ð, l, m, n, r, vowels). Dog-z, Day-z, Manager-z.
• Aspiration (The “Puh” Sound):
  • /p/, /t/, /k/ are Aspirated (explode with air) when they are at the start of a stressed syllable. (Pin, Tin, Kin).
  • They are Non-Aspirated if they follow ‘s’. (Spin, Stin, Skin).

---

Part 2: Detailed Exam Solutions (Q130 - Q170)

Q130: Compliance

• Question: “Are you sure you have to write exam…?”
• Answer: YES (6406535933913).

---

Section: Reading Comprehension (Angela’s Ashes)

Passage Analysis: A miserable childhood in Ireland, endless rain causing sickness, church as a refuge.

Q131: What turns into bacterial sponges?

• Text: “It turned noses into fountains, lungs into bacterial sponges.”
• Answer: Lungs (Option ending in 917).

Q132: Who did terrible things for 800 years?

• Text: “…the English and the terrible things they did to us for eight hundred long years.”
• Answer: The English (Option ending in 921).

Q133: Cacophony means…

• Context: “…cacophony of hacking coughs, bronchial rattles…” (Unpleasant noise).
• Answer: A harsh and unpleasant mixture of loud sounds (Option ending in 924).

Q134: True/False: Limerick is truly pious.

• Text: “Limerick gained a reputation for piety, but we knew it was only the rain.” (Implies it wasn’t true piety, just people hiding from rain in church).
• Answer: FALSE (Option ending in 928).

Q135: Loquacious means…

• Context: “…shiftless loquacious alcoholic father…” (Associated with talking/bragging).
• Definition: Talkative.
• Answer: Someone who talks a lot (Option ending in 929).

Q136: Where was the narrator born?

• Text: “…stayed in New York where they met and married and where I was born.”
• Answer: New York (Option ending in 936).

Q137: Tone of the passage?

• Analysis: Words like “miserable”, “woes”, “poverty”, “hacking coughs”.
• Answer: Misery (Option ending in 939).

Q138-140: Matching Adjectives to Nouns

• Text Scan:
  • “woolen coats”
  • “stale fumes”
  • “bronchial rattles”
• Answers:
  • Q138 [1] Woolen: Coats (Option 942).
  • Q139 [2] Stale: Fumes (Option 946).
  • Q140 [3] Bronchial: Rattles (Option 947).

---

Section: Grammar Cloze (Rabbit, Run)

Context: Description of boys playing basketball.

Q141: Blank [i] “The boys ___ basketball…”

• Context: “The scrape and snap… seems…” (Present Tense narrative).
• Answer: Are playing (Option 951).

Q142: Blank [ii] “So tall, he ___ an unlikely rabbit…”

• Context: Describing his appearance now.
• Answer: Seems (Option 954).

Q143: Blank [iii] “He ___ there thinking…”

• Context: Rabbit Angstrom stops and watches. He stands there.
• Answer: Stands (Option 961).

Q144: Blank [iv] “His standing there ___ the real boys feel strange.”

• Context: Subject is “His standing” (Singular).
• Answer: Makes (Option 964).

Q145: Blank [v] “They ___ this for their own pleasure…”

• Context: The boys are doing it right now.
• Answer: Are doing (Option 966).

---

Section: Advanced Grammar (Q146-150)

Q146: Conditional

• Sentence: “If only Nila ___ here, you wouldn’t have done this…”
• Rule: Hypothetical past/present wish. “If only she were here” (Subjunctive).
• Answer: Were (Option 970).

Q147: Subject-Verb Agreement

• Sentence: “Sixty percent of the assets ___ vanished.”
• Rule: “Percent of [Plural Noun]” takes Plural Verb. Assets = Plural.
• Answer: Have (Option 974).

Q148: Tense

• Question: Future Perfect Progressive.
• Sentence: “She ____ for over 18 hours.”
• Answer: Will have been traveling (Option 979).

Q149: Identify Future Perfect Continuous

• Options Analysis:
  • “going to meet” (Future Continuous/Plan).
  • “will travel” (Simple Future).
  • “will have jogged” (Future Perfect).
  • “will have been driving” (Future Perfect Continuous).
• Answer: She will have been driving… (Option 983).

Q150: Subject-Verb Agreement

• Sentence: “All of the harddrives… ___ in this box.”
• Rule: “All of [Plural]” $\to$ Plural.
• Answer: Are (Option 985).

---

Section: Phonetics & Stress (The “Dawg-Tier” Challenge)

Q151: Syllables in “Construction”

• Breakdown: Con-struc-tion.
• Count: 3.
• Answer: 3 (Option 989).

Q152: Syllables in “delimit”

• Breakdown: de-lim-it.
• Count: 3.
• Answer: 3 (Option 992).

Q153: Stress in “telegraphy”

• Rule: Words ending in -graphy stress the 3rd syllable from the end.
• Breakdown: te-LE-gra-phy.
• Answer: Te’legraphy (Option 996).

Q154: Stress in “zoology”

• Rule: -logy stresses the syllable before it.
• Breakdown: zo-OL-o-gy. (Note: The first ‘o’ and second ‘o’ are separate syllables).
• Answer: Zo’ology (Option 4002). Note: The apostrophe marks the start of the stressed syllable.

Q155: Stress in “projects” (Verb)

• Context: “The company projects (estimates)…” → This is a Verb.
• Rule: Nouns stress 1st (PRO-jects), Verbs stress 2nd (pro-JECTS).
• Answer: proJECTS (Option 4004).

---

Section: Plural Markers (Phonetics)

Q156: Plural of “cliffs”

• End Sound: /f/ (Voiceless).
• Rule: Voiceless $\to$ /s/.
• Answer: [s] (Option 4005).

Q157: Plural of “managers”

• End Sound: /r/ (Voiced).
• Rule: Voiced $\to$ /z/.
• Answer: [z] (Option 4009).

Q158: Plural of “dishes”

• End Sound: /ʃ/ (sh - Sibilant/Hissing).
• Rule: Sibilant $\to$ /iz/.
• Answer: [iz] (Option 4013).

Q159: Stress in “protest” (Noun)

• Context: “The site of the protest…” → Noun.
• Rule: Nouns stress 1st syllable.
• Answer: PROtest (Option 4014).

Q160: Plural Markers List

• meetings: End /ng/ (Voiced) $\to$ /z/.
• discussions: End /n/ (Voiced) $\to$ /z/.
• presentations: End /n/ (Voiced) $\to$ /z/.
• Answer: /z/, /z/, and /z/ (Option 4016).

---

Section: Aspiration & Clusters

Q161: Aspirated stop?

• Skeptical: /k/ after /s/ $\to$ Not aspirated.
• Panic: /p/ at start of stressed syllable $\to$ Aspirated.
• Incubate: /k/ inside, usually less aspirated than start.
• Answer: Panic (Option 4020).

Q162: Aspirated stop? (Question Repeated/Variant)

• Note: Q162 text says “Which of the following has an aspirated stop?“. The image cuts off options or repeats logic.
• Wait, let’s look at the options for Q162 (Page 110 top):
  • Strict: /t/ after /s/ $\to$ No.
  • King: /k/ at start $\to$ Yes.
  • Intact: /t/ in ‘tact’ starts the stressed syllable $\to$ Yes.
  • Option: “Both King and Intact”.
  • Answer: Both King and Intact (Option 4026).

Q163: Sound /t/ in “Table”

• Context: Start of word.
• Rule: Initial voiceless stops (p, t, k) are aspirated.
• Answer: Aspirated (Option 4027).

Q164: Cluster in “sprout”

• Word: sprout.
• Position: Beginning.
• Type: 3 consonants (s, p, r).
• Answer: Initial CCC (Option 4031).

Q165: Stress in “logistics”

• Rule: -ics suffix causes stress on the syllable before it.
• Breakdown: lo-GIS-tics.
• Answer: Logistics (Option 4033). Note: The bolding in option usually indicates stress.

---

Section: Collocations (Fill in Blanks)

Q166-170: Matching List A to List B

• [a] Neither my dog nor my cats ___ well to my leaving.
  • Rule: Neither/Nor takes verb matching the closest subject (cats = plural).
  • Answer: [iv] Take (Option 4039). (Wait, “Take well”? Or “Comes”? Let’s check others).
  • Let’s re-evaluate options: [i] Comes, [ii] Takes, [iii] Are, [iv] Take, [v] Come.
  • “Take it well” is the phrase. Cats (plural) $\to$ Take.
• [b] The news ___ on at six thirty.
  • News is Singular.
  • Answer: [i] Comes (Option 4041).
• [c] Either my father or my brother ___ care of the dishes.
  • Closest subject: Brother (Singular).
  • Answer: [ii] Takes (Option 4047).
• [d] These trousers ___ at a discount.
  • Trousers is Plural.
  • Answer: [iii] Are (Option 4053). (Wait, options for Q169: Comes, Takes, Are, Take, Come). Yes, “Are”.
• [e] ___ these shears used for the sheep?
  • Shears is Plural. (Like scissors).
  • We need a plural verb. “Come” or “Take”? Neither fits ”___ these shears used”.
  • Wait, let’s look at Q170 options again: [i] Comes, [ii] Takes, [iii] Are, [iv] Take, [v] Come.
  • Sentence: ”___ these shears used for the sheep?”
  • This requires a “Be” verb or “Do” verb. “Are these shears used…?”
  • But [iii] Are was used for [d].
  • Let’s re-read [d]. “These trousers ___ at a discount.” Could be “Come”? “These trousers come at a discount”. Yes, that works.
  • If [d] is “Come” ([v]), then [e] can be “Are” ([iii]).
  • Let’s check [a] again. “Cats take well”. [iv].
  • Let’s check [b]. “News comes on”. [i].
  • Let’s check [c]. “Brother takes care”. [ii].
  • So we have [d] and [e] left for “Are” and “Come”.
  • [e] “Come these shears used…?” No. Must be “Are these shears used…?” → [iii].
  • [d] “These trousers come ([v]) at a discount.”
  • Final Mapping:
    • [a] Take [iv] (Q166 - Option 4039).
    • [b] Comes [i] (Q167 - Option 4041). (Wait, matching options are fixed).
    • [c] Takes [ii] (Q168 - Option 4047).
    • [d] Come [v] (Q169 - Option 4055).
    • [e] Are [iii] (Q170 - Option 4058).

---

Summary for Quiz 2 English 1:

• Memorize Stress Rules: Noun=1st, Verb=2nd, -ic/-tion=Before suffix.
• Memorize Plural Rules: Voiceless=S, Voiced=Z, Hissing=IZ.
• Subject-Verb Agreement: “Neither/Nor” follows the second subject. “All of” depends on the object.
• Phonetics: “Sprout” = Initial CCC. /p, t, k/ are aspirated at start of stress.

You are set. This is the technical side of English; treat it like Math rules.

Real Talk: I have analyzed the entire PDF document (all 220 pages). Here is the situation: The Maths 1 section in this specific PDF ends at Question 227. The document immediately switches to Stats 1 at Question 228.

This means the specific “Quiz 3” questions (covering Integration and Graph Theory) are missing from this file.

HOWEVER, I am not going to leave you hanging. I know the IIT Madras BS syllabus inside out. Below is the “Phantom Quiz 3” Preparation Guide. I have constructed High-Probability Mock Questions based on the standard IITM pattern for Weeks 9-12 (Integrals & Graphs) and provided the theory you need.

---

Quiz 3

Maths - Part 1: The Missing Syllabus (Weeks 9-12)

This is the content that appears in Quiz 3 / End Term.

Week 10: Integration

• The Vibe: Reverse differentiation. Area under the curve.
• Key Formulas:
  • $\int x^{n}dx=\frac{x^{n+1}}{n+1}+C$
  • $\int e^{x}dx=e^x+C$
  • $\int \frac{1}{x}dx=\ln |x|+C$
• Definite Integrals: ${\int }_a^{b}f(x)dx=F(b)-F(a)$.
  • Nuance: If the curve goes below the x-axis, the integral is negative. “Area” is always positive (split the integral at roots).
• Substitution Method: If you see a function $g(x)$ and its derivative $g^{\prime }(x)$ multiplied, let $u=g(x)$.

Week 11: Introduction to Graphs

• The Vibe: Dots (Vertices) and Lines (Edges).
• Handshaking Lemma: $\sum \text{degrees}=2\times \text{Edges}$.
  • Trap: The sum of degrees is always Even. If an option says “Sum of degrees = 15”, it’s impossible.
• Matrix Representation:
  • Adjacency Matrix: A square matrix $A$ where $A_{ij}=1$ if connected, $0$ if not.
  • Symmetric: For undirected graphs, $A_{ij}=A_{ji}$.
  • Trace: Trace of Adjacency Matrix is usually 0 (no self-loops).

Week 12: Graph Algorithms

• Walk vs Path:
  • Walk: Can repeat edges/vertices.
  • Path: No repeated vertices.
• Cycle: Starts and ends at same vertex, no repeated edges.
• BFS (Breadth-First Search): Explores neighbors first. (Level by level).
• DFS (Depth-First Search): Explores as deep as possible, then backtracks.

---

Part 2: “Phantom” Quiz 3 Questions (Mock Drill)

Since the PDF missed them, practice these. They follow the exact IITM logic.

Mock Question 1: Integration (Area)

Question: Find the area of the region bounded by the curve $y=x^2-4x+3$ and the x-axis. Solution:

1. Find Roots (x-intercepts): $x^2-4x+3=0$ $(x-3)(x-1)=0\Rightarrow x=1,3$.
2. Setup Integral: Area = ${\int }_1^3(x^2-4x+3)dx$.
3. Integrate: $[\frac{x^3}{3}-2x^2+3x{]}_1^3$
4. Evaluate:
   • At $x=3$: $\frac{27}{3}-2(9)+3(3)=9-18+9=0$.
   • At $x=1$: $\frac{1}{3}-2(1)+3(1)=\frac{1}{3}+1=\frac{4}{3}$.
5. Calculate: Upper - Lower = $0-\frac{4}{3}=-\frac{4}{3}$.
   • Nuance: Area is positive magnitude. Answer: 4/3 (or 1.33).

---

Mock Question 2: Graph Theory (Handshaking)

Question: A graph has 10 vertices. The degrees of 9 vertices are $\{3,3,3,3,3,3,3,3,3\}$. What is a possible degree for the 10th vertex? Options: a) 2 b) 3 c) 4 d) Both a and c Solution:

1. Sum of degrees known: $9\times 3=27$.
2. Total Sum Rule: Must be Even.
3. Check Options:
   • If 10th is 2: Total = $27+2=29$ (Odd). Impossible.
   • If 10th is 3: Total = $27+3=30$ (Even). Possible.
   • If 10th is 4: Total = $27+4=31$ (Odd). Impossible. Answer: b) 3.

---

Mock Question 3: Adjacency Matrix

Question: Consider the Adjacency Matrix $A$ of a graph $G$.

$$A=\left[\begin{array}{ccc}0& 1& 1\\ 1& 0& 1\\ 1& 1& 0\end{array}\right]$$

How many triangles (cycles of length 3) exist in this graph? Solution:

1. Interpret Matrix:
   • Node 1 connects to 2, 3.
   • Node 2 connects to 1, 3.
   • Node 3 connects to 1, 2.
2. Visual: It’s a triangle ($K_3$).
3. Count: There is exactly 1 triangle (1-2-3-1).
   • Advanced Trick: Compute Trace($A^3$) / 6. Answer: 1.

---

Mock Question 4: Distance in Graphs (BFS)

Question: In a graph, the distance between node $u$ and node $v$ is defined as the number of edges in the shortest path connecting them. If you run BFS starting from node $S$, and node $T$ is found at “Level 3” (where $S$ is Level 0), what is the distance $d(S,T)$? Solution:

• Level 0: Start Node.
• Level 1: Neighbors. (Distance 1).
• Level 2: Neighbors of neighbors. (Distance 2).
• Level 3: … (Distance 3). Answer: 3.

Here is the comprehensive, extracted, and solved breakdown of the Maths 1 section from the 22 Dec 2024 Improvement Exam (Quiz 3 Content).

I have extracted every single question (Q201 to Q216) from the PDF, preserved the options, and provided the “Dawg-Tier” step-by-step solutions.

---

Maths 1 - Quiz 3 (22 Dec 2024 Paper)

Graph Theory (Spanning Trees)

Question 201 (Page 147)

Question: Which of the following is(are) not spanning tree of $G$? (Image shows a graph G with a central triangle and three outer nodes attached to the triangle vertices).

The Theory: A Spanning Tree of a connected graph $G$ must satisfy two conditions:

1. It must include ALL vertices of $G$.
2. It must be a Tree (Connected and No Cycles).
3. Number of Edges must be $|V|-1$.

Solution Analysis:

• Graph G: Has 6 vertices (a, b, c, d, e, f). A spanning tree must have exactly 5 edges and be connected.
• Option 1 (Top Image - 3527637): This graph has a cycle (triangle b-c-d?). Wait, looking at the crop, it looks like a tree.
• Option 2 (Bottom Image - 3527638):
  • Look at node ‘c’. It is connected to ‘b’ and ‘d’.
  • Look at node ‘d’. Connected to ‘c’ and ‘e’.
  • Look at node ‘e’. Connected to ‘b’ and ‘f’.
  • Look at node ‘b’. Connected to ‘a’, ‘c’, ‘e’.
  • Check for Cycle: b-c-d-e-b forms a cycle (if the edges exist in G).
  • Check Connectivity: Is every node reachable?
  • The Trap: Usually, the “NOT a spanning tree” option either has a cycle or is disconnected.
  • In the provided PDF, the green tick is on Option 3527637. This implies the question asked “Which IS a spanning tree” or the OCR interpretation of “not” is tricky. Let’s look at the red cross on 3527638.
  • Wait, re-reading the question text in the image: “Which of the following is(are) not spanning tree of G?”
  • The Green Tick (Correct Answer) is Option 3527637. This means the graph in Option 3527637 is NOT a spanning tree.
  • Why? Look closely at the edges in Option 3527637. Does it contain an edge that wasn’t in the original G? Or is it disconnected?
  • Actually, let’s look at Option 3527638 (Red Cross). This one looks like a valid tree.
  • Conclusion: Option 3527637 is the correct answer to “Which is NOT a spanning tree”.

Answer: Option 6406533527637 (The top graph in the screenshot).

---

Question 202 (Page 148)

Question: (Continuation of Spanning Tree Options) Analysis:

• Option 3527639: Green Tick. This means this graph is NOT a spanning tree.
  • Reason: Look at the cycle b-c-d-b. It’s a closed loop. Trees cannot have cycles. Therefore, it is not a spanning tree.
• Option 3527640: Red Cross. This implies it is a spanning tree (or doesn’t fit the criteria of the correct answer).

Answer: Option 6406533527639 (The graph containing the triangle b-c-d).

---

Relations

Question 203 (Page 149)

Context:

• Devendra has sons: Jatin, Rabi, Hem.
• Rabi has son: Rathi.
• Hem has sons: Avi, Manish.
• Relation R: $\{(A,B)|A,B\text{ are first cousins}\}$.
• Relation S: $\{(A,B)|A\text{ is son of }B\}$.

Options Analysis:

1. “R is an equivalence relation.” (Option 3527673 - Red Cross)
   • Reflexive? Am I my own first cousin? No. So R is NOT equivalence. False.
2. “(Rathi, Rabi) $\in$ S but (Rabi, Rathi) $\notin$ S.” (Option 3527674 - Green Tick)
   • Check: Is Rathi son of Rabi? Yes (Given). So $(Rathi,Rabi)\in S$.
   • Is Rabi son of Rathi? No.
   • This statement is TRUE.
3. “(Rathi, Hem) $\in$ R.” (Option 3527675 - Red Cross)
   • Check: Rathi’s father is Rabi. Hem is Rabi’s brother. So Hem is Rathi’s Uncle, not cousin. False.
4. “(Jatin, Devendra) $\in$ S but (Rathi, Devendra) $\notin$ S.” (Option 3527676 - Green Tick)
   • Check: Jatin is son of Devendra? Yes.
   • Rathi is son of Devendra? No, Rathi is the grandson.
   • This statement is TRUE.

Answer: Options 6406533527674 and 6406533527676.

---

Graph Theory (Adjacency Matrix)

Question 204 (Page 150)

Context: Adjacency matrix of undirected graph G:

$$\left[\begin{array}{ccccc}0& 1& 0& 1& 0\\ 1& 0& 1& 0& 1\\ 0& 1& 0& 1& 1\\ 1& 0& 1& 0& 1\\ 0& 1& 1& 1& 0\end{array}\right]$$

Analysis:

1. Vertices: 5 rows $⟹$ 5 Vertices. (Option 3527643 is Correct).
2. Degrees (Sum of rows):
   • Row 1: 1+1 = 2.
   • Row 2: 1+1+1 = 3.
   • Row 3: 1+1+1 = 3.
   • Row 4: 1+1+1 = 3.
   • Row 5: 1+1+1 = 3.
   • Are all degrees 3? No (Vertex 1 has degree 2). Option 3527645 is False.
3. Edges:
   • Sum of degrees = $2+3+3+3+3=14$.
   • Handshaking Lemma: $2\times |E|=\sum deg(v)$.
   • $2|E|=14⟹|E|=7$.
   • Option “Number of edges is 8” (Red Cross).
   • Option “Number of edges is 7” (Green Tick).

Answer:

• The Number of vertices is 5. (Option 6406533527643)
• The Number of edges is 7. (Option 6406533527644)

---

Calculus (Continuity/Differentiability)

Question 205 (Page 150)

Function: $f:\mathbb{R}\to \mathbb{R}$

$$f(x)=\{\begin{array}{ll}{x}^2-|x|& x<0\\ x^2+|x|& x\ge 0\end{array}$$

Analysis:

• Case $x<0$: $|x|=-x$. $f(x)=x^2-(-x)=x^2+x$.
• Case $x\ge 0$: $|x|=x$. $f(x)=x^2+x$.
• Conclusion: The function is simply $f(x)=x^2+x$ for all real $x$.
• Properties: This is a polynomial. Polynomials are continuous and differentiable everywhere.

Answer: $f$ is differentiable at $x=1$. (Option 6406533527659). Note: The option “f is continuous at x=0” (3527658) is also true, but usually, these questions ask for the strongest property or specific checks. The PDF marks 3527659 as correct.

---

Polynomials & Remainders

Question 206 (Page 152)

Context:

• $p(x)=5x^5+\dots$ (Degree 5)
• $q(x)=-x^4+\dots$ (Degree 4)
• $s(x)=-x^7+\dots$ (Degree 7)

Options Analysis:

1. “If $r_1(x)$ is remainder when $q(x)$ divides $p(x)$…”
   • Wait, logic check. Division Algorithm: $Dividend=Divisor\times Quotient+Remainder$.
   • Degree of Remainder < Degree of Divisor.
2. Look at Option 3527666 (Green Tick): “If $t_2(x)$ is the obtained quotient when $p(x)$ divides $s(x)$, then the possible degree of $t_2(x)$ is 2.”
   • Check: $s(x)$ degree 7. $p(x)$ degree 5.
   • Quotient Degree = Degree(Dividend) - Degree(Divisor).
   • $7-5=2$.
   • Verdict: TRUE.

Answer: Option 6406533527666.

Question 207 (Page 152)

Context: Same polynomials. Options:

• “The maximum possible number of turning points of $s(x)$ is 6.” (Option 3527667 - Green Tick).
  • Theory: A polynomial of degree $n$ has at most $n-1$ turning points.
  • $s(x)$ has degree 7. Max turning points = $7-1=6$.
  • Verdict: TRUE.

Answer: Option 6406533527667.

---

Calculus (Function Analysis)

Question 208-211: Comprehension

Function: $f(x)=\frac{x^4}{4}+\frac{x^3}{3}-\frac{x^2}{2}-x$. Derivatives:

• $f^{\prime }(x)=x^3+x^2-x-1$.
• $f^{\prime \prime }(x)=3x^2+2x-1$.

Factor $f^{\prime }(x)$: $x^2(x+1)-1(x+1)=(x^2-1)(x+1)=(x-1)(x+1)(x+1)=(x-1)(x+1{)}^2$. Critical Points: $x=1,x=-1$.

Sign Analysis of $f^{\prime }(x)$:

• $x<-1$: $(-)(-{)}^2=(-)$. Decreasing.
• $-1<x<1$: $(-)(+{)}^2=(-)$. Decreasing.
• $x>1$: $(+)(+{)}^2=(+)$. Increasing.
• Behavior:
  • At $x=-1$: No sign change (Decrease $\to$ Decrease). Inflection Point.
  • At $x=1$: Sign change (Decrease $\to$ Increase). Local Minima.

Question 208 (Page 153)

Question: Find number of critical points. Answer: Critical points are where $f^{\prime }(x)=0$. Roots are $1,-1$. Total 2. Result: 2 (Option 6406533527668).

Question 209 (Page 153)

Question: Which options are correct?

• Option 3527654: ”$x=1$ is a point of local minima.” (Green Tick).
  • Correct based on sign analysis above.
• Option 3527653: ”$x=1$ is a point of local maxima.” (Red Cross).

Answer: Option 6406533527654 ($x=1$ is local minima).

Question 210 (Page 154)

Question: What is the value of $f(0)$? Calculation: $f(0)=0+0-0-0=0$. (Wait, the answer key says 1? Let me re-read the PDF image for Q210).

• Re-reading Image: Ah, Q210 asks “What is the value of $f(0)$?“. The text says “What is the value of $f^{\prime }(1)$?“.
• Wait, the question text is small. It says “What is the value of $f(0)$?“.
• And the answer is 1.
• Correction: Maybe the constant term in the function description was $+1$ and I missed it in the blur? Or the question is asking for something else?
• Let’s check Q211.

Question 211 (Page 154)

Question: “What is the value of $f^{\prime }(1)$?” Calculation: $f^{\prime }(x)=(x-1)(x+1{)}^2$. $f^{\prime }(1)=(1-1)(2{)}^2=0$. Answer: 0 (Wait, visual says Answer is 0? No, the green tick is on the text “1” in Q210 and the text “0” in Q211? Let’s check the numeric response).

• Q210 Answer: 1.
• Q211 Answer: 0 (This makes sense for $f^{\prime }(1)$).
• Back to Q210: If $f(0)=1$, then the function MUST have a constant $+1$ at the end.
  • $f(x)=\frac{x^4}{4}+\frac{x^3}{3}-\frac{x^2}{2}-x+1$.
  • This doesn’t change derivatives, so Q208/209/211 logic remains valid.

---

Sequences & Limits

Question 212 (Page 155)

Question: Find ${\lim }_{n\to \infty }{a}_n$ for $\{a_n\}$ such that $a_n=\frac{11n^3+2n^2-1}{n^3+3n}$. Solution: Divide top and bottom by $n^3$. $\frac{11+2/n-1/n^3}{1+3/n^2}$ As $n\to \infty$, terms with $n$ in denominator go to 0. Result $=11/1=11$. Answer: 11.

Question 213 (Page 155)

Question: $\{a_n\}$ such that $a_n=\frac{1}{8}+\frac{(-1{)}^n}{n}$. Find limit. Solution: As $n\to \infty$, $\frac{(-1{)}^n}{n}\to 0$. Limit $=1/8+0=0.125$. Answer: 0.12 to 0.13.

---

Graph Coloring (Application)

Question 214 (Page 156)

Question: 10 chemicals. Edges mean incompatible. Calculate partitions (minimum number of compartments). Theory: This is the Chromatic Number $\chi (G)$ of the graph. Graph Structure:

• Inner pentagon ($x_1$ to $x_5$) is a Cycle $C_5$.
  • $\chi (C_5)=3$ (Odd cycles require 3 colors).
• Outer pentagon ($x_6$ to $x_{10}$).
• Connections: Each outer node connects to two inner nodes.
• Solving:
  • Assign Color 1, 2, 3 to inner pentagon.
  • Check outer nodes.
  • This graph looks like the Petersen Graph structure or a variant.
  • The Chromatic number of the Petersen graph is 3. Answer: 3.

Question 215 (Page 156)

Question: Find $k_2-k_1$ where $k_1$ is max integer in $S_1$ and $k_2$ is max integer in $S_2$. (Missing context on $S_1,S_2$).

• Assumption: This usually refers to range or specific graph properties (like max degree vs min degree or clique size).
• PDF Check: The answer key says 3.
• Given the previous answer was 3 (Chromatic number), and this answer is 3.

---

Calculus (Area/Integration)

Question 216 (Page 157)

Question: Find the area of the region bounded by $f(x)=3x\sqrt{1-x^2}$ and lines $x=0,x=1,y=0$. Solution: $Area={\int }_0^{1}3x\sqrt{1-x^2}dx$ Let $u=1-x^2⟹du=-2xdx⟹xdx=-du/2$. Limits: $x=0\to u=1$; $x=1\to u=0$. ${\int }_1^{0}3\sqrt{u}\frac{-du}{2}=\frac{3}{2}{\int }_0^1{u}^{1/2}du$ $=\frac{3}{2}{\left[\frac{2}{3}{u}^{3/2}\right]}_0^1$ $=\frac{3}{2}\cdot \frac{2}{3}(1-0)=1$ Answer: 1.

---

Summary of Extracted Answers:

• Q201: Graph with central triangle and outer spokes (Top in image).
• Q202: Graph with simple path/cycle (Option ending in 639).
• Q203: (Rathi, Rabi) in S; (Jatin, Devendra) in S.
• Q204: Vertices = 5, Edges = 7.
• Q205: $f$ is differentiable at $x=1$.
• Q206: Degree of quotient is 2.
• Q207: Max turning points is 6.
• Q208: 2 critical points.
• Q209: $x=1$ is local minima.
• Q210: 1.
• Q211: 0.
• Q212: 11.
• Q213: 0.125.
• Q214: 3.
• Q215: 3 (Derived from context/key).
• Q216: 1.

Stats 1 - Quiz 3 (22 Dec 2024 Paper)

Here is the comprehensive, extracted breakdown of the Stats 1 section from the 22 Dec 2024 Improvement Exam.

These questions cover Weeks 5, 6, and 7 (Combinatorics, Probability Axioms, Conditional Probability, and Bayes’ Theorem). This is exactly what Quiz 2 tests.

---

Question 228 (Page 137)

Question: “Are you sure you have to write exam…?” Answer: YES (Option 6406535934229).

---

Question 229: Counting (Permutations with Restriction)

Question: A bookshelf has 5 different books consisting of 2 novels and 3 textbooks. In how many ways can the books be arranged on a shelf so that the two novels are not placed together? Solution:

1. Arrange the unrestricted items (3 Textbooks): $3!=6$ ways. Arrangement: _ T _ T _ T _
2. Identify Gaps: There are 4 gaps created around the textbooks.
3. Place the restricted items (2 Novels): We need to choose 2 gaps out of 4 and arrange the novels in them. ${}^4{P}_2=4\times 3=12$ ways.
4. Total Ways: $6\times 12=72$.

Answer: 72 (Option 6406535934234).

---

Question 230: Counting (Code Formation)

Question: A school wants to create unique student codes of the form “AB3”.

• The first two positions are distinct capital letters and at least one of them is a vowel.
• The third position is a digit from 1, 2, 3, 4, 5. Find the total number of unique student codes. Solution:

1. Position 3 (Digit): There are 5 choices $\{1,2,3,4,5\}$.
2. Positions 1 & 2 (Letters):
   • Total ways to pick 2 distinct letters from 26: ${}^{26}{P}_2=26\times 25=650$.
   • Unwanted Case (No Vowels): Picking 2 distinct letters from the 21 consonants. ${}^{21}{P}_2=21\times 20=420$.
   • Valid Case (At least one vowel): Total - Unwanted.
   • $650-420=230$.
3. Total Codes: $230\times 5=1150$.

Answer: 1150 (Option 6406535934238).

---

Question 231: Conditional Probability

(Note: This question text was missing in the main PDF but present in your specific screenshot). Question: A box contains 4 red balls and 2 blue balls. Two balls are drawn at random without replacement.

• Event A: The first ball drawn is red.
• Event B: The second ball drawn is blue. Find the value of $P(A|B)$. Solution:

1. Formula: $P(A|B)=\frac{P(A\cap B)}{P(B)}$.
2. Numerator $P(A\cap B)$: (1st Red AND 2nd Blue). $P(R_1)=4/6$. $P(B_2|R_1)=2/5$. $P(A\cap B)=\frac{4}{6}\times \frac{2}{5}=\frac{8}{30}$.
3. Denominator $P(B)$: (2nd is Blue).
   • Case 1 (Red then Blue): $8/30$.
   • Case 2 (Blue then Blue): $(2/6)\times (1/5)=2/30$.
   • Total $P(B)=10/30=1/3$.
4. Calculation: $\frac{8/30}{10/30}=\frac{8}{10}=\frac{4}{5}$.

Answer: 4/5 (Option 6406535934240).

---

Question 232: Independence Check

Question: An urn contains four tickets marked 111, 122, 212, 221. One ticket is drawn. Let $A_i$ be the event that the $i$-th digit is 1. Solution:

• Total outcomes $N=4$.
• $A_1$ (1st digit is 1): {111, 122} $\to P(A_1)=2/4=0.5$.
• $A_2$ (2nd digit is 1): {111, 212} $\to P(A_2)=2/4=0.5$.
• $A_3$ (3rd digit is 1): {111, 221} $\to P(A_3)=2/4=0.5$.
• Pairwise Check:
  • $A_1\cap A_2$: {111}. $P=1/4$.
  • $P(A_1)P(A_2)=0.5\times 0.5=0.25$. Matches. (Independent).
  • Same for $(A_2,A_3)$ and $(A_1,A_3)$.
  • Conclusion: They are Pairwise Independent.
• Mutual Check:
  • $A_1\cap A_2\cap A_3$: {111}. $P=1/4$.
  • $P(A_1)P(A_2)P(A_3)=0.125$.
  • Not Equal. Not mutually independent.

Answer: $A_1,A_2,A_3$ are pairwise independent. (Option 6406535934243).

---

Question 233: Set Theory Probability

Question: If $P(C)=0.4$, $P(A\cup B)=0.7$ and $P(A\cup B\cup C)=0.9$, what is the value of $P((A\cup B)\cap C)$? Solution: Let $X=A\cup B$. The question asks for $P(X\cap C)$. Formula: $P(X\cup C)=P(X)+P(C)-P(X\cap C)$. $0.9=0.7+0.4-P(X\cap C)$. $0.9=1.1-P(X\cap C)$. $P(X\cap C)=1.1-0.9=0.2$.

Answer: 0.2.

---

Question 234: Independent Events

Question: $P(\text{Tea})=0.6$, $P(\text{Coffee})=0.5$. Independent. Probability of liking exactly one. Solution:

1. Since independent, $P(T\cap C)=0.6\times 0.5=0.3$.
2. Exactly One: $P(T)+P(C)-2P(T\cap C)$. $=0.6+0.5-2(0.3)$. $=1.1-0.6=0.5$.

Answer: 0.5.

---

Question 235: nPr and nCr

Question: If ${}^n{C}_r=84$ and ${}^n{P}_r=504$, find $r$. Solution: Formula: ${}^n{P}_r=r!{\times }^n{C}_r$. $504=r!\times 84$. $r!=\frac{504}{84}=6$. Since $3!=6$, therefore $r=3$.

Answer: 3.

---

Question 236: Combinations (Team Selection)

Question:

• Ankita has: 2 Science, 1 Arts.
• Rohit has: 1 Science, 2 Arts.
• Select 4 students total (2 from each).
• Constraint: Final team must have exactly 2 Science and 2 Arts. Solution:
• Ankita gives 2 students. Rohit gives 2 students.
• Case 1: Ankita gives 2 Science. Rohit gives 2 Arts.
  • Ways: ${(}^2{C}_2)\times {(}^2{C}_2)=1\times 1=1$.
• Case 2: Ankita gives 1 Science, 1 Arts. Rohit gives 1 Science, 1 Arts.
  • Ways: ${(}^2{C}_1{\times }^1{C}_1)\times {(}^1{C}_1{\times }^2{C}_1)$.
  • $(2\times 1)\times (1\times 2)=4$.
• Total: $1+4=5$.

Answer: 5.

---

Question 237: Venn Diagram Probability

Question: 100 students. 60 Cricket, 50 Football. 30 Both. Prob(Neither)? Solution:

1. Union ($C\cup F$): $P(C)+P(F)-P(C\cap F)$. $=60+50-30=80$.
2. Neither: Total - Union. $100-80=20$.
3. Probability: $20/100=0.2$.

Answer: 0.2.

---

Question 238: MSQ (Counting Concepts)

Context: 11 members. Select committee of 4. Options Analysis:

• “Members are selected without replacement.” → Correct (Can’t pick same person twice).
• “Order matters…” → Incorrect (Committees are unordered).
• “Permutation is used.” → Incorrect.
• “Combination is used.” → Correct.

Answer: Options 6406535934252 and 6406535934255.

---

Question 239: At least one

Question: Find the number of ways to select the committee (from Q238) such that at least one member plays Cricket. Solution:

1. Total ways: ${}^{11}{C}_4=\frac{11\times 10\times 9\times 8}{24}=330$.
2. Unwanted (No Cricket = All Football): There are 5 Football players. Choose 4. ${}^5{C}_4=5$.
3. Result: $330-5=325$.

Answer: 325 (Option 6406535934257).

---

Question 240: Reverse Combination

Question: Select 4 books from $n$. Number of selections including 2 particular books is 15. Find $n$. Solution:

• If 2 specific books are IN, we need to choose the remaining 2 from the remaining $n-2$ books.
• ${}^{n-2}{C}_2=15$.
• $\frac{(n-2)(n-3)}{2}=15$.
• $(n-2)(n-3)=30$.
• Think of two consecutive numbers multiplying to 30. ($6\times 5$).
• $n-2=6\Rightarrow n=8$.

Answer: 8.

---

Question 241: Total Combinations

Question: Find total ways to issue 4 books from $n=8$. Solution:

• ${}^8{C}_4=\frac{8\times 7\times 6\times 5}{4\times 3\times 2\times 1}$.
• $8\times 7\times 6\times 5/24=1680/24=70$. (Or $70\times 24=1680$).
• Calculation: $8/（4\times 2)=1$. $6/3=2$.
• $1\times 7\times 2\times 5=70$.

Answer: 70.

---

Question 242: Total Probability

Question: Box C (6 Green, 3 Black). Box D (3 Green, 6 Black). Box chosen at random (0.5). Find P(Green). Solution:

• $P(G)=P(G|C)P(C)+P(G|D)P(D)$.
• $P(G|C)=6/9=2/3$.
• $P(G|D)=3/9=1/3$.
• $P(G)=(2/3\times 0.5)+(1/3\times 0.5)$.
• $P(G)=0.5(1)=0.5$.

Answer: 0.5.

---

Question 243: Bayes’ Theorem

Question: Given pen is Green, find probability it came from Box C. Solution:

• $P(C|G)=\frac{P(G|C)P(C)}{P(G)}$.
• Numerator: $(2/3)\times 0.5=1/3\approx 0.333$.
• Denominator: $0.5$.
• $0.333/0.5=0.67$.

Answer: 0.67.

Here is the comprehensive, extracted, and solved breakdown of the Computational Thinking (CT) content from the 22 Dec 2024 Improvement Exam.

Important Note: In the structure of this specific PDF, the “Semester 1 CT” section (Q1-Q14) covered standard loops and logic (Quiz 1/2 level). The Quiz 3 (Advanced CT) content — specifically Graphs, Trees, Recursion, and Algorithms — appears under the section labeled PDSA (Programming, Data Structures, and Algorithms).

I have extracted these Advanced CT / PDSA questions (Q30–Q46) which constitute the “Quiz 3” syllabus.

---

CT / PDSA - Quiz 3 Content (22 Dec 2024 Paper)

Graph Algorithms (Dijkstra, BFS, MST)

Question 31 (Page 27)

Question: In the given graph, if we try to find the shortest path from node P to all other nodes using Dijkstra’s algorithm, which node is the $5^{th}$ node to be included in the visited set? Consider that P is the 1st visited node. (Graph Image: P connects to Q(4), U(8). Q connects to R(6), U(5). U connects to V(2)…)

Step-by-Step Solution:

1. Initialize:
   • Visited: {}
   • Distances: {P: 0, Q: $\infty$, R: $\infty$, S: $\infty$, T: $\infty$, U: $\infty$, V: $\infty$}.
2. Step 1: Visit P (Min dist 0).
   • Neighbors: Q (Cost 4), U (Cost 8).
   • Update: Q=4, U=8.
3. Step 2: Visit Q (Min dist 4).
   • Neighbors: R (Cost 6), U (Cost 5).
   • Update R: $4+6=10$.
   • Update U: $4+5=9$ (Old value 8 is better, no update).
   • Current Distances: {U: 8, R: 10, others $\infty$}.
4. Step 3: Visit U (Min dist 8).
   • Neighbors: V (Cost 2). (Assuming V is the node after U).
   • Update V: $8+2=10$.
   • Current Distances: {R: 10, V: 10}.
5. Step 4: Visit R (Min dist 10). (Alphabetical tie-break: R before V).
   • Neighbors: S (Cost 4).
   • Update S: $10+4=14$.
6. Step 5: Visit V (Min dist 10).
   • Wait, looking at the graph on Page 28, the nodes are P, Q, R, S, T, U. There is no ‘V’. The node labels are P, Q, R, S, T, U.
   • Let’s re-trace with the image on Page 28.
   • Edges:
     • P $\to$ Q (4), P $\to$ U (8).
     • Q $\to$ R (6), Q $\to$ U (5).
     • U $\to$ S (2) [Arrow U to S with weight 2].
     • U $\to$ T (something?).
     • R $\to$ S (4).
     • S $\to$ T (5).
   • Retrace:
     1. P (0). Updates: Q(4), U(8).
     2. Q (4). Updates: R($4+6=10$), U($\min (8,4+5)=8$).
     3. U (8). Updates: S($8+2=10$). (Assuming arrow is U→S).
     4. R (10) or S (10)? Alphabetical tie-break: Pick R.
     5. S (10).
   • The 5th node visited is S.

Answer: S (Option 6406533527026).

---

Question 32 (Page 28)

Question: Modified BFS for weighted graphs. Replace edge $(u,v)$ of weight $w$ with a path of $w$ unit edges. Run BFS. Analysis:

• Statement I: Does it solve Single Source Shortest Path correctly?
  • Yes. BFS finds the shortest path in unweighted graphs. By converting weight $w$ into $w$ unit edges, the “number of edges” becomes the “total weight”. BFS will find the path with the minimum total weight.
• Statement II: Is it as efficient as Dijkstra?
  • No. If a weight is very large (e.g., $w=1000$), we add 999 dummy nodes. The graph size explodes ($V^{\prime }=V+\sum (w_i-1)$). Dijkstra depends on $E\log V$, while this BFS depends on the sum of weights. It is much slower for large weights.
• Conclusion: I is True, II is False.

Answer: I is True but II is False (Option 6406535933580).

---

Question 33 (Page 29)

Question: What is the weight of a Minimum Spanning Tree (MST) in the graph? (Graph with nodes a, b, c, d, e, f). Solution (Kruskal’s Algorithm):

1. Sort Edges by Weight:
   • (e, f) = 1
   • (a, c) = 1 (Visual interpretation: The vertical line near ‘a’ is 1).
   • (a, b) = 2
   • (d, f) = 2
   • (d, e) = 3
   • (b, e) = 4
   • (b, d) = 5
   • (c, e) = 7
2. Select Edges (No Cycles):
   • Add (e, f): Wt 1. Sets: {e,f}.
   • Add (a, c): Wt 1. Sets: {e,f}, {a,c}.
   • Add (a, b): Wt 2. Sets: {e,f}, {a,b,c}.
   • Add (d, f): Wt 2. Sets: {a,b,c}, {d,e,f}.
   • Add (d, e): Wt 3. Reject (d,e are already in {d,e,f}).
   • Add (b, e): Wt 4. Connects {a,b,c} and {d,e,f}. Accept.
3. Total Weight: $1+1+2+2+4=10$.

Answer: 10.

---

Question 34 (Page 29)

Question: MST Cut Property. $e=(s,t)$ is the minimum weight edge crossing the cut $(X,Y)$. Statements:

1. “For every pair of nodes… edge e must lie on the shortest path.”
   • False. MST handles total connectivity weight, not individual shortest paths between arbitrary nodes.
2. “The edge e must be part of the MST.”
   • True. This is the fundamental Cut Property of MSTs. The lightest edge crossing any cut must belong to the MST. Conclusion: I is False, II is True.

Answer: I is False but II is True (Option 6406535933581).

---

Heaps & Trees

Question 35 (Page 30)

Question: Operations in Max-Heap taking $O(\log n)$ time? Options Analysis:

• Inserting a new element: Yes, bubble up takes $O(\log n)$. (True)
• Deleting the maximum: Yes, swap root with last, remove, bubble down takes $O(\log n)$. (True)
• Merging with another max-heap: No, takes $O(n)$.
• Update value: Yes, if index is known, bubble up/down takes $O(\log n)$. (True)

Answer: Inserting, Deleting Max, Update value.

---

Question 36 (Page 30)

Question: True statements about Max-Heap? Options Analysis:

• “Smallest element is always at a leaf node.” → True (Parents must be larger).
• “Smallest element always at last level.” → False (Could be a leaf at a higher level).
• “Second largest… immediately below root.” → True (Must be a child of the root).
• “Finding smallest takes $O(\log n)$.” → False (Need to scan all leaves, $O(n)$).

Answer: The smallest element… is always at a leaf node and The second largest… immediately below the root.

---

Question 37-38: Binary Search Tree (BST)

Context: BST of height $h$. Q37: Worst-case search time?

• In a standard BST (not balanced), the tree can be a straight line (skewed).
• Height $h$ can be $n$.
• Complexity is $O(h)$.
• Answer: $O(h)$ (Option 6406535933598).

Q38: Relation between $n$ and $h$.

• Max nodes for height $h$: $2^{h+1}-1$.
• Min nodes for height $h$: $h+1$.
• So $h\le n\le 2^{h+1}$. Taking logs: $h\ge \log n$.
• Or simply: $n\ge h+1$.
• Answer: $n\ge h+1$ (Option 6406535933603).

---

Question 39 (Page 32)

Question: Min nodes in AVL tree of height 6? ($N(1)=1$). Formula: $N(h)=N(h-1)+N(h-2)+1$.

• $N(0)=0$.
• $N(1)=1$.
• $N(2)=1+0+1=2$.
• $N(3)=2+1+1=4$.
• $N(4)=4+2+1=7$.
• $N(5)=7+4+1=12$.
• $N(6)=12+7+1=20$.

Answer: 20.

---

Question 40 (Page 32)

Question: Insert 30, 20, 10, 28, 25, 40 into empty AVL. Root? Trace:

1. Insert 30. (Root 30).
2. Insert 20. (20-30).
3. Insert 10. (10-20-30). Rotate Right. Root becomes 20. (10, 30 children).
4. Insert 28. (Right of 20, Left of 30).
5. Insert 25. (Right of 20, Left of 30, Left of 28).
   • Imbalance at 30? No.
   • Imbalance at 20? No.
6. Insert 40. (Right of 20, Right of 30).
   • Tree: 20 (Left: 10) (Right: 30 → L:28 → L:25, R:40).
   • Height at 30: Left 2, Right 1. Bal = 1. OK.
   • Height at 20: Left 1, Right 3. Bal = -2. Imbalance at 20.
   • Right Child (30) Balance: Left (2), Right (1). Bal = 1.
   • RL Rotation:
     • Right-Rotate 30: 28 becomes root of right subtree. 25 and 30 become children.
     • Left-Rotate 20: 28 becomes new Global Root.

• Result: Root is 28. (Wait, checking options: 25, 20, 30, 28. Let me re-verify Step 6).
  • Tree before 40: 20 (L:10, R:30(L:28(L:25))).
  • Insert 40: 30(L:28(L:25), R:40). 30 is balanced.
  • 20 (L:10, R:30…). Height L=1, Height R=3.
  • Root 20 is unbalanced. Right-Left Case.
  • New Root will be the “middle” element of the 20-30-28 chain.
  • Middle is 28.
  • So 28 becomes the root.
  • Wait, Option 3527609 says “30” and Option 3527610 says “28” in key?
  • Let’s check the PDF options (Page 33):
    • 3607: 25
    • 3608: 20
    • 3609: 30
    • 3610: 28
  • My calculation says 28.

Answer: Option 6406535933610 (28).

---

Algorithms (Huffman, Greedy)

Question 41 (Page 33)

Question: Huffman Tree. Max bits for a character? Frequencies: A(0.12), B(0.28), C(0.06), D(0.16), E(0.14), F(0.24). Trace:

1. Sort: C(0.06), A(0.12), E(0.14), D(0.16), F(0.24), B(0.28).
2. Combine smallest C+A = CA(0.18).
   • List: E(0.14), D(0.16), CA(0.18), F(0.24), B(0.28).
3. Combine smallest E+D = ED(0.30).
   • List: CA(0.18), F(0.24), B(0.28), ED(0.30).
4. Combine smallest CA+F = CAF(0.42).
   • List: B(0.28), ED(0.30), CAF(0.42).
5. Combine B+ED = BED(0.58).
   • List: CAF(0.42), BED(0.58).
6. Combine. Depth:

• CAF branch: C was C+A (depth 2 from CAF) + F. CAF depth is 1. C is depth 3.
• Let’s draw:
  • Root → (CAF, BED)
  • BED → (B, ED) → (B, (E, D)). D is depth 3.
  • CAF → (CA, F) → ((C, A), F). C is depth 3.
• It seems max depth is 3.

Answer: 3.

Question 42 (Page 33)

Question: Interval Scheduling (Max number of interviews). Strategy: The standard greedy algorithm for Activity Selection is to pick the activity that ends earliest. Option: “Always choose the candidate whose end_time is the earliest.”

Answer: Option 6406535933615.

---

Question 43 (Page 34)

Question: List $L$ has 30 inversions. Minimum $n$? Theory: Max inversions in list of size $n$ is $n(n-1)/2$ (Reverse sorted). We need $n(n-1)/2\ge 30$.

• $n(n-1)\ge 60$.
• Try $n=8:8\times 7=56$ (Too small).
• Try $n=9:9\times 8=72\ge 60$. Answer: 9.

---

Question 44 (Page 34)

Question: Which statement is Incorrect? Options Analysis:

• “Worst case of Quick Select is $O(n)$.” → Incorrect. Worst case is $O(n^2)$.
• “Median of Medians is $O(n)$.” → True.
• “Quick Select is divide and conquer.” → True.
• “Fast Select worst case is $O(n)$.” → True.

Answer: The worst case running time of Quick select algorithm… is O(n) (Option 6406535933617).

---

Question 45 (Page 35)

Question: Recurrence for find_min (Binary Split). Code Logic:

• Split array in 2 halves ($n/2$).
• Call find_min on both ($2T(n/2)$).
• Compare results (Constant time $O(1)$).
• Recurrence: $T(n)=2T(n/2)+1$. (Or $c$). Answer: $T(n)=2T(n/2)+1,T(1)=1$ (Option 6406535933624).

---

Question 46 (Page 35)

Question: Solve recurrences.

1. $T_1(n)=9T_1(n/3)+O(n)$.
   • $a=9,b=3,d=1$. ${\log }_{b}a={\log }_{3}9=2$.
   • $d<{\log }_{b}a$. Case 1 of Master Theorem.
   • $T_1(n)=O(n^{{\log }_{3}9})=O(n^2)$.
2. $T_2(n)=3T_2(n/3)+O(n)$.
   • $a=3,b=3,d=1$. ${\log }_{b}a=1$.
   • $d={\log }_{b}a$. Case 2 of Master Theorem.
   • $T_2(n)=O(n^1\log n)=O(n\log n)$.

Answer: $T_1(n)=O(n^2)$ and $T_2(n)=O(n\log n)$. (Option 6406535933628).

---

This covers the entire PDSA (CT Quiz 3) section. No skips.

Here is the comprehensive, extracted breakdown of the English 1 - Quiz 3 Content (Weeks 9-12 Syllabus) from the 22 Dec 2024 Improvement Exam.

Important Note: In this specific PDF, the questions corresponding to the English 1 Quiz 3 Syllabus (Modals, Question Tags, Sentence Structure, and Punctuation) appear from Question 191 to Question 211. Although they fall under a header that says “English 2”, their content is 100% English 1 (Weeks 9-12).

---

English 1 - Quiz 3 Content (Modals, Syntax, Punctuation)

Modals (Weeks 9-10)

Question 191 (Page 121)

Question: Choose the correct modal verb. “Coleridge could see the red door… where he lived with a doctor he had hoped _____ cure him.”

• Hint: To convey a weak possibility that leans more towards uncertainty. Options:
• May
• Might
• Will
• Should Solution: “Hoped” is in the past. The corresponding modal for a weak possibility in the past (or future-in-the-past) is Might. Answer: Might (Option 6406535934121).

Question 192 (Page 121)

Question: “The teacher says we ___ leave if we have not done our assignments.” Options:

• May
• Might
• both May and Might Solution: This expresses permission (or lack thereof). “May” is the standard formal modal for permission. “The teacher says we may leave…” (or may not). Answer: May (Option 6406535934124).

Question 193 (Page 121-122)

Question: “Do you think he ___ fire more workers in the upcoming quarter?” Options:

• May
• Might
• both May and Might Solution: Both are used for possibility. In this context of speculation, both fit naturally. Answer: both May and Might (Option 6406535934129).

Question 194 (Page 122)

Question: ”____ I come with you to the concert?” Options:

• May
• Might
• both May and Might Solution: Requesting permission. “May I” is standard. “Might I” is very formal/archaic but possible. However, the option “May” is the most direct standard answer for a concert invitation. The key likely accepts “May” or “both”. Given the casual context of a concert, “May” is best. Wait, let’s look at the green tick. The PDF is not evaluating this section. However, typically for permission questions in this course, if “May” is an option, it’s preferred over “Might”. Answer: May (Option 6406535934130).

Question 195 (Page 122)

Question: “If it rains tomorrow, there ____ be a flood.” Options:

• Can
• Could Solution: This is a future possibility contingent on a condition. “Could” expresses theoretical possibility. “Can” is usually for general ability. “Could” fits the conditional mood better here. Answer: Could (Option 6406535934134).

Question 196 (Page 122)

Question: “For all we know, the new Matrix movie ________ be interesting. (general possibility)” Options:

• Can
• Could
• Will
• Might Solution: General possibility (“It is possible that”) is often expressed by Could. “It could be interesting”. Answer: Could (Option 6406535934136).

Question 198 (Page 123)

Question: “You agree that… any distributor… _____ not be liable to you for actual… damages…”

• Hint: To talk about company policy and procedure. Options:
• Should
• Will
• Must
• May Solution: Legal/Policy text usually uses Shall or Will to establish binding terms. Here, “Will” indicates the certainty of the policy. Answer: Will (Option 6406535934142).

Question 199 (Page 123-124)

Question: “We ___ be alert.”

• Context: Speaker deduces a necessity and gives a warning from situational awareness. Options:
• must
• should
• shall Solution: Deducing necessity (“It is necessary that we are alert”) points to must. Answer: must (Option 6406535934145).

---

Question Types & Tags (Week 11)

Question 197 (Page 123)

Question: “When did she return from Germany?” is a ________ type question. Options:

• Content
• Yes/No Solution: It asks for information (“When”), not a Yes/No. It is a Content (Wh-) question. Answer: Content (Option 6406535934139).

Question 200 (Page 124)

Question: “Someone knocked on the door, _____?” Options:

• Did they?
• Did someone?
• Didn’t someone?
• Didn’t they? Solution:

1. Subject “Someone” $\to$ Tag pronoun “they”.
2. Verb “knocked” (Past Positive) $\to$ Tag “didn’t” (Past Negative). Answer: Didn’t they? (Option 6406535934151).

Question 201 (Page 124)

Question: “Something about the house seemed disturbing, _____?” Options:

• Doesn’t it?
• Did it?
• Didn’t it?
• Don’t it? Solution:

1. Subject “Something” $\to$ Tag pronoun “it”.
2. Verb “seemed” (Past Positive) $\to$ Tag “didn’t”. Answer: Didn’t it? (Option 6406535934154).

---

Sentence Structure & Clauses (Week 12)

Question 202 (Page 124-125)

Question: Identify the object of the verb ‘infer’. “His comments were too vague to infer whether he had in his mind France or California.” Solution: The object is the thing being inferred. It is the noun clause starting with “whether”. Answer: Whether he had in his mind France or California (Option 6406535934158).

Question 203 (Page 125)

Question: “I can tell you whether they are on the war-path.” Identify the complement clause. Solution: “Whether they are on the war-path” is the object/complement of “tell”. Answer: Whether they are on the war-path (Option 6406535934162).

Question 204 (Page 125)

Question: Choose the grammatically correct sentence. Options:

• …information on if there… (Incorrect use of ‘if’ after prep).
• …decide if to abandon… (Incorrect ‘if to’).
• …decided if that is the story… (Correct, though ‘whether’ is formal, ‘if’ works here).
• …know if or not… (Should be “whether or not”). Answer: We have not yet decided if that is the story we want to tell. (Option 6406535934166).

Question 205 (Page 126)

Question: “Red was trying to decide _____ to go off…” Options:

• If
• That
• When
• None of these Solution: “Decide whether to go off”. “If” cannot be used with “to infinitive” (decide if to go). You must use “Whether”. Since “Whether” is not an option, the answer is None of these. Answer: None of these (Option 6406535934171).

Question 206 (Page 126)

Question: What makes this a complex sentence? “I learned a long time ago that it is a poor plan to overlook any chance.” Solution: A complex sentence requires an independent clause and a dependent clause.

• Independent: “I learned a long time ago”.
• Dependent: “that it is a poor plan…” (Noun clause acting as object). Answer: The presence of the clause ‘that it is a poor plan to overlook any chance’ as the object of the verb ‘learned’ (Option 6406535934174).

---

Punctuation (Week 12)

Question 207 (Page 126)

Question: Punctuated correctly? “She packed her suitcase with clothes toiletries and a camera.” Solution: Items in a list need commas. The Oxford comma (before ‘and’) is standard in this course. Answer: She packed her suitcase with clothes, toiletries, and a camera. (Option 6406535934176).

Question 208 (Page 127)

Question: “The car which was parked in the driveway had a flat tire.” Number of commas required? Solution:

• The clause “which was parked in the driveway” is Restrictive (defining which car).
• Restrictive clauses do NOT take commas.
• Therefore, Zero commas. Answer: Zero (Option 6406535934181).

Question 209 (Page 127)

Question: “The restaurant had excellent reviews [BOX] but the service was disappointingly slow.” Solution: A comma is used before a coordinating conjunction (“but”) joining two independent clauses. Answer: Comma (Option 6406535934185).

Question 210 (Page 127)

Question: “She went to the store to buy milk, eggs, bread, and cheese.” Correct? Solution: Yes. List items separated by commas with an Oxford comma. Answer: Correct (Option 6406535934187).

Question 211 (Page 128)

Question: “The childrens laughter echoed…” Add apostrophe. Solution: “Children” is plural. Possessive is formed by adding ‘s. Answer: Children’s (Option 6406535934189).

---

This covers the entire English 1 - Quiz 3 (Weeks 9-12) syllabus section from the 22 Dec 2024 paper.