Interior Design Entrance /General Awareness & Aptitude

Reasoning

Logical & Verbal Aptitude · free study notes

Interior Design Entrance – General Awareness & Aptitude

Topic: Reasoning

(MIT‑level, first‑principles treatment for exam preparation)

Objective – Equip you with a rigorous, mathematically grounded understanding of reasoning types, their formal underpinnings, edge‑case pitfalls, and a set of challenging problems that mirror the difficulty of entrance‑level exams.


Table of Contents

# Section Sub‑topics
1 Foundations of Reasoning Logic, set theory, probability
2 Deductive Reasoning Truth tables, proof strategies
3 Inductive Reasoning Generalization, hypothesis testing
4 Spatial Reasoning Transformations, symmetry, tessellation
5 Quantitative Reasoning Arithmetic, algebra, combinatorics
6 Edge Cases & Common Pitfalls Ambiguity, hidden assumptions
7 Practice Problems Sample questions + solutions
8 Challenge Problem A multi‑layer reasoning puzzle
9 Key Take‑aways Quick‑recall cheat sheet

1. Foundations of Reasoning

1.1 Formal Logic

  • Propositional Logic

    • Syntax: p, q, r … are propositional variables.
    • Connectives: ¬ (not), ∧ (and), ∨ (or), → (implies), ↔ (iff).
    • Truth Tables: Enumerate all valuations to determine truth value of compound statements.
  • Predicate Logic (First‑Order Logic)

    • Adds quantifiers ∀ (for all) and ∃ (exists).
    • Example: ∀x (P(x) → Q(x)).
  • Inference Rules

    • Modus ponens, Modus tollens, Hypothetical syllogism, Disjunctive syllogism, etc.
    • Proof by Contradiction: Assume the negation of the desired conclusion; derive a contradiction.

1.2 Set Theory Basics

  • Elements, Subsets, Power Sets

    • A ⊆ B iff every element of A is in B.
    • P(A) denotes the set of all subsets of A.
  • Cardinality

    • Finite sets: |A| counts elements.
    • Countable vs uncountable infinities (not needed for exams, but useful for deeper reasoning).
  • Operations

    • Union, intersection, difference, complement.
    • De Morgan’s Laws:
      ¬(A ∪ B) = ¬A ∩ ¬B
      ¬(A ∩ B) = ¬A ∪ ¬B
      

1.3 Probability – Conditioning & Independence

  • Conditional Probability

    • P(A|B) = P(A ∩ B) / P(B) (provided P(B) > 0).
  • Independence

    • P(A ∩ B) = P(A)P(B) ⇔ P(A|B) = P(A).
  • Bayes’ Theorem

    • P(A|B) = [P(B|A)P(A)] / P(B) – crucial for problems involving hidden variables.

2. Deductive Reasoning

2.1 From Premises to Conclusion

  • Structure:
    Premise 1: P
    Premise 2: P → Q
    Conclusion: Q
    
  • Validity vs Soundness
    • Valid if the conclusion follows from premises regardless of truth.
    • Sound if premises are true and conclusion is valid.

2.2 Truth Tables – Exhaustive Verification

  • Example: Evaluate validity of [(P ∧ Q) → R] → [(P → R) ∨ (Q → R)].
    • Build a table with all 8 valuations of P, Q, R.
    • Observe rows where antecedent true but consequent false → invalid.

2.3 Proof Techniques

  • Direct Proof – Assume premises, derive conclusion step‑by‑step.
  • Proof by Contradiction – Assume ¬Conclusion, derive False.
  • Mathematical Induction – Base case + inductive step:
    • For all n ≥ 1, P(n) → P(n+1).

2.4 Edge Cases

  • Vacuous Truth: ∀x (x ∈ ∅ → P(x)) is true because the antecedent is always false.
  • Non‑exclusive “or”: P ∨ Q is true if at least one of P or Q is true, not necessarily exclusive.

3. Inductive Reasoning

3.1 Generalization

  • Observe patterns → conjecture a general rule → test against counter‑examples.

3.2 Hypothesis Testing

  • Null Hypothesis (H₀): No effect or relationship.
  • Alternative Hypothesis (H₁): Effect exists.

3.3 Error Types

  • Type I: Reject H₀ when it is true.
  • Type II: Fail to reject H₀ when H₁ is true.

3.4 Edge Cases

Your note

Page 1

Doubt hai is topic me?

Free AI teacher se poocho — 24/7, step by step.