Home
News
Colleges
Courses
Admission
Lectures
Online Test
Past Papers
Date Sheets
Results
Study Abroad
Jobs
Tutors
More
Apps
.jpg)
MCQ's Test For ECAT Computer Science Chapter 5 Boolean Algebra
Try The MCQ's Test For ECAT Computer Science Chapter 5 Boolean Algebra
-
Total Questions15
-
Time Allowed15
ECAT Computer Science Chapter 5 Boolean Algebra
00:00
Question # 1
Odd parity of a word can be conveniently tested by.
Question # 2
The number of inputs to full adder are
Question # 3
The half adder circuit has
Question # 4
Which of the following operations are used by Boolean algebra.?
Question # 5
According to Boolean algebra x + 1 = ______________
Question # 6
In a three input NAND gate, if all the inputs are 1, the output is.
Question # 7
In Boolean algebra A.A.A.A.A
Question # 8
Which of the following gate is two level logic gate.
Question # 9
According to Idempotent law , x + y = __________
Question # 10
NAND gates are preferred over others because these.
Question # 11
Boolean description for the exclusive OR gate for two inputs x and y can be written as.
Question # 12
According to absorption law x. (x+y) =
Question # 13
In Boolean algebra A.0 is
Question # 14
An OR gate has 6 input. The number of input words in its truth table are.
Question # 15
The commutative law in Boolean Algebra, where a, b and c are binary number is.
Top Scorers Of ECAT Computer Science Chapter 5 Boolean Algebra MCQ`s Test
-
A ali moid 19 - Jul - 2024 00 Min 58 Sec 60/60 -
H Husain Abbas 20 - Dec - 2024 01 Min 15 Sec 60/60 -
T Tasser Haider 28 - May - 2024 01 Min 17 Sec 60/60 -
U Usman Asif 25 - May - 2024 01 Min 17 Sec 60/60 -
R RONIN 06 - Jul - 2024 01 Min 20 Sec 60/60 -
A Alinza Waseem 04 - Jun - 2024 01 Min 50 Sec 60/60 -
A Abdullah Baloch 26 - Jul - 2024 03 Min 27 Sec 60/60 -
M Muhammad Saeed anwar 02 - Jun - 2024 04 Min 23 Sec 60/60 -
A Amna Naz 16 - Nov - 2024 04 Min 47 Sec 60/60 -
N Nitalaya Hassan 31 - Dec - 2024 01 Min 47 Sec 55/60 -
M Manoush Fatima 02 - Jun - 2024 03 Min 33 Sec 50/60 -
H Hassan Sajid 01 - Jun - 2024 04 Min 25 Sec 50/60 -
S Syed Nalain Abbas Taqvi 17 - May - 2024 01 Min 42 Sec 45/60 -
A Ahmad Khan 18 - Aug - 2024 03 Min 01 Sec 45/60 -
A Ali raza 11 - Mar - 2024 04 Min 33 Sec 45/60
ECAT Computer Sciences Chapter 5 Important MCQ's
| Sr.# | Question | Answer |
|---|---|---|
| 1 | Odd parity of a word can be conveniently tested by. |
A. OR gate
B. XOR gate
C. NOR gate
D. NAND gate
|
| 2 | The commutative law in Boolean Algebra, where a, b and c are binary number is. |
A. a+0=a
B. a+1=1
C. a+b=b+a
D. a. (b+c) = a.b +a.c.
|
| 3 | The number of inputs to full adder are |
A. 1
B. 2
C. 3
D. 4
|
| 4 | The logic device that perform Boolean multiplication is. |
A. AND gate
B. OR gate
C. Inverter
D. None of these
|
| 5 | The output will be one in case any input is one in the case of. |
A. OR gate
B. AND gate
C. NAND gate
D. NOT gate
|
| 6 | If A and B are two 1-bit numbers, what logic gates will be required to test for A=B? |
A. NOR gate
B. EXCLUSIVE OR gate
C. EXCLUSIVE NOT gate
D. OR gate
|
| 7 | NAND gates are preferred over others because these. |
A. have lower fabrication area
B. can be used to make any gate
C. consume least elctronic power
D. provide maximum density in a chip
|
| 8 | An OR gate has 6 input. The number of input words in its truth table are. |
A. 6
B. 32
C. 64
D. 128
|
| 9 | Pick up wrong logical expression | |
| 10 | Which of the following operations are used by Boolean algebra.? |
A. Boolean addition
B. Boolean multiplication
C. Boolean complementation
D. All of the above
|
Test Questions