Sets and Functions

A set is a well-defined collection of distinct objects, represented in exams through descriptive, set-builder, and tabular forms. Students must thoroughly practice fundamental operations such as union, intersection, difference, and complement. In BISE board exams, questions frequently test Venn diagrams to graphically illustrate set relations, as well as verification of core laws like De Morgan's Laws $[(A \cup B)' = A' \cap B'$ and $(A \cap B)' = A' \cup B']$, commutative properties, and associative properties. Showing clear step-by-step proofs using set-builder notation is crucial for securing full marks in long-form questions.

Moving to relations, the foundational concept is the Cartesian product ($A \times B$), which generates ordered pairs from two sets. A binary relation $R$ is simply a subset of this Cartesian product. Exam problems often require students to determine the domain (the set of all first elements) and range (the set of all second elements) of a given relation.

A function is a special type of relation where each element in the domain is paired with a unique element in the co-domain. Board exams heavily emphasize identifying and categorizing different types of functions, notably into, onto (surjective), one-one (injective), and bijection (one-one and onto) functions. Additionally, students must master finding the inverse function ($f^{-1}$) and evaluating composite functions [like $fog(x)$ or $gof(x)$], which are standard high-weightage topics in the algebra section of the paper.