GateQA — Free GATE CS Previous Year Questions & Mock Tests

GateQA is a free GATE CS preparation platform with 3,500+ previous-year questions (1987–2026), 36,000+ aptitude questions, full-length year-wise mock tests, a built-in GATE calculator, performance analytics, and full offline support.

Practice questions from Operating Systems, Algorithms, DBMS, Computer Networks, Theory of Computation, Discrete Mathematics, Compiler Design, Digital Logic, Computer Organization, Software Engineering, and Engineering Mathematics.

Browse GATE CS PYQs | Take Mock Tests | GATE 2027 Organizer

GateQA — Free GATE CS Preparation Platform

GateQA is a free GATE CS preparation platform featuring 3,500+ previous-year questions (1987–2026), 36,000+ aptitude questions, subject-wise and year-wise mock tests, performance analytics, and full offline support. Practice Operating Systems, Algorithms, DBMS, Computer Networks, Theory of Computation, Discrete Mathematics, Compiler Design, Digital Logic, and more.

Who will conduct GATE 2027?

Loading GateQA

Discrete Mathematics

GATE CSE 2000 | Question: 2.7

Subject: Discrete Mathematics
Paper: 2000
Let $a, b, c, d$ be propositions. Assume that the equivalence $a ⇔ ( b \vee \neg b)$ and $b ⇔c$ hold. Then the truth-value of the formula $(a ∧ b) → (a ∧ c) ∨ d$ is always
Answer: A

This static SEO snapshot loads the full interactive GateQA app when JavaScript is available.