ECAT Pre Computer Science MCQ Test For Computer Chapter 5 With Answer

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

Question Image
Question # 2

Question Image
Question # 3

According to Boolean algebra x + 1 = ______________

Question # 4

Logical multiplication refers to operation of.

Question # 5

In a three input NAND gate, if all the inputs are 1, the output is.

Question # 6

An AND gate will function as OR if.

Question # 7

Question Image
Question # 8

The half adder circuit has

Question # 9

An OR gate has 6 input. The number of input words in its truth table are.

Question # 10

The number of inputs to full adder are

Question # 11

NAND gates are preferred over others because these.

Question # 12

Boolean algebra is also known as.

Question # 13

Boolean algebra use which of the following to represent arithmetic quantities.

Question # 14

Which of the following statement is true in the case of AND gate with input A and B.

Question # 15

According to aborption law x+x.y=

Prepare Complete Set Wise ECAT Computer Science Chapter 5 Boolean Algebra MCQs Online With Answers


Topic Test

00:00

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 An AND gate will function as OR if.
A. all the inputs to the gates are "I"
B. all the inputs are "O"
C. a Not gate is added to it
D. all the inputs and outputs are complemented
3
Question Image
A. x . y
B. x + y
C. x . y
D. x . y
4 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.
5
Question Image
A. A + B + C + D
C. A BC D
D. A + B + C + D
6 The 'Boolean Algebra' is based on the premise that
A. there are two states
B. differential equations can be solved by analog circuits.
C. either a statement is true or false
D. arithmetic operations can be carried out
7 The heart of analog to digital converter (ADC) is
A. comparator
B. pulse generator
C. voltage source
D. current source
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
Question Image
A. x + y
10 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

Test Questions

Is this page helpful?