M

Mr. Dubey • 100.69K Points
Coach

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

  • (A) a high for each input truth table condition that produces a high output
  • (B) a high output on the truth table for all low input combinations
  • (C) a low output for all possible high input conditions
  • (D) a don’t care condition for all possible input truth table combinations
Share

No solution found for this question.
Add Solution and get +2 points.

You must be Logged in to update hint/solution

Discusssion

Login to discuss.

Related MCQs

Q. How many printable characters does the ASCII character set consists of?

Q. A deadlock exists in the system if and only if the wait for graph:

Q. The number of subsets of a set containing n elements is

Q. There are two functional dependencies with the same set of attributes on the left side of the arrow: A->BC A->B This can be combined as

Q. Programmers make mistakes during coding. These mistakes are known as

Q. In layering, n layers provide service to

Q. Which of the following is false about Prim’s algorithm?

Q. Which scholar introduced the functional type of organisation?

Q. Which one of the following is a function of telecommunication software?

Q. What does the 0 membership value means in the set

Question analytics