Limited Time OfferFLAT 20% off & $20 bonus sign up. Order Now
New! Hire Essay Assignment Writer Online and Get Flat 20% Discount!!Order Now
The base radix x in the above equation can be determined in the following way
Step1: The numbers are converted into decimal form
(211) x = (2 * x2 + 1*x1 +1*x0)
= (2x2 + x+1)10
(6A) 16 = (6 * 161) + (10 * 160)
= (106)10
Step2: Decimal forms are equated
2x2 + 1x+1 =106
2x2 + x-105=0
2x2 -14x+15x -105=0
2x(x-7) +15 (x-7) = 0
(2x+15)(x -7)=0
x=7 or x=7.5
Thus considering only the integer values we get x=7
A number in one decimal form can be converted to decimal number by multiplying each digit in the number system with their radix power of their location.
Hence
(0xBAD) 16 = (B*162 + A*161 + D*160)
= (11* 256 + 10 * 16 + 13 * 1)
= 298910
58810 into a 3-base number
Decimal numbers are converted to 3-base number by repeatedly dividing the number/quotient with the number 3
3|588
3 |196 – 0
3 |65 – 1
3 |21 – 2
3 |7 - 0
2 -1
Thus (588)10 = (210210)3
For a n-bit computer system, one’s complement number system represents numbers in the range from − (2n−1−1) to 2n−1−1
Thus for a computer with word size 6 which represents number in one’s complement form,
The smallest negative number that can be represented is – (26-1-1) = - (32-1) = -31
The largest positive number that can be represented is (26-1-1) = (32-1) = 31
For a n-bit computer system, two’s complement number system represents numbers in the range from − 2n−1 to 2n−1−1
Thus for a computer with word size 6 which represents number in two’s complement form,
The smallest negative number that can be represented is – (26-1) = - 32
The largest positive number that can be represented is (26-1-1) = (32-1) = 31
a) Consider the following logic diagram of a combinational circuit where A, B, and C are inputs and Q is the output. Three 2-input AND gates and two 2-input OR gates are used in the circuit. It is possible to reduce some of the logic gates without changing the functionality of the circuit. Such component reduction results in higher operating speed (less delay time from input signal transition to output signal transition), less power consumption, less cost, and greater reliability. Construct a logic diagram of a circuit which does have the same function output with only two logic gates (instead of five). Please show the steps.
The number of gates used in the combinational circuit can be reduced by minimizing the equation represented by the circuit. Thus the functionality of the circuit does not change too.
In the above combinational circuit A, B and C are the input lines and Q acts as the output line.
The Boolean equation represented by the above combinational circuit.
Q = AB + ((B+C) BC)
The above equation is minimized by applying Boolean laws
AB + ((B+C) BC) = (AB) + (BBC+CBC) [By Distributive law]
= (AB) + (BC+BC) [By Idempotent law on product]
= AB +BC [By Idempotent law on sum]
= (A+C) B [By Distributive law]
Thus the above minimized equation contains only two symbol which in turn requires only two gates.
The equivalent minimized combinational circuit diagram with two logic gates is given below
To Prove: ABC+ ABC' + AB'C + A'BC = AB + AC + BC
Proof:
Taking right hand side expression
AB + AC + BC = AB.1+AC.1+BC.1 [By Applying Identity law]
= AB(C+C') +AC (B+B') + BC (A+A') [By Applying Inverse law]
= ABC+ABC'+ ABC+AB'C +ABC+A'BC [By Applying Distributive Law]
= ABC+ABC +ABC'+ AB'C +ABC +A'BC [Rearranging the terms in the Boolean expression]
= ABC+ABC'+ AB'C +ABC+ A'BC [By Applying Idempotent law]
= ABC+ABC +ABC'+ AB'C +A'BC [Rearranging the terms in the Boolean expression]
= ABC +ABC'+ AB'C +A'BC
Hence Proved
No matter how close the deadline is, you will find quick solutions for your urgent assignments.
All assessments are written by experts based on research and credible sources. It also quality-approved by editors and proofreaders.
Our team consists of writers and PhD scholars with profound knowledge in their subject of study and deliver A+ quality solution.
We offer academic help services for a wide array of subjects.
We care about our students and guarantee the best price in the market to help them avail top academic services that fit any budget.
15,000+ happy customers and counting!