Question
F(x, y, z) = (x, + y) z' is given as
a.
x ' y ' z + x y z ' + x y z '
b.
x y z + x y z' + x Y' z '
c.
x y' z' + x ' y ' z ' + x y z '
d.
x y z ' + x Y ' z ' + x ' y z '
Engage with the Community - Add Your Comment
Confused About the Answer? Ask for Details Here.
Know the Explanation? Add it Here.
Q. The sum of products, expansion for the function F(x, y, z) = (x, + y) z' is given as
Similar Questions
Discover Related MCQs
Q. The BCD adder to add two decimal digits needs minimum of
View solution
Q. The Excess-3 decimal code is a self-complementing code because
View solution
Q. The equivalent hexadecimal notation for octal number 2550276 is :
View solution
Q. A byte addressable computer has a memory capacity of 2m Kbytes and can perform 2n operations. An instruction involving 3 operands and one operator needs a maximum of
View solution
Q. One of the main features that distinguish microprocessor from micro-computers is
View solution
Q. Consider a code with five valid code words of length ten :
0000000000, 0000011111, 1111100000, 1110000011, 1111111111
Hamming distance of the code is
View solution
Q. Which of the following logic expressions is incorrect ?
View solution
Q. The IEEE-754 double precision format to represent floating point numbers, has a length of _____ bits.
View solution
Q. The Simplified form of a Boolean equation for the following truth table is
View solution
Q. The Simplified form of a Boolean equation (AB'+AB'C+Ac)(A'C' +B') is
View solution
Q. In a Positive edge triggered JK flip-flop, if J and K both are high then the output will be _______ on the rising edge of the clock.
View solution
Q. ECL is the fastest of all logic families. High Speed in ECL is possible because transistors are used in difference amplifier configuration, in which they are never driven into __________.
View solution
Q. A binary 3-bit down counter uses J-K flip-flops, FFi with inputs Ji, Ki and outputs Qi, i=0,1,2 respectively. The minimized expression for the input from following, is
I. J0=K0=0
II. J0=K0=1
III. J1=K1=Q0
IV. J1=K1=Q'0
V. J2=K2=Q1Q0
Vl. J2=K2=Q'1Q'0
View solution
Q. Convert the octal number 0.4051 into its equivalent decimal number.
View solution
Q. The hexadecimal equivalent of the octal number 2357 is:
View solution
Q. If X is a binary number which is power of 2, then the value of X&(X-1) is:
View solution
Q. The Boolean function [~ (~p˄q)˄~(~p˄~q)]˅(p˄r) is equal to the Boolean function:
View solution
Q. The octal number 326.4 is equivalent to
View solution
Q. Which of the following is the most efficient to perform arithmetic operations on the numbers?
View solution
Q. Match the following:
List – I List – II
a. Controlled Inverter i. a circuit that can add 3 bits
b. Full adder ii. a circuit that can add two binary numbers
c. Half adder iii. a circuit that transmits a binary word or its
1’s complement
d. Binary adder iv. a logic circuit that adds 2 bits
Codes :
a b c d
View solution
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!