Simplify the Boolean expression F = C(B + C)(A + B + C).

Home / Engineering / Digital Electronics and Logic Design / Question

M

Mr. Dubey • 51.43K Points
Coach

Q.) Simplify the Boolean expression F = C(B + C)(A + B + C).

(A) c

(B) bc

(C) abc

(D) a+bc

Correct answer : Option (A) - c

Share

Discusssion

Login to discuss.

Related MCQs on Digital Electronics and Logic Design

Q. A family of network control protocols (NCPs) ____________

Q. Who introduced and marketed commercialised microcomputers?

Q. The addition 1+1 gives 0 as a result.

Q. Which generation of computer is still under development

Q. Sequential or series testing is

Q. Data mining helps in __________.

Q. Which of the following is true about weighted majority votes? 1. We want to give higher weights to better performing models 2. Inferior models can overrule the best model if collective weighted votes for inferior models is higher than best model 3. Voting is special case of weighted voting

Q. Mapping of network file system protocol to local file system is done by ____________

Q. With V(greater than 1) vertices, how many edges at most can a Directed Acyclic Graph possess?

Q. ), '*', sep= '')