Computer Science Engineering (CSE) Exam  >  Computer Science Engineering (CSE) Test  >  GATE Computer Science Engineering(CSE) 2027 Mock Test Series  >  Test: Discrete Mathematics - 1 - Computer Science Engineering (CSE) MCQ

GATE Computer Science Engineering(CSE) 2027 Test: Discrete Mathematics


MCQ Practice Test & Solutions: Test: Discrete Mathematics - 1 (10 Questions)

You can prepare effectively for Computer Science Engineering (CSE) GATE Computer Science Engineering(CSE) 2027 Mock Test Series with this dedicated MCQ Practice Test (available with solutions) on the important topic of "Test: Discrete Mathematics - 1". These 10 questions have been designed by the experts with the latest curriculum of Computer Science Engineering (CSE) 2026, to help you master the concept.

Test Highlights:

  • - Format: Multiple Choice Questions (MCQ)
  • - Duration: 30 minutes
  • - Number of Questions: 10

Sign up on EduRev for free to attempt this test and track your preparation progress.

Test: Discrete Mathematics - 1 - Question 1

Which of the following statement is a proposition?

Detailed Solution: Question 1

Only this statement has got the truth value which is false.

Test: Discrete Mathematics - 1 - Question 2

Which of the following option is true?

Detailed Solution: Question 2

Hypothesis is false, thus the whole statement is true.

Test: Discrete Mathematics - 1 - Question 3

Let P: I am in Bangalore.; Q: I love cricket.; then q -> p(q implies p) is?

Detailed Solution: Question 3

Q is hypothesis and P is conclusion. So the compound statement will be if hypothesis then conclusion.

Test: Discrete Mathematics - 1 - Question 4

Let P: I am in Delhi.; Q: Delhi is clean.; then q ^ p(q and p) is?

Detailed Solution: Question 4

Connector should be ‘and’, that is q and p.

Test: Discrete Mathematics - 1 - Question 5

Let
P: We should be honest.,
Q: We should be dedicated.,
R: We should be overconfident.
Then
‘We should be honest or dedicated but not overconfident.’ is best represented by?

Detailed Solution: Question 5

The third part of the statement is negated, hence negation operator is used, for (‘or’ –V) is used and for(’but’- ∧).

Test: Discrete Mathematics - 1 - Question 6

The compound propositions p and q are called logically equivalent if ________ is a tautology.

Detailed Solution: Question 6

Definition of logical equivalence.

Test: Discrete Mathematics - 1 - Question 7

p ∨ q is logically equivalent to ________

Detailed Solution: Question 7

(p ∨ q) ↔ (¬p → q) is tautology.

Test: Discrete Mathematics - 1 - Question 8

p ∧ q is logically equivalent to ________

Detailed Solution: Question 8

(p ∧ q) ↔ (¬(p → ¬q)) is tautology.

Test: Discrete Mathematics - 1 - Question 9

p ↔ q is logically equivalent to ________

Detailed Solution: Question 9

(p ↔ q) ↔ ((p → q) ∧ (q → p)) is tautology.

Test: Discrete Mathematics - 1 - Question 10

¬ (p ↔ q) is logically equivalent to

Detailed Solution: Question 10

(¬ (p ↔ q)) ↔ (p ↔ ¬q) is tautology.

56 docs|215 tests
Information about Test: Discrete Mathematics - 1 Page
In this test you can find the Exam questions for Test: Discrete Mathematics - 1 solved & explained in the simplest way possible. Besides giving Questions and answers for Test: Discrete Mathematics - 1, EduRev gives you an ample number of Online tests for practice
Download as PDF