Computer Knowledge

Digital Logic and Microprocessors

749 Questions

Digital logic and microprocessors form the core of computer science, covering logic gates, combinational and sequential circuits, and CPU architecture. These topics are crucial for computer knowledge sections in technical exams. Test your digital electronics basics here.

Logic gates and circuitsCombinational vs sequential circuitsMicroprocessor instructionsTruth tables and boolean functions

Digital Logic and Microprocessors Questions

Multiple choice

Complement output is one of the output in a

  1. half adder

  2. full adder

  3. flip-flop

  4. none of these
Reveal answer Fill a bubble to check yourself
C Correct answer
Explanation

Flip-flops are sequential circuits that provide complementary outputs (Q and Q-bar). Adders are combinational circuits that do not have complementary outputs.

Multiple choice

A flip-flop stores _____ bit(s).

  1. 1

  2. 2

  3. 3

  4. 4
Reveal answer Fill a bubble to check yourself
A Correct answer
Explanation

A basic flip-flop is a bistable multivibrator capable of storing exactly one bit of binary information.

Multiple choice

Flip-flop is a _____ element.

  1. storage

  2. control

  3. process

  4. none of these
Reveal answer Fill a bubble to check yourself
A Correct answer
Explanation

A flip-flop is a fundamental sequential logic circuit used as a basic storage element for binary data.

Multiple choice

In boolean algebra, x + 1 = _____

  1. 0

  2. 1

  3. x

  4. y
Reveal answer Fill a bubble to check yourself
B Correct answer
Explanation

In Boolean algebra, the null element law states that any variable ORed with 1 results in 1 (x + 1 = 1).

Multiple choice

In boolean algebra, x + x = _____

  1. 0

  2. 1

  3. x

  4. y
Reveal answer Fill a bubble to check yourself
C Correct answer
Explanation

According to the idempotent law for OR, any variable ORed with itself results in the same variable. Therefore, x + x equals x.

Multiple choice

In boolean algebra, x + x' = _____

  1. 0

  2. 1

  3. x

  4. y
Reveal answer Fill a bubble to check yourself
B Correct answer
Explanation

According to the complement law, a variable ORed with its complement always results in 1, because one of the two must be true.

Multiple choice

In boolean algebra, x + y = ____

  1. x

  2. y

  3. x + y

  4. y + x
Reveal answer Fill a bubble to check yourself
D Correct answer
Explanation

The commutative law states that the order of operands in an OR operation does not change the result. Therefore, x + y is equivalent to y + x.

Multiple choice

In boolean algebra, x.(y.z) = _____

  1. x

  2. y

  3. x.y

  4. (x.y).z
Reveal answer Fill a bubble to check yourself
D Correct answer
Explanation

The associative law states that when performing the same operation (AND) on three variables, the grouping does not change the result. Thus, x . (y . z) equals (x . y) . z.

Multiple choice

In boolean algebra, x + (y + z) = ______

  1. x

  2. y

  3. x + y

  4. (x + y) + z
Reveal answer Fill a bubble to check yourself
D Correct answer
Explanation

The associative law states that when performing the same operation (OR) on three variables, the grouping does not change the result. Thus, x + (y + z) equals (x + y) + z.

Multiple choice

In boolean algebra, x + yz = _____

  1. x

  2. y

  3. x + y

  4. (x + y) (x + z)
Reveal answer Fill a bubble to check yourself
D Correct answer
Explanation

The distributive law states that x + (y . z) equals (x + y) . (x + z). This is a fundamental property for expanding boolean expressions.

Multiple choice

In boolean algebra, (x + y)' = ____

  1. x

  2. y

  3. x'y'

  4. xy
Reveal answer Fill a bubble to check yourself
C Correct answer
Explanation

De Morgan's law states that the complement of an OR expression is equal to the AND of the individual complements. Thus, (x + y)' equals x' . y'.