Search Header Logo

CIT 201 - Discrete Structures

Authored by Jan Mark Garcia

Education

University

Used 2+ times

CIT 201 - Discrete Structures
AI

AI Actions

Add similar questions

Adjust reading levels

Convert to real-world scenario

Translate activity

More...

    Content View

    Student View

85 questions

Show all answers

1.

MULTIPLE CHOICE QUESTION

30 sec β€’ 1 pt

What is the minimum number of cells in a three-variable K-map?

4

6

8

16

2.

MULTIPLE CHOICE QUESTION

20 sec β€’ 1 pt

How many cells are in a four-variable K-map?

8

12

16

24

3.

MULTIPLE CHOICE QUESTION

10 sec β€’ 1 pt

What is the purpose of "Don't Care" conditions in Karnaugh maps?

To minimize literals in the solution

To represent undecidable outputs

To find essential prime implicants

To increase complexity

4.

MULTIPLE CHOICE QUESTION

20 sec β€’ 1 pt

How many adjacent cells are needed to form a group that eliminates three variables in a K-map?

2

4

8

16

5.

MULTIPLE CHOICE QUESTION

10 sec β€’ 1 pt

Which is NOT a valid grouping rule for K-maps?

Groups must be in powers of two

Groups can overlap

Groups must always be rectangular

Groups can include diagonals

6.

MULTIPLE CHOICE QUESTION

45 sec β€’ 1 pt

If a password consists of 4 letters followed by 2 digits, how many possible passwords can be made?

26*4*10^2

26*4*10*2

26*10*4

26*4+10^2

7.

MULTIPLE CHOICE QUESTION

30 sec β€’ 1 pt

What is the value of 5P3 (permutation of 5 items taken 3 at a time)?

20

60

120

10

Access all questions and much more by creating a free account

Create resources

Host any resource

Get auto-graded reports

Google

Continue with Google

Email

Continue with Email

Classlink

Continue with Classlink

Clever

Continue with Clever

or continue with

Microsoft

Microsoft

Apple

Apple

Others

Others

Already have an account?