Digital Logic MCQ Quiz - Objective Question with Answer for Digital Logic - Download Free PDF

Last updated on Jun 12, 2025

Latest Digital Logic MCQ Objective Questions

Digital Logic Question 1:

The Octal equivalent of the binary number 1011101011 is:

  1. 7353
  2. 1353
  3. 5651
  4. 5657
  5. None of the above

Answer (Detailed Solution Below)

Option 2 : 1353

Digital Logic Question 1 Detailed Solution

Answer: Option 2

Explanation:

An octal Equivalent of a binary number is obtained by grouping 3 bits from right to left.

001 011 101 011
1 3 5 3


So Octal Equivalent: 1353

Important Points

Binary to Octal code

000

001

010

011

100

101

110

111

0

1

2

3

4

5

6

7

Digital Logic Question 2:

Which of the following is the correct octal representation of the hexadecimal number 1A3?

  1. 346
  2. 124
  3. 634
  4. 643
  5. None of the above

Answer (Detailed Solution Below)

Option 4 : 643

Digital Logic Question 2 Detailed Solution

Explanation:

Hexadecimal to Octal Conversion

Definition: Hexadecimal and octal are both positional numeral systems, widely used in computing and digital electronics. Hexadecimal (base-16) uses sixteen symbols, 0-9 and A-F, to represent values, while octal (base-8) uses eight symbols, 0-7.

To convert a hexadecimal number to its octal equivalent, it is often easiest to first convert it to binary (base-2), and then from binary to octal. This method works because both octal and hexadecimal are powers of 2 (octal is 23 and hexadecimal is 24).

Step-by-Step Solution:

Given hexadecimal number: 1A3

1. Convert Hexadecimal to Binary:

Each hexadecimal digit can be represented by a 4-bit binary number:

  • 1 (Hex) = 0001 (Binary)
  • A (Hex) = 1010 (Binary)
  • 3 (Hex) = 0011 (Binary)

So, the hexadecimal number 1A3 can be written in binary as: 0001 1010 0011

2. Group Binary Digits into Sets of Three:

Since octal is base-8 and each octal digit corresponds to 3 binary digits, we group the binary digits in sets of three, starting from the right:

  • 0001 1010 0011 (Binary)
  • 000 110 100 011 (Binary, grouped in sets of three)

3. Convert Binary Sets to Octal:

Each group of three binary digits can be converted directly to its octal equivalent:

  • 000 (Binary) = 0 (Octal)
  • 110 (Binary) = 6 (Octal)
  • 100 (Binary) = 4 (Octal)
  • 011 (Binary) = 3 (Octal)

So, the binary number 000 110 100 011 can be written in octal as: 0643

Hence, the correct octal representation of the hexadecimal number 1A3 is 643.

Important Information:

To analyze other options, let's convert the hexadecimal number 1A3 using the same method:

  • Option 1: 346
    • 346 (Octal) in binary: 011 100 110
    • Groups: 011 100 110 (Binary) = 3 4 6 (Octal)
    • Binary to Hexadecimal: 011100110 (Binary) = 1C6 (Hex)
    • 1C6 ≠ 1A3
  • Option 2: 124
    • 124 (Octal) in binary: 001 010 100
    • Groups: 001 010 100 (Binary) = 1 2 4 (Octal)
    • Binary to Hexadecimal: 001010100 (Binary) = 54 (Hex)
    • 54 ≠ 1A3
  • Option 3: 634
    • 634 (Octal) in binary: 110 011 100
    • Groups: 110 011 100 (Binary) = 6 3 4 (Octal)
    • Binary to Hexadecimal: 110011100 (Binary) = 19C (Hex)
    • 19C ≠ 1A3

Therefore, the correct option is confirmed as option 4: 643.

Digital Logic Question 3:

In a J-K flip flop, when J = 1 and K = 1 then it will be considered as:

  1. set condition
  2. reset condition
  3. no change
  4. toggle condition
  5. None of the above

Answer (Detailed Solution Below)

Option 4 : toggle condition

Digital Logic Question 3 Detailed Solution

Concept

JK flip flop:

 

The truth table of JK flipflop:

J

K

Q

0

0

0

0

0

0

1

1

0

1

0

0

0

1

1

0

1

0

0

1

1

0

1

1

1

1

0

1

1

1

1

0

 

T flip-flop is formed by combining both J and K inputs of the JK-flipflop

In the above truth table when J = K = 1, its output is toggled.

Characteristic Table of JK flip flop

J

K

Qn

Qn+1

0

0

0

0

0

0

1

1

0

1

0

0

0

1

1

0

1

0

0

1

1

0

1

1

1

1

0

1

1

1

1

0

 

Qn+1 = JQ̅n + K̅Qn

Digital Logic Question 4:

What is the simplified expression for the Boolean function F(A, B, C, D) = Σ(0, 1, 2, 4, 5, 6, 8, 9, 10, 12, 13, 14) using the K - map method? 

  1. C' + D'
  2. AC' + D'
  3. A'B'C'D' + A'BC'D + ABC'D + ABCD 
  4. A'B'C'D' + A'BC'D' + A'BCD + ABCD
  5. None of the above

Answer (Detailed Solution Below)

Option 1 : C' + D'

Digital Logic Question 4 Detailed Solution

The correct answer is C' + D'

Key PointsTo simplify the Boolean function F(A, B, C, D) using the Karnaugh Map (K-map) method, we first need to construct a 4-variable K-map and then fill in the values based on the given minterms (0, 1, 2, 4, 5, 6, 8, 9, 10, 12, 13, 14). The minterms can be represented in binary form to determine their positions on the K-map.

The K-map for F(A, B, C, D) would look like this:

 

simplified expression =C’ + D’

Hence the correct answer is C’ + D’

Digital Logic Question 5:

Demultiplexer circuit is:

  1. a decoder circuit
  2. a decoder circuit with enable input
  3. an encoder circuit with enable input
  4. an encoder circuit
  5. None of the above

Answer (Detailed Solution Below)

Option 2 : a decoder circuit with enable input

Digital Logic Question 5 Detailed Solution

De-multiplexer:

  • The demultiplexer is a combinational logic circuit designed to switch one common input line to one of several separate output lines.
  • The data distributor, known as a Demultiplexer or “Demux”, works in just the opposite way to that of the Multiplexer.
  • The demultiplexer takes one single input data line and then switches it to any one of a number of individual output lines one at a time.
  • A demultiplexer circuit is a decoder circuit with enable input.


The block diagram is as shown:

Application:

The demultiplexer converts a serial data signal at the input to parallel data at its output lines as shown below.

The function of the Demultiplexer is to switch one common data input line to any one of the 4 output data lines A to D.

Important Points

Multiplexer:

The multiplexer is a combinational logic circuit designed to switch one of several input lines to a single common output line.

  • The multiplexer or “MUX” is a combinational logic circuit designed to switch one of several input lines through a single common output line by the application of a control signal.
  • Multiplexers operate like very fast acting multiple position rotary switches connecting or controlling multiple input lines called “channels” one at a time to the output.
  • Multiplexers are used to convert parallel to serial data.

Top Digital Logic MCQ Objective Questions

Binary number 101110110 is equal to decimal number _______.

  1. 468
  2. 412
  3. 374
  4. 326

Answer (Detailed Solution Below)

Option 3 : 374

Digital Logic Question 6 Detailed Solution

Download Solution PDF
  • The correct answer is option 3, i.e., 374.
  • Binary number 101110110 is equal to decimal number 374.
  • Following method can be used to convert Binary number to Decimal number:
    1. (101110110)2 = (1 x 28) + (0 x 27) + (1 x 26) + (1 x 25) + (1 x 24) + (0 x 23) + (1 x 22) + (1 x 21) + (0 x 20)
    2. (101110110)2 = 256 + 0 + 64 + 32 + 16 + 0 + 4 + 2 + 0
    3. (101110110)2 = 374

One megabyte In base 2 (binary) Is equivalent to             .

  1. 103 bytes
  2. 104 bytes
  3. 210 bytes
  4. 220 bytes

Answer (Detailed Solution Below)

Option 4 : 220 bytes

Digital Logic Question 7 Detailed Solution

Download Solution PDF

The correct answer is 220 bytes.

Key Points

  • 1 Megabyte is equal to 1000000 bytes (decimal).
  • 1 MB = 106 B in base 10 (SI).
  • 1 Megabyte is equal to 1048576 bytes (binary).
  • 1 MB = 220 B in base 2.
  • Byte is the basic unit of digital information transmission and storage, used extensively in information technology, digital technology, and other related fields. It is one of the smallest units of memory in computer technology, as well as one of the most basic data measurement units in programming.
  • The earliest computers were made with the processor supporting 1 byte commands, because in 1 byte you can send 256 commands. 1 byte consists of 8 bits,
  • Megabyte (MB) is a unit of transferred or stored digital information, which is extensively used in information and computer technology.
  • In SI, one megabyte is equal to 1,000,000 bytes. At the same time, practically 1 megabyte is used as 220 B, which means 1,048,576 bytes.

Binary 110110101 is equal to decimal ________.

  1. 333
  2. 437
  3. 349
  4. 477

Answer (Detailed Solution Below)

Option 2 : 437

Digital Logic Question 8 Detailed Solution

Download Solution PDF

Binary 110110101 is equal to decimal 437

Calculation:

1 1 0 1 1 0 1 0 1

From rightmost first column as follows

=> (20 * 1) + (21 * 0) + (22 * 1) + (23 * 0) + (24 * 1) + (25 * 1) + (26 * 0) + (27 * 1) + (28 * 1)

=> (1) + (0) + (4) + (0) + (16) + (32) + (0) + (128) + (256)

Decimal value =>437

Convert the hexadecimal number C6 to binary number.

  1. 10010110
  2. 11000100
  3. 11000110
  4. 10100110

Answer (Detailed Solution Below)

Option 3 : 11000110

Digital Logic Question 9 Detailed Solution

Download Solution PDF

The correct answer is 11000110

Key Points

  • To convert the hexadecimal number C6 to a binary number, you can convert each hexadecimal digit to its 4-bit binary representation.
  • C in hexadecimal is 12 in decimal, which is 1100 in binary.
  • 6 in hexadecimal is 6 in decimal, which is 0110 in binary.
  • So, the binary representation of C6 is 11000110.

Additional InformationHere are the decimal numbers 1 to 15 represented in both hexadecimal and binary forms:

  •  Decimal 1: Hexadecimal 1, Binary 0001
  • Decimal 2: Hexadecimal 2, Binary 0010
  • Decimal 3: Hexadecimal 3, Binary 0011
  • Decimal 4: Hexadecimal 4, Binary 0100
  • Decimal 5: Hexadecimal 5, Binary 0101
  • Decimal 6: Hexadecimal 6, Binary 0110
  • Decimal 7: Hexadecimal 7, Binary 0111
  • Decimal 8: Hexadecimal 8, Binary 1000
  • Decimal 9: Hexadecimal 9, Binary 1001
  • Decimal 10: Hexadecimal A, Binary 1010
  • Decimal 11: Hexadecimal B, Binary 1011
  • Decimal 12: Hexadecimal C, Binary 1100
  • Decimal 13: Hexadecimal D, Binary 1101
  • Decimal 14: Hexadecimal E, Binary 1110
  • Decimal 15: Hexadecimal F, Binary 1111 

The sum of two binary numbers 1101111 and 1100101 is ______.

  1. 100011100
  2. 100000110
  3. 11110000
  4. 11010100

Answer (Detailed Solution Below)

Option 4 : 11010100

Digital Logic Question 10 Detailed Solution

Download Solution PDF

The sum of two binary numbers 1101111 and 1100101 is (11010100)2

Note: In Binary addition, 1 + 1 = 10 (0 is sum value and 1 is carry), 1 + 0 = 1, 0 + 1 = 1 and 0 + 0 = 0.

Calculation:

  1    1 1 1 1        (Carry values)

  1 1 0 1 1 1 1     (Binary number 1)

  0    1 0 0 0        (Sum values)

+1 1 0 0 1 0 1     (Binary number 2)

-------------------

1 1 0 1 0 1 0 0    (Answer)

-------------------

The Octal equivalent of the binary number 1011101011 is:

  1. 7353
  2. 1353
  3. 5651
  4. 5657

Answer (Detailed Solution Below)

Option 2 : 1353

Digital Logic Question 11 Detailed Solution

Download Solution PDF

Answer: Option 2

Explanation:

An octal Equivalent of a binary number is obtained by grouping 3 bits from right to left.

001 011 101 011
1 3 5 3


So Octal Equivalent: 1353

Important Points

Binary to Octal code

000

001

010

011

100

101

110

111

0

1

2

3

4

5

6

7

The 8-bit 2's complement form of the number -14 is ______.

  1. 11110010
  2. 00001110
  3. 10001110
  4. 01110001

Answer (Detailed Solution Below)

Option 1 : 11110010

Digital Logic Question 12 Detailed Solution

Download Solution PDF

Calculation:

14 in binary form is represented as:

1410 = (00001110)2

Taking the 1's complement of the above, we get 11110001

Adding 1 to the 1's complement, we get the 2's complement representation of the number, i.e. 11110010

Since there is a 1 in the MSB, the number is a negative number with value -14.

∴ The 2's complement of -6410 contains 7 bits.

Boolean algebra obeys

  1. commutative law only
  2. distributive law only
  3. associative law only
  4. associative, distributive and commutative law

Answer (Detailed Solution Below)

Option 4 : associative, distributive and commutative law

Digital Logic Question 13 Detailed Solution

Download Solution PDF

Name

AND Form

OR Form

Identity law

1.A = A

0 + A = A

Null Law

0.A = 0

1 + A = 1

Idempotent Law

A.A = A

A + A = A

Inverse Law

AA’ = 0

A + A’ = 1

 Commutative Law 

AB = BA

A + B = B + A

Associative Law

(AB)C

 (A + B) + C = A + (B + C) 

Distributive Law

 A + BC = (A + B)(A + C) 

A(B + C) = AB + AC

Absorption Law

A(A + B) = A

A + AB = A

De Morgan’s Law

(AB)’ = A’ + B’

(A + B)’ = A’B’

The number of 1s in the binary representation of (3 ⋆ 4096 + 15 ⋆ 256 + 5 ⋆ 16 + 3) are  

  1. 8
  2. 9
  3. 10
  4. 12

Answer (Detailed Solution Below)

Option 3 : 10

Digital Logic Question 14 Detailed Solution

Download Solution PDF

Application:

Decimal value = (3 ⋆ 4096 + 15 ⋆ 256 + 5 ⋆ 16 + 3)

It can be written as:

(2 + 1) × 212 + (8 + 4 + 2 + 20) × 28 + (4 + 1) × 24  + (2 + 1) × 20

21 × 212 + 20 × 212 + (23 + 22 + 21 + 20) × 28 + (22 + 20) × 24 + (21 + 20) × 20

This can be written as:

213 + 212 + 211 + 210 + 29 × 28 + 26 + 24 + 21 + 20

The binary representation will be:

(11111101010011)2

Which of the following pairs of octal and binary numbers are NOT equal?

  1. (111110111)2 = (767)8
  2. (110110101)2 = (665)8
  3. (10101.11)2 = (25.6)8
  4. (11010)2 = (62)8

Answer (Detailed Solution Below)

Option 4 : (11010)2 = (62)8

Digital Logic Question 15 Detailed Solution

Download Solution PDF

The correct answer is (11010)2 = (62)8

Key Points

Binary numbers and octal numbers are both used in computing. They are different ways of representing the same value - just like how "10" and "ten" are different ways of expressing the same quantity in decimal.

  • Each digit of an octal number represents three binary digits because 23 = 8. Here's the mapping:
    • "000" => "0"
    • "001" => "1"
    • "010" => "2"
    • "011" => "3"
    • "100" => "4"
    • "101" => "5"
    • "110" => "6"
    • "111" => "7"
  • Now let's convert the binary numbers to their equivalent octal numbers.
    • (111 110 111)2 = (7 6 7)8
    • (110 110 101)2 = (6 6 5)8
    • (10 101 . 110)2 = (2 5 . 6)8
    • (11 010)2 = (3 2)8 - Corrupted as the corresponding octal number should be (32)8 instead of (62)8.

Therefore, the 4th pair, (11010)2 = (62)8, is not equal.

Hot Links: all teen patti game teen patti real cash withdrawal teen patti master 2024 teen patti master update