DIGITAL ELECTRONICS QUIZ 1

DIGITAL ELECTRONICS QUIZ 1

University

10 Qs

quiz-placeholder

Similar activities

Chapter 3 Logic Gates

Chapter 3 Logic Gates

University

7 Qs

Bab 5 dan 6

Bab 5 dan 6

University

14 Qs

TUTORIAL : THEORY OF PRODUCTION

TUTORIAL : THEORY OF PRODUCTION

University

12 Qs

Before the conference: FROM CONTACT  TO CONTRACT

Before the conference: FROM CONTACT TO CONTRACT

University

10 Qs

Linear Integrated Circuits - Quiz 1

Linear Integrated Circuits - Quiz 1

University

10 Qs

Co-planning: TRUTH or MYTH

Co-planning: TRUTH or MYTH

University - Professional Development

9 Qs

Repaso Semana 10 Sesión 2

Repaso Semana 10 Sesión 2

University

8 Qs

ENT116 Quiz 5%

ENT116 Quiz 5%

University - Professional Development

11 Qs

DIGITAL ELECTRONICS QUIZ 1

DIGITAL ELECTRONICS QUIZ 1

Assessment

Quiz

Other

University

Hard

Created by

SKk Kss

Used 3+ times

FREE Resource

10 questions

Show all answers

1.

MULTIPLE CHOICE QUESTION

20 sec • 1 pt

1. Which statement below best describes a Karnaugh map?

It is simply a rearranged truth table

The Karnaugh map eliminates the need for using NAND and NOR gates

Variable complements can be eliminated by using Karnaugh maps

A Karnaugh map can be used to replace Boolean rules

2.

MULTIPLE CHOICE QUESTION

2 mins • 1 pt

Which of the examples below expresses the commutative law of multiplication?

A + B = B + A

A • B = B + A

A • (B • C) = (A • B) • C

A • B = B • A

3.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

The Boolean expression Y = (AB)’ is logically equivalent to what single gate?

NAND

NOR

AND

OR

4.

MULTIPLE CHOICE QUESTION

1 min • 1 pt

The observation that a bubbled input OR gate is interchangeable with a bubbled output AND gate is referred to as:

A Karnaugh map

DeMorgan’s second theorem

The commutative law of addition

The associative law of multiplication

5.

MULTIPLE CHOICE QUESTION

1 min • 1 pt

Each “1” entry in a K-map square represents:

A HIGH for each input truth table condition that produces a HIGH output

A HIGH output on the truth table for all LOW input combinations

A LOW output for all possible HIGH input conditions

A DON’T CARE condition for all possible input truth table combinations

6.

MULTIPLE CHOICE QUESTION

1 min • 1 pt

Each “0” entry in a K-map square represents:

A HIGH output on the truth table for all LOW input combinations

A HIGH output on the truth table for all LOW input combinations

A LOW output for all possible HIGH input conditions

A DON’T CARE condition for all possible input truth table combinations

7.

MULTIPLE CHOICE QUESTION

1 min • 1 pt

Which of the following statements accurately represents the two BEST methods of logic circuit simplification?

Actual circuit trial and error evaluation and waveform analysis

Karnaugh mapping and circuit waveform analysis

Boolean algebra and Karnaugh mapping

Boolean algebra and actual circuit trial and error evaluation

Create a free account and access millions of resources

Create resources
Host any resource
Get auto-graded reports
or continue with
Microsoft
Apple
Others
By signing up, you agree to our Terms of Service & Privacy Policy
Already have an account?