adplus-dvertising
frame-decoration

Question

The simplified function in product of sums of Boolean function F(W, X, Y, Z) = Σ(0, 1, 2, 5, 8, 9, 10) is

a.

(W' + X') (Y' + Z') (X' + Z)

b.

(W' + X') (Y' + Z') (X' + Z')

c.

(W' + X') (Y' + Z) (X' + Z)

d.

(W' + X') (Y + Z') (X' + Z)

Posted under UGC NET computer science question paper Computer Arithmetic

Answer: (a).(W' + X') (Y' + Z') (X' + Z)

Engage with the Community - Add Your Comment

Confused About the Answer? Ask for Details Here.

Know the Explanation? Add it Here.

Q. The simplified function in product of sums of Boolean function F(W, X, Y, Z) = Σ(0, 1, 2, 5, 8, 9, 10) is
Add Comment

Similar Questions

Discover Related MCQs

Q. If an integer needs two bytes of storage, then the maximum value of a signed integer is

View solution

Q. If an integer needs two bytes of storage, then the maximum value of unsigned integer is

View solution

Q. Negative numbers cannot be represented in

View solution

Q. X – = Y + 1 means

View solution

Q. The absorption law in Boolean algebra say that

View solution

Q. The number of 1’s present in the binary representation of

10 × 256 + 5 × 16 + 5 is

View solution

Q. The hexadecimal number equivalent to (1762.46)8 is

View solution

Q. (A + B)(AB)’ is equivalent to

View solution

Q. Encoding of data bits 0011 into 7-bit even Parity Hamming Code is

View solution

Q. What is decimal equivalent of BCD 11011.1100?

View solution

Q. The simplified form of the Boolean expression (X+Y+XY)(X+Z) is

View solution

Q. The answer of the operation (10111)2 * (1110)2 in hex equivalence is

View solution

Q. How many 1’s are present in the binary representation of

3 × 512 + 7 × 64 + 5 × 8 + 3

View solution

Q. The Boolean expression x’y’z+yz+xz is equivalent to:

View solution

Q. The octal equivalent of hexadecimal (A.B)16 is:

View solution

Q. The dual of the switching function x+yz is:

View solution

Q. The octal equivalent of the hexadecimal number FF is:

View solution

Q. The idempotent law in Boolean algebra says that:

View solution

Q. Simplified form of Boolean expression xy+(~x)z+yz is:

View solution

Q. In order to build a MOD-18 counter, the minimum number of flip flops needed is equal to:

View solution
View All MCQs on Computer Arithmetic

Suggested Topics

Are you eager to expand your knowledge beyond Computer Arithmetic? 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!

Microprocessor

Understand the heart of your computer with our Microprocessor MCQs. Topics include...

Embedded Systems

Dive into the world of specialized computing systems with our Embedded Systems MCQs....

Digital Communication

Master the basics of electronic communication with our Digital Communication MCQs....

HTML

Start your journey in web development with our HTML MCQs. Learn the building blocks...

Formal Languages and Automata Theory

Discover the mathematical models of computation with our Formal Languages and...

Java Programming

Level up your coding skills with our Java Programming MCQs. From object-oriented...

Hadoop

Dive into the world of big data with our Hadoop MCQs. Cover key concepts including...

Neural Networks

Dive into the world of Artificial Intelligence with our Neural Networks MCQs. Uncover...

JavaScript

Strengthen your web development skills with our JavaScript MCQs. Understand core...