K-map is used for _______(a) logic minimization(b) expression maximization(c) summing of parity bits(d) logic gate creationThis question was posed to me in class test.This is a very interesting question from Boolean Algebra in division Boolean Algebra and Modeling Computations of Discrete Mathematics

K-map is used for _______(a) logic minimization(b) expression maximiza

1.	K-map is used for _______(a) logic minimization(b) expression maximization(c) summing of parity bits(d) logic gate creationThis question was posed to me in class test.This is a very interesting question from Boolean Algebra in division Boolean Algebra and Modeling Computations of Discrete Mathematics
Answer» The correct option is (a) logic minimization To explain I WOULD say: K-map(Maurice Karnaugh of Bell labs in 1953) is defined as a diagrammatic method for logic minimization and it is a PICTORIAL view of TRUTH table which shows the relationship between inputs and output. It is more EFFICIENT than Boolean algebra. K-map is a diagram made up of squares in which each square represents a minterm or MAXTERM of the logic function.

Discussion

No Comment Found

Related InterviewSolutions

Simplify the expression XZ’ + (Y + Y’Z) + XY.(a) (1+XY’)(b) YZ + XY’ + Z’(c) (X + Y +Z)(d) XY’+ Z’I have been asked this question during an interview.This key question is from Minimization of Boolean Functions topic in portion Boolean Algebra and Modeling Computations of Discrete Mathematics
Find the simplified term Y’ (X’ + Y’) (X + X’Y)?(a) XY’(b) X’Y(c) X + Y(d) X’Y’I got this question during a job interview.I would like to ask this question from Minimization of Boolean Functions topic in portion Boolean Algebra and Modeling Computations of Discrete Mathematics
In lexical analysis of a compiler______ is used.(a) DFA(b) NDFA(c) NFA(d) Turing machineThe question was asked in an interview.I need to ask this question from Modeling Computations topic in chapter Boolean Algebra and Modeling Computations of Discrete Mathematics
In the operating system, newly started processes can have a start in the _________(a) Blocked state(b) Running sate(c) Ready state(d) Exit stateThe question was posed to me in an online quiz.The doubt is from Modeling Computations topic in chapter Boolean Algebra and Modeling Computations of Discrete Mathematics
Equivalence of automata states that ____________(a) two automata accept the same set of input strings(b) two automata have same set of states(c) two automata does not contain initial input symbols(d) two automata share equal transition functionThis question was addressed to me in an interview for internship.My enquiry is from Modeling Computations in division Boolean Algebra and Modeling Computations of Discrete Mathematics
A deterministic automaton system can have ______ transition for a given state of an input symbol.(a) exactly one(b) more than one(c) no transition(d) 2n transitionI have been asked this question during an online interview.Enquiry is from Modeling Computations topic in chapter Boolean Algebra and Modeling Computations of Discrete Mathematics
Which of the following techniques refer to the equivalence of DFA and N-DFA automata?(a) subset construction(b) superset construction(c) powerset construction(d) finite field constructionI have been asked this question in an interview for job.This intriguing question comes from Modeling Computations topic in section Boolean Algebra and Modeling Computations of Discrete Mathematics
Optimisation of an FSM machine can be done by ________(a) Naive-bias algorithm(b) Huffman encoding scheme(c) Pirate-plot algorithm(d) Hopcroft minimization algorithmThis question was posed to me in an online quiz.This intriguing question originated from Modeling Computations topic in division Boolean Algebra and Modeling Computations of Discrete Mathematics
In system engineering which of the following methods bridges the gap between the two ends of system development?(a) ASM method(b) VSM method(c) Factor method(d) FSM methodThe question was asked in semester exam.This intriguing question comes from Modeling Computations in chapter Boolean Algebra and Modeling Computations of Discrete Mathematics
Which of the following is not a member of the set of a deterministic finite state machine?(a) state-transition function(b) initial state(c) input symbols(d) stackI had been asked this question in homework.The query is from Modeling Computations in section Boolean Algebra and Modeling Computations of Discrete Mathematics

Discussion

No Comment Found

Related InterviewSolutions

Reply to Comment