FOL 11 · GATE PYQs (from the slides)
How to use
Attempt before expanding. Target: 1-mark ≤ 1.5 min, 2-mark ≤ 3 min. Log mistakes in FOL README.
| # | Year | Topic | Done |
|---|---|---|---|
| 1 | GATE CS 2004 | Nested translation (boys taller than girls) | [ ] |
| 2 | GATE CS 2005 | Nested translation (teacher liked by student) | [ ] |
| 3 | GATE IT 2005 | Which formula is always true | [ ] |
| 4 | GATE CS 2006 | Translation (tigers and lions) | [ ] |
| 5 | GATE CS 2007 | Which does NOT represent “not every graph is connected” | [ ] |
| 6 | GATE CS 2009 | Translation (gold and silver ornaments) | [ ] |
| 7 | GATE CS 2012 | Translation (some reals are rational) | [ ] |
| 8 | GATE CS 2013 | Translation (none of my friends are perfect) | [ ] |
| 9 | GATE CS 2013 | NOT equivalent (nested negation) | [ ] |
| 10 | GATE CS 2014 Set 3 | Translation (not all rainy days are cold) | [ ] |
| 11 | ISRO CS 2017 | Negated existential | [ ] |
Q1 · GATE CS 2004
“Some boys in the class are taller than all the girls.” taller(x, y): x is taller than y. (A) (B) (C) (D)
👁 Show answer
Answer: (D)
Outer “some boy” → ∃ with ∧. Inner “all girls” → ∀ with →. (A), (C) use ∃ with → ❌. (B) uses ∀ with ∧ — says everyone is a girl ❌. 🧠 Apply the rule at each level separately.
Q2 · GATE CS 2005
“Every teacher is liked by some student.” (A) (B) (C) (D)
👁 Show answer
Answer: (B)
(A) ∃ with →. (C) “one student likes every teacher” — too strong (order swapped). (D) “everyone is a teacher”.
Q3 · GATE IT 2005
Which is always TRUE for arbitrary predicates P, Q? (A) (B) (C) (D)
👁 Show answer
Answer: (B)
Counter-model for A, C, D — domain {x₁, x₂}: P = (T, F), Q = (F, T).
- (A) LHS: each element has P or Q → T. RHS: neither ∀P nor ∀Q → F. ❌
- (C) LHS: ∀P is F ⇒ implication T. RHS: P(x₁) → Q(x₁) = T → F ❌
- (D) LHS: ∀P = F, ∀Q = F ⇒ F ↔ F = T. RHS: P(x₁) ↔ Q(x₁) = F ❌
- (B) If every P-element is a Q-element and everything is P, then everything is Q ✅ 🧠 “Mark/Joe swap” counter-model (P and Q true on different elements) kills most wrong options.
Q4 · GATE CS 2006
“Tigers and lions attack if they are hungry or threatened.” (A) (B) (C) (D)
👁 Show answer
Answer: (D)
“Tigers and lions” = anything that is a tiger or a lion. (A) requires being both ❌. (B) says they are always hungry/threatened and attack ❌. (C) reverses the condition (“if they attack, they’re hungry”) ❌.
Q5 · GATE CS 2007
Which does NOT represent “Not every graph is connected”? (A) (B) (C) (D)
👁 Show answer
Answer: (D)
A, B, C are all . (D) says “no graph is connected” — far stronger. 🧠 “Not every” ≠ “every … not”.
Q6 · GATE CS 2009
“Gold and silver ornaments are precious.” G: gold ornament, S: silver ornament, P: precious. (A) (B) (C) (D)
👁 Show answer
Answer: (D)
“and” in the subject = or in the formula. (B) only talks about ornaments that are both gold and silver.
Q7 · GATE CS 2012
“Some real numbers are rational.” (A) (B) (C) (D)
👁 Show answer
Answer: (C)
“Some S are P” = ∃ with ∧.
Q8 · GATE CS 2013
“None of my friends are perfect.” (A) (B) (C) (D)
👁 Show answer
Answer: (D)
. (A) is “some friend is not perfect” — weaker.
Q9 · GATE CS 2013
Which is NOT logically equivalent to ? (A) (B) (C) (D)
👁 Show answer
Answer: (A) and (D) — both are non-equivalent
Given .
- (A) ❌
- (B) ✅
- (C) ✅
- (D) ❌
The question asked for “one”, but two options qualify — the slides mark both. 🧠 Method: rewrite every option as and push negations in; compare literally.
Q10 · GATE CS 2014 Set 3
“Not all rainy days are cold.” (A) (B) (C) (D)
👁 Show answer
Answer: (D)
— “some rainy day is not cold”. Slide task — English for the others:
- (A) Every day is rainy and not cold.
- (B) Every day that is not rainy is cold.
- (C) There is a day such that if it isn’t rainy, it’s cold (≡ some day is rainy or cold — almost trivially true).
Q11 · ISRO CS 2017
“It is not the case that some trigonometric functions are not periodic.” T: trigonometric, P: periodic. (A) (B) (C) (D)
👁 Show answer
Answer: (A)
“Some T are not P” = ; put ¬ in front. (≡ all trigonometric functions are periodic.)
Prev ← FOL 10 Beyond the Slides · Next → FOL 12 Practice Problems