Study guide
6.3 Basic Probability, Statistics & Data Interpretation
Ghana Armed Forces Officer Cadet Written Examination Exam
Track your progress as you read
Finished sections get a check mark.
1 Chapter 1: Orientation & GAF Officer Selection Architecture
1.1 Ghana Military Academy (GMA) Cadet Selection Overview & Regulations 1.2 Selection Phases — Screening, Aptitude Test, BFT, OLT, Medical & Final Interview 1.3 Written Examination Strategy, Competitive Scoring & Test-Taking Tactics
2 Chapter 2: Verbal Reasoning — Comprehension & Text Analysis
2.1 Military & Strategic Reading Comprehension Strategies 2.2 Drawing Inferences, Identifying Author Intent & Central Themes 2.3 Critical Text Evaluation & Logical Paragraph Coherence
3 Chapter 3: Verbal Reasoning — Grammar, Vocabulary & Usage
3.1 Lexicon Mastery — High-Frequency Vocabulary, Antonyms & Synonyms 3.2 English Grammar, Syntax, Subject-Verb Agreement & Tense Consistency 3.3 Verbal Analogies, Idiomatic Expressions & Sentence Correction
4 Chapter 4: Quantitative Aptitude — Arithmetic & Business Math
4.1 Arithmetic Operations, Number Properties & Order of Operations 4.2 Percentages, Profit and Loss, Simple and Compound Interest 4.3 Ratios, Proportions, Rates, Work and Time Problems
5 Chapter 5: Quantitative Aptitude — Algebra & Word Problems
5.1 Linear Equations, Inequalities & Simultaneous Systems 5.2 Quadratic Equations, Polynomials & Algebraic Factoring 5.3 Mathematical Word Problems & Quantitative Formulation
6 Chapter 6: Quantitative Aptitude — Geometry, Mensuration & Data
6.1 Geometric Principles — Angles, Lines, Triangles & Polygons 6.2 Mensuration — Perimeter, Area, Surface Area & Volume 6.3 Basic Probability, Statistics & Data Interpretation
7 Chapter 7: Logical Reasoning — Patterns, Sequences & Ciphers
7.1 Number, Letter & Alphanumeric Series 7.2 Coding, Decoding & Substitution Ciphers 7.3 Diagrammatic, Abstract & Matrix Pattern Recognition
8 Chapter 8: Logical Reasoning — Analytical Deduction & Arrangements
8.1 Formal Syllogisms, Venn Diagrams & Deductive Logic 8.2 Direction Sense, Distance Tracking & Cardinal Navigation 8.3 Linear and Circular Seating Arrangements & Blood Relations Logic
9 Chapter 9: General Knowledge — Ghanaian History & Governance
9.1 Pre-Colonial, Colonial Era & Ghana's Independence (1957) 9.2 The Republics, Constitutional Transitions & Key National Leaders 9.3 The 1992 Constitution, Arms of Government & Public Institutions
10 Chapter 10: General Knowledge — Geography, Defense & Security Architecture
10.1 Geography of Ghana — 16 Regions, Capitals, Physical Features & Resources 10.2 Ghana Armed Forces Structure — Army, Navy, Air Force, Command & Ranks 10.3 National Security, Peacekeeping Operations (UN/AU/ECOWAS) & Regional Security
6.3 Basic Probability, Statistics & Data Interpretation
Key Takeaways Explain This Topic AI
Classical probability is bounded between 0 and 1, with complementary event probability given by P(E') = 1 - P(E), while overlapping events require subtracting joint probability: P(A ∪ B) = P(A) + P(B) - P(A ∩ B).
Independent events follow the multiplicative product rule P(A ∩ B) = P(A) × P(B), whereas dependent events require conditional probability adjustment: P(A ∩ B) = P(A) × P(B|A).
Basic combinatorics distinguishes ordered permutations P(n, r) = n! / (n - r)! from unordered combinations C(n, r) = n! / [r!(n - r)!], which governs tactical team selection and patrol compositions.
Descriptive statistics balances central tendency against dispersion, where the median resists skewness caused by extreme rogue outliers unlike the arithmetic mean, and data interpretation requires auditing zero-baselines and axis scaling.
Last updated: October 2026
6.3 Basic Probability, Statistics & Data Interpretation
Military decision-making operates in conditions of fundamental friction and uncertainty. Whether estimating the survival probability of a communications node, configuring specialized combat teams from an available company roster, evaluating marksmanship variance across an infantry platoon, or interpreting logistics supply curves, an officer must possess keen quantitative discernment. The GAF Officer Cadet Written Examination evaluates these competencies through basic probability, combinatorics, descriptive statistics, and graphical data interpretation.
Classical Probability Fundamentals
Probability quantifies the likelihood of an outcome occurring during an unpredictable or uncertain event.
1. Sample Spaces & Classical Probability
Sample Space ( S S S ): The set of all possible distinct outcomes of a random experiment. For a standard six-sided die, S = { 1 , 2 , 3 , 4 , 5 , 6 } S = \{1, 2, 3, 4, 5, 6\} S = { 1 , 2 , 3 , 4 , 5 , 6 } , so n ( S ) = 6 n(S) = 6 n ( S ) = 6 .
Event ( E E E ): A specific subset of outcomes within the sample space S S S .
Classical Probability Formulation: When all outcomes are equally likely: P ( E ) = n ( E ) n ( S ) = Number of favorable outcomes Total number of possible outcomes P(E) = \frac{n(E)}{n(S)} = \frac{\text{Number of favorable outcomes}}{\text{Total number of possible outcomes}} P ( E ) = n ( S ) n ( E ) = Total number of possible outcomes Number of favorable outcomes
Axiomatic Bounds: For any event E E E : 0 ≤ P ( E ) ≤ 1 0 \le P(E) \le 1 0 ≤ P ( E ) ≤ 1
P ( E ) = 0 P(E) = 0 P ( E ) = 0 : Impossible event (e.g., rolling a 7 on a standard six-sided die).
P ( E ) = 1 P(E) = 1 P ( E ) = 1 : Certain event (e.g., rolling a number strictly less than 7).
2. Complementary Events
The complement of an event E E E , denoted E ′ E' E ′ or E c E^c E c , represents the event that E E E does not occur: P ( E ′ ) = 1 − P ( E ) ⟺ P ( E ) + P ( E ′ ) = 1 P(E') = 1 - P(E) \iff P(E) + P(E') = 1 P ( E ′ ) = 1 − P ( E ) ⟺ P ( E ) + P ( E ′ ) = 1
Tip
In tactical aptitude questions involving phrases like "at least one failure occurs" or "at least one target is hit" , calculating the direct outcomes is often laborious. Instead, calculate the probability of the complement ( none occur ) and subtract from 1: P ( ≥ 1 hit ) = 1 − P ( 0 hits ) P(\ge 1 \text{ hit}) = 1 - P(0 \text{ hits}) P ( ≥ 1 hit ) = 1 − P ( 0 hits )
3. Addition Rules for Probability
Mutually Exclusive (Disjoint) Events: Two events that cannot occur simultaneously ( A ∩ B = ∅ A \cap B = \emptyset A ∩ B = ∅ ). If A A A occurs, B B B cannot occur: P ( A ∪ B ) = P ( A ) + P ( B ) P(A \cup B) = P(A) + P(B) P ( A ∪ B ) = P ( A ) + P ( B ) Example: Drawing a card that is either an Ace or a King from a standard deck: P ( Ace ∪ King ) = 4 52 + 4 52 = 8 52 = 2 13 P(\text{Ace} \cup \text{King}) = \frac{4}{52} + \frac{4}{52} = \frac{8}{52} = \frac{2}{13} P ( Ace ∪ King ) = 52 4 + 52 4 = 52 8 = 13 2 .
Non-Mutually Exclusive (Overlapping) Events: Two events that can occur simultaneously ( A ∩ B ≠ ∅ A \cap B \ne \emptyset A ∩ B = ∅ ): P ( A ∪ B ) = P ( A ) + P ( B ) − P ( A ∩ B ) P(A \cup B) = P(A) + P(B) - P(A \cap B) P ( A ∪ B ) = P ( A ) + P ( B ) − P ( A ∩ B ) The intersection term P ( A ∩ B ) P(A \cap B) P ( A ∩ B ) must be subtracted to prevent double-counting shared outcomes. Worked Example — Overlapping Events:
Question: In a cadet intake of 100 candidates, 40 possess engineering backgrounds, 30 hold military cadet corps experience, and 12 possess both qualifications. What is the probability that a randomly chosen cadet holds at least one of these two qualifications?
Calculation:
- P(Eng) = 40/100 = 0.40
- P(Cadet) = 30/100 = 0.30
- P(Eng ∩ Cadet) = 12/100 = 0.12
- P(Eng ∪ Cadet) = P(Eng) + P(Cadet) - P(Eng ∩ Cadet)
= 0.40 + 0.30 - 0.12 = 0.58 (or 58%).
Conclusion: The probability of selecting a candidate with at least one qualification is 0.58.
Compound Events: Independent vs. Dependent & Conditional Rules
Compound events involve the simultaneous or sequential occurrence of two or more distinct trials.
1. Independent Events & Multiplicative Rule
Two events A A A and B B B are independent if the occurrence of event A A A has no influence on the probability of event B B B . The joint probability of both events occurring is the product of their individual probabilities: P ( A ∩ B ) = P ( A ) × P ( B ) P(A \cap B) = P(A) \times P(B) P ( A ∩ B ) = P ( A ) × P ( B ) For n n n mutually independent events: P ( A 1 ∩ A 2 ∩ ⋯ ∩ A n ) = P ( A 1 ) × P ( A 2 ) × ⋯ × P ( A n ) P(A_1 \cap A_2 \cap \dots \cap A_n) = P(A_1) \times P(A_2) \times \dots \times P(A_n) P ( A 1 ∩ A 2 ∩ ⋯ ∩ A n ) = P ( A 1 ) × P ( A 2 ) × ⋯ × P ( A n )
2. Dependent Events & Conditional Probability
Two events are dependent if the occurrence of event A A A alters the likelihood of event B B B . The conditional probability of event B B B given that event A A A has already occurred is denoted P ( B ∣ A ) P(B|A) P ( B ∣ A ) : P ( B ∣ A ) = P ( A ∩ B ) P ( A ) , provided P ( A ) > 0 P(B|A) = \frac{P(A \cap B)}{P(A)}, \quad \text{provided } P(A) > 0 P ( B ∣ A ) = P ( A ) P ( A ∩ B ) , provided P ( A ) > 0
3. General Multiplication Rule
For any two events (whether independent or dependent): P ( A ∩ B ) = P ( A ) × P ( B ∣ A ) P(A \cap B) = P(A) \times P(B|A) P ( A ∩ B ) = P ( A ) × P ( B ∣ A )
Sampling With Replacement: The sampled item is returned to the pool before the next draw. Sample space size remains constant; events are independent.
Sampling Without Replacement: The sampled item is removed from the pool. Sample space decreases; events are dependent.
Counting Principles: Permutations vs. Combinations
Combinatorics establishes systematic rules for determining the size of large sample spaces without listing individual outcomes.
1. Fundamental Counting Principle
If a composite task consists of k k k sequential stages, where stage 1 can be completed in n 1 n_1 n 1 ways, stage 2 in n 2 n_2 n 2 ways, ..., and stage k k k in n k n_k n k ways, the total number of distinct ways to complete the entire sequence is: N = n 1 × n 2 × n 3 × ⋯ × n k N = n_1 \times n_2 \times n_3 \times \dots \times n_k N = n 1 × n 2 × n 3 × ⋯ × n k
2. Factorial Notation
For any positive integer n n n : n ! = n × ( n − 1 ) × ( n − 2 ) × ⋯ × 2 × 1 n! = n \times (n - 1) \times (n - 2) \times \dots \times 2 \times 1 n ! = n × ( n − 1 ) × ( n − 2 ) × ⋯ × 2 × 1 By mathematical definition: 0 ! = 1 0! = 1 0 ! = 1 and 1 ! = 1 1! = 1 1 ! = 1 .
3. Permutations (Order Matters)
A permutation is an arrangement of r r r objects selected from a set of n n n distinct objects in a specific, ordered sequence. Changing the order creates a distinct outcome: P ( n , r ) = n P r = n ! ( n − r ) ! P(n, r) = {}^n P_r = \frac{n!}{(n - r)!} P ( n , r ) = n P r = ( n − r )! n !
Special Case: Arranging all n n n distinct objects in a linear sequence: P ( n , n ) = n ! P(n, n) = n! P ( n , n ) = n !
Permutations with Repetition: The number of distinct linear arrangements of n n n items containing p p p identical items of type 1, q q q identical items of type 2, etc.: Arrangements = n ! p ! × q ! × r ! \text{Arrangements} = \frac{n!}{p! \times q! \times r!} Arrangements = p ! × q ! × r ! n !
4. Combinations (Order Does NOT Matter)
A combination is a selection of r r r objects chosen from a pool of n n n distinct objects where the internal sequence or order of selection is irrelevant: C ( n , r ) = n C r = ( n r ) = n ! r ! ( n − r ) ! = P ( n , r ) r ! C(n, r) = {}^n C_r = \binom{n}{r} = \frac{n!}{r!(n - r)!} = \frac{P(n, r)}{r!} C ( n , r ) = n C r = ( r n ) = r ! ( n − r )! n ! = r ! P ( n , r )
Key Symmetry Property: C ( n , r ) = C ( n , n − r ) C(n, r) = C(n, n - r) C ( n , r ) = C ( n , n − r ) For example: C ( 10 , 8 ) = C ( 10 , 2 ) = 10 × 9 2 × 1 = 45 C(10, 8) = C(10, 2) = \frac{10 \times 9}{2 \times 1} = 45 C ( 10 , 8 ) = C ( 10 , 2 ) = 2 × 1 10 × 9 = 45 .
Dimension Permutations ( P ( n , r ) P(n, r) P ( n , r ) ) Combinations ( C ( n , r ) C(n, r) C ( n , r ) )
Role of Sequence Order is critical ( A B ≠ B A AB \ne BA A B = B A ) Order is irrelevant ( A B = B A AB = BA A B = B A )
Governing Formula n ! ( n − r ) ! \frac{n!}{(n - r)!} ( n − r )! n ! n ! r ! ( n − r ) ! \frac{n!}{r!(n - r)!} r ! ( n − r )! n !
Relative Magnitude Always larger: P ( n , r ) = r ! × C ( n , r ) P(n, r) = r! \times C(n, r) P ( n , r ) = r ! × C ( n , r ) Always smaller: C ( n , r ) = P ( n , r ) r ! C(n, r) = \frac{P(n, r)}{r!} C ( n , r ) = r ! P ( n , r )
Military Examples Roster assignment of specific posts (Commander, XO, S-3); radio call sign passwords; security codes Selecting 4 scouts from a 12-man squad; forming an inspection board; picking guard details
Descriptive Statistics: Central Tendency & Dispersion
Descriptive statistics summarizes and describes the empirical characteristics of quantitative datasets.
1. Measures of Central Tendency
Arithmetic Mean (Average): The sum of all numerical values divided by the total count n n n : x ˉ = ∑ i = 1 n x i n \bar{x} = \frac{\sum_{i=1}^n x_i}{n} x ˉ = n ∑ i = 1 n x i Sensitivity: Highly vulnerable to extreme outliers. A single rogue high or low score pulls the mean substantially away from the cluster.
Weighted Mean: When different values carry differing operational importance or frequencies: x ˉ w = ∑ i = 1 k ( w i x i ) ∑ i = 1 k w i \bar{x}_w = \frac{\sum_{i=1}^k (w_i x_i)}{\sum_{i=1}^k w_i} x ˉ w = ∑ i = 1 k w i ∑ i = 1 k ( w i x i ) For example, in a hypothetical selection scheme where a written test carries weight w 1 = 40 % w_1 = 40\% w 1 = 40% , a fitness test w 2 = 30 % w_2 = 30\% w 2 = 30% , and an interview w 3 = 30 % w_3 = 30\% w 3 = 30% , the composite score is a weighted mean. (GAF does not publish how its selection phases are scored.)
Median: The exact middle numerical value when data points are arranged in ascending or descending numerical order:
If n n n is odd : The median is the single value located at position n + 1 2 \frac{n + 1}{2} 2 n + 1 .
If n n n is even : The median is the arithmetic mean of the two central values located at positions n 2 \frac{n}{2} 2 n and n 2 + 1 \frac{n}{2} + 1 2 n + 1 . Robustness: The median is non-parametric and resistant to extreme outliers. It represents the true center of skewed distributions.
Mode: The specific value or category that appears with the highest frequency in the dataset.
A dataset may have one mode ( unimodal ), two modes ( bimodal ), multiple modes ( multimodal ), or no mode if all values occur with equal frequency.
2. Measures of Dispersion
Range: The simplest measure of spread: Range = Maximum Value − Minimum Value \text{Range} = \text{Maximum Value} - \text{Minimum Value} Range = Maximum Value − Minimum Value
Variance ( σ 2 \sigma^2 σ 2 or s 2 s^2 s 2 ): The mean of the squared deviations from the arithmetic mean: Population Variance: σ 2 = ∑ ( x i − μ ) 2 N \text{Population Variance: } \sigma^2 = \frac{\sum (x_i - \mu)^2}{N} Population Variance: σ 2 = N ∑ ( x i − μ ) 2 Sample Variance: s 2 = ∑ ( x i − x ˉ ) 2 n − 1 \text{Sample Variance: } s^2 = \frac{\sum (x_i - \bar{x})^2}{n - 1} Sample Variance: s 2 = n − 1 ∑ ( x i − x ˉ ) 2
Standard Deviation ( σ \sigma σ or s s s ): The positive square root of the variance, expressed in the same physical units as the original data: σ = σ 2 , s = s 2 \sigma = \sqrt{\sigma^2}, \quad s = \sqrt{s^2} σ = σ 2 , s = s 2
A low standard deviation indicates tightly grouped data (e.g., tight rifle shot groupings demonstrating high marksmanship consistency).
A high standard deviation indicates broad dispersion and inconsistency across the tested unit.
Data Interpretation (DI): Visual Charts & Analysis
Data Interpretation assesses an officer's ability to extract, synthesize, and calculate quantitative metrics from visual graphics under tight time limits.
1. Graphical Formats on the Examination
Data Tables: Systematic rows and columns displaying absolute numerical counts or percentages. Always check column totals and unit legends first.
Bar Charts (Histograms & Clustered Bars): Categorical comparisons displayed as vertical or horizontal rectangles. Bar length directly corresponds to frequency or magnitude.
Line Graphs: Continuous trend tracking across temporal intervals (e.g., fuel usage over 30 days). The slope of the line segment indicates the rate of change: Rate of Change = Δ y Δ x = y 2 − y 1 x 2 − x 1 \text{Rate of Change} = \frac{\Delta y}{\Delta x} = \frac{y_2 - y_1}{x_2 - x_1} Rate of Change = Δ x Δ y = x 2 − x 1 y 2 − y 1
Pie Charts: Circular diagrams representing the proportional breakdown of a whole (100% or 360 ∘ 360^\circ 36 0 ∘ ): Sector Angle θ = ( Component Value Total Value ) × 360 ∘ \text{Sector Angle } \theta = \left(\frac{\text{Component Value}}{\text{Total Value}}\right) \times 360^\circ Sector Angle θ = ( Total Value Component Value ) × 36 0 ∘ Component Value = ( θ 360 ∘ ) × Total Value \text{Component Value} = \left(\frac{\theta}{360^\circ}\right) \times \text{Total Value} Component Value = ( 36 0 ∘ θ ) × Total Value
2. Essential Mathematical Operations in DI
Percentage Share: Share ( % ) = Part Whole × 100 \text{Share } (\%) = \frac{\text{Part}}{\text{Whole}} \times 100 Share ( % ) = Whole Part × 100
Percentage Increase or Decrease: % Change = New Value − Base Value Base Value × 100 \% \text{ Change} = \frac{\text{New Value} - \text{Base Value}}{\text{Base Value}} \times 100 % Change = Base Value New Value − Base Value × 100
Ratio Analysis: Expressing two metrics in simplified lowest terms ( A : B = A B A : B = \frac{A}{B} A : B = B A ).
3. Identifying Statistical Distortion and Scale Manipulation
Exam questions frequently present misleading charts designed to test critical analytical evaluation:
Truncated Vertical Axis (Broken Baseline): When the vertical axis does not begin at zero, small relative changes appear visually magnified as massive spikes or collapses.
Disproportionate 3D Slices: Three-dimensional perspective in pie charts makes slices positioned in the foreground appear artificially larger than identical or larger slices positioned in the background.
Dual-Scale Manipulation: Plotting two curves with incompatible left and right vertical scales to falsely imply correlation or equivalence.