Question
a.
216
b.
2
c.
14
d.
82
Posted under Discrete Mathematics
Engage with the Community - Add Your Comment
Confused About the Answer? Ask for Details Here.
Know the Explanation? Add it Here.
Q. How many minimal forms are there in the function F(A, B, C) = ∑(1, 3, 2, 5, 6, 7) if it is having cyclic prime implicants k-map?
Similar Questions
Discover Related MCQs
Q. How many states are there in combinatorial FSM?
View solution
Q. Which of the following algorithms transforms any NFA into its identical DFA?
View solution
Q. Which of the following is not a member of the set of a deterministic finite state machine?
View solution
Q. In system engineering which of the following methods bridges the gap between the two ends of system development?
View solution
Q. Optimisation of an FSM machine can be done by ________
View solution
Q. A deterministic automaton system can have ______ transition for a given state of an input symbol.
View solution
Q. Which of the following techniques refer to the equivalence of DFA and N-DFA automata?
View solution
Q. Equivalence of automata states that ____________
View solution
Q. In the operating system, newly started processes can have a start in the _________
View solution
Q. In lexical analysis of a compiler______ is used.
View solution
Suggested Topics
Are you eager to expand your knowledge beyond Discrete Mathematics? We've curated a selection of related categories that you might find intriguing.
Click on the categories below to discover a wealth of MCQs and enrich your understanding of Computer Science. Happy exploring!
.png)
