# (Homework Solution): Question: Perform the following additions, assuming seven bit two's complement binary representation show t…

Perform the following additions, assuming seven bit two’s complement binary representation show the effect on the status bits:

0101011

——————————

N =

Z =

V =

C=

I have no idea whats N, Z V, C is and how the calculation is: can you please explain?

Z=1 equal to zero

Z=0 not equal to 0

N=1 Negative

N=0 other wise

V=1 overflow occurred

V=0 other wise

C=1 Carry set

C=0 other wise

0 1 0 1 0 1 1

0 0 0 1 1 1 0

——————-

0 1 1 1 0 0 1

First we will find

Z=?

The result is 0 1 1 1 0 0 1

If all the bits are equal to 0, Z will set to 1

But in the result , there are some 1 are there

So

Z=0

N=?

The result is 0 1 1 1 0 0 1

This result is positive

But if result is negative N will be 1.

But result is positive so

N=0

V=?

We are adding two 7 bits

If the overflow occurs if it becomes 8 bits V will set to 1

The result is 0 1 1 1 0 0 1

No overflow occurs

So

V=0

C=?

This is carry bit

If it is carry set it will be 1

In the result 0 1 1 1 0 0 1

No carry is set

So

C=0

Order NOW for a 10% Discount
Pages (550 words)
Approximate price: -

Why Us?

Top Quality and Well-Researched Papers

All ourbpapers are written from scratch. In fact, Clients who ask for paraphrasing services are highly discouraged. We have writers ready to craft any paper from scratch and deliver quality ahead of time.

Our writers keeps you posted on your papers progress - providing you with paper outline/draft. You are also at liberty to communicate directly with your writer.

Free Unlimited Revisions

If you think we missed something, send your order for a free revision. You have 10 days to submit the order for review after you have received the final document. You can do this yourself after logging into your personal account or by contacting our support.

Prompt Delivery and 100% Money-Back-Guarantee

All papers are always delivered on time, in many cases quite ahead of time. In case we need more time to master your paper, we may contact you regarding the deadline extension. In case you cannot provide us with more time, a 100% refund is guaranteed.

Original & Confidential

We use several writing tools checks to ensure that all documents you receive are free from plagiarism. Our editors carefully review all quotations in the text. We also promise maximum confidentiality in all of our services.

Our support agents are available 24 hours a day 7 days a week and committed to providing you with the best customer experience. Get in touch whenever you need any assistance.

Try it now!

## Calculate the price of your order

Total price:
\$0.00

How it works?

Fill in the order form and provide all details of your assignment.

Proceed with the payment

Choose the payment system that suits you most.

Our Services

No need to work on your paper at night. Sleep tight, we will cover your back. We offer all kinds of writing services.

## Essay Writing Service

No matter what kind of academic paper you need and how urgent you need it, you are welcome to choose your academic level and the type of your paper at an affordable price. We take care of all your paper needs and give a 24/7 customer care support system.

An admission essay is an essay or other written statement by a candidate, often a potential student enrolling in a college, university, or graduate school. You can be rest assurred that through our service we will write the best admission essay for you.

Editing Support

Our academic writers and editors make the necessary changes to your paper so that it is polished. We also format your document by correctly quoting the sources and creating reference lists in the formats APA, Harvard, MLA, Chicago / Turabian.

Revision Support

If you think your paper could be improved, you can request a review. In this case, your paper will be checked by the writer or assigned to an editor. You can use this option as many times as you see fit. This is free because we want you to be completely satisfied with the service offered.