GATE Computer Science Engineering(CSE) 2027 Test: Boolean Algebra & Logic
MCQ Practice Test & Solutions: Test: Boolean Algebra & Logic Gates- 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: Boolean Algebra & Logic Gates- 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.
Which of the following boolean algebra statements represent distributive law?
Which of the foliowing boolean algebra statements represent commutative law?
Which of the following logic expression is incorrect?
Detailed Solution: Question 3
Let X and Y be the input and Z be the output of a AND gate. The value of Z is given by
Detailed Solution: Question 4
What logic gate is represented by the circuit shown below:
Detailed Solution: Question 6
Detailed Solution: Question 7
A gate in which all inputs must be low to get a high output is called a/an
Logic 1 in +ve logic system is represented by
Detailed Solution: Question 10
