Alpha Geek

(8)

$10/per page/Negotiable

About Alpha Geek

Levels Tought:
University

Expertise:
Accounting,Algebra See all
Accounting,Algebra,Architecture and Design,Art & Design,Biology,Business & Finance,Calculus,Chemistry,Communications,Computer Science,Environmental science,Essay writing,Programming,Social Science,Statistics Hide all
Teaching Since: Apr 2017
Last Sign in: 438 Weeks Ago, 2 Days Ago
Questions Answered: 9562
Tutorials Posted: 9559

Education

  • bachelor in business administration
    Polytechnic State University Sanluis
    Jan-2006 - Nov-2010

  • CPA
    Polytechnic State University
    Jan-2012 - Nov-2016

Experience

  • Professor
    Harvard Square Academy (HS2)
    Mar-2012 - Present

Category > Computer Science Posted 08 May 2017 My Price 8.00

Subtraction Logic

(Subtraction Logic) The truth table for a 1-bit combinational binary subtractor, analogous to the half adder, computing D(ifference) = A minus B, with BL (borrow-from-left), is

(a) Design a 1-bit combinational binary subtractor, comparable to the full adder, with two data inputs (A, B), a borrow from the right input (BI), a borrow request to the left output (BL), and a difference output (D).

(b) Show how your design can be cascaded to form multi-bit subtractors.

(c) Does the subtractor work correctly for negative two's com-plement numbers?

(d) How is a subtraction under/low condition indicated?

 

Answers

Alpha Geek
(8)
Status NEW Posted 08 May 2017 08:05 AM My Price 8.00

-----------

Attachments

file 1494233732-Answer.docx preview (124 words )
(-----------Sub-----------tra-----------cti-----------on -----------Log-----------ic)----------- Th-----------e t-----------rut-----------h t-----------abl-----------e f-----------or -----------a 1------------bi-----------t c-----------omb-----------ina-----------tio-----------nal----------- bi-----------nar-----------y s-----------ubt-----------rac-----------tor-----------, a-----------nal-----------ogo-----------us -----------to -----------the----------- ha-----------lf -----------add-----------er,----------- co-----------mpu-----------tin-----------g D-----------(if-----------fer-----------enc-----------e) -----------= A----------- mi-----------nus----------- B,----------- wi-----------th -----------BL -----------(bo-----------rro-----------w-f-----------rom------------le-----------ft)-----------, i-----------s ----------- (-----------a) -----------Des-----------ign----------- a -----------1-b-----------it -----------com-----------bin-----------ati-----------ona-----------l b-----------ina-----------ry -----------sub-----------tra-----------cto-----------r, -----------com-----------par-----------abl-----------e t-----------o t-----------he -----------ful-----------l a-----------dde-----------r, -----------wit-----------h t-----------wo -----------dat-----------a i-----------npu-----------ts -----------(A,----------- B)-----------, a----------- bo-----------rro-----------w f-----------rom----------- th-----------e r-----------igh-----------t i-----------npu-----------t (-----------BI)-----------, a----------- bo-----------rro-----------w r-----------equ-----------est----------- to----------- th-----------e l-----------eft----------- ou-----------tpu-----------t (-----------BL)-----------, a-----------nd -----------a d-----------iff-----------ere-----------nce----------- ou-----------tpu-----------t (-----------D).----------- (-----------b) -----------Sho-----------w h-----------ow -----------you-----------r d-----------esi-----------gn -----------can----------- be-----------
Not Rated(0)