Computer Science Engineering (CSE) Exam  >  Computer Science Engineering (CSE) Tests  >  GATE Computer Science Engineering(CSE) 2025 Mock Test Series  >  Test: Boolean Algebra & Logic Gates- 1 - Computer Science Engineering (CSE) MCQ

Test: Boolean Algebra & Logic Gates- 1 - Computer Science Engineering (CSE) MCQ


Test Description

10 Questions MCQ Test GATE Computer Science Engineering(CSE) 2025 Mock Test Series - Test: Boolean Algebra & Logic Gates- 1

Test: Boolean Algebra & Logic Gates- 1 for Computer Science Engineering (CSE) 2024 is part of GATE Computer Science Engineering(CSE) 2025 Mock Test Series preparation. The Test: Boolean Algebra & Logic Gates- 1 questions and answers have been prepared according to the Computer Science Engineering (CSE) exam syllabus.The Test: Boolean Algebra & Logic Gates- 1 MCQs are made for Computer Science Engineering (CSE) 2024 Exam. Find important definitions, questions, notes, meanings, examples, exercises, MCQs and online tests for Test: Boolean Algebra & Logic Gates- 1 below.
Solutions of Test: Boolean Algebra & Logic Gates- 1 questions in English are available as part of our GATE Computer Science Engineering(CSE) 2025 Mock Test Series for Computer Science Engineering (CSE) & Test: Boolean Algebra & Logic Gates- 1 solutions in Hindi for GATE Computer Science Engineering(CSE) 2025 Mock Test Series course. Download more important topics, notes, lectures and mock test series for Computer Science Engineering (CSE) Exam by signing up for free. Attempt Test: Boolean Algebra & Logic Gates- 1 | 10 questions in 30 minutes | Mock test for Computer Science Engineering (CSE) preparation | Free important questions MCQ to study GATE Computer Science Engineering(CSE) 2025 Mock Test Series for Computer Science Engineering (CSE) Exam | Download free PDF with solutions
Test: Boolean Algebra & Logic Gates- 1 - Question 1

Which of the following boolean algebra statements represent distributive law?

Test: Boolean Algebra & Logic Gates- 1 - Question 2

Which of the foliowing boolean algebra statements represent commutative law?

1 Crore+ students have signed up on EduRev. Have you? Download the App
Test: Boolean Algebra & Logic Gates- 1 - Question 3

Which of the following logic expression is incorrect?

Detailed Solution for Test: Boolean Algebra & Logic Gates- 1 - Question 3

The expression:

Hence, (b) is the correct option.

Test: Boolean Algebra & Logic Gates- 1 - Question 4

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 for Test: Boolean Algebra & Logic Gates- 1 - Question 4


Test: Boolean Algebra & Logic Gates- 1 - Question 5

What logic gate is represented by the circuit shown below:

Test: Boolean Algebra & Logic Gates- 1 - Question 6

The boolean expression A + BC equals 

Detailed Solution for Test: Boolean Algebra & Logic Gates- 1 - Question 6

A + BC represents the distributive law which can be expanded as A + BC = (A + B) . (A + C)

Test: Boolean Algebra & Logic Gates- 1 - Question 7

A positive AND gate is also a negative

Detailed Solution for Test: Boolean Algebra & Logic Gates- 1 - Question 7

Test: Boolean Algebra & Logic Gates- 1 - Question 8

A gate in which all inputs must be low to get a high output is called a/an

Test: Boolean Algebra & Logic Gates- 1 - Question 9

Logic 1 in +ve logic system is represented by

Test: Boolean Algebra & Logic Gates- 1 - Question 10

An AND circuit

Detailed Solution for Test: Boolean Algebra & Logic Gates- 1 - Question 10

Correct Answer is B. 

55 docs|215 tests
Information about Test: Boolean Algebra & Logic Gates- 1 Page
In this test you can find the Exam questions for Test: Boolean Algebra & Logic Gates- 1 solved & explained in the simplest way possible. Besides giving Questions and answers for Test: Boolean Algebra & Logic Gates- 1, EduRev gives you an ample number of Online tests for practice

Top Courses for Computer Science Engineering (CSE)

Download as PDF

Top Courses for Computer Science Engineering (CSE)