Search icon CANCEL
Subscription
0
Cart icon
Cart
Close icon
You have no products in your basket yet
Save more on your purchases!
Savings automatically calculated. No voucher code required
Arrow left icon
All Products
Best Sellers
New Releases
Books
Videos
Audiobooks
Learning Hub
Newsletters
Free Learning
Arrow right icon
Arrow up icon
GO TO TOP
Modern Computer Architecture and Organization

You're reading from  Modern Computer Architecture and Organization

Product type Book
Published in Apr 2020
Publisher Packt
ISBN-13 9781838984397
Pages 560 pages
Edition 1st Edition
Languages
Author (1):
Jim Ledin Jim Ledin
Profile icon Jim Ledin
Toc

Table of Contents (20) Chapters close

Preface 1. Section 1: Fundamentals of Computer Architecture
2. Chapter 1: Introducing Computer Architecture 3. Chapter 2: Digital Logic 4. Chapter 3: Processor Elements 5. Chapter 4: Computer System Components 6. Chapter 5: Hardware-Software Interface 7. Chapter 6: Specialized Computing Domains 8. Section 2: Processor Architectures and Instruction Sets
9. Chapter 7: Processor and Memory Architectures 10. Chapter 8: Performance-Enhancing Techniques 11. Chapter 9: Specialized Processor Extensions 12. Chapter 10: Modern Processor Architectures and Instruction Sets 13. Chapter 11: The RISC-V Architecture and Instruction Set 14. Section 3: Applications of Computer Architecture
15. Chapter 12: Processor Virtualization 16. Chapter 13: Domain-Specific Computer Architectures 17. Chapter 14: Future Directions in Computer Architectures 18. Answers to Exercises 19. Other Books You May Enjoy

Exercises

  1. Consider the addition of two signed 8-bit numbers (that is, numbers in the range -128 to +127) where one operand is positive and the other is negative. Is there any pair of 8-bit numbers of different signs that, when added together, will exceed the range -128 to +127? This would constitute a signed overflow. Note: We're only looking at addition here because, as we've seen, subtraction in the 6502 architecture is the same as addition with the right operand's bits inverted.
  2. If the answer to Exercise 1 is "no," this implies the only way to create a signed overflow is to add two numbers of the same sign. If an overflow occurs, what can you say about the result of performing XOR between the most significant bit of each operand with the most significant bit of the result? In other words, what will be the result of the expressions, left(7) XOR result(7) and right(7) XOR result(7)? In these expressions, (7) indicates bit 7, the most significant bit...
lock icon The rest of the chapter is locked
Register for a free Packt account to unlock a world of extra content!
A free Packt account unlocks extra newsletters, articles, discounted offers, and much more. Start advancing your knowledge today.
Unlock this book and the full library FREE for 7 days
Get unlimited access to 7000+ expert-authored eBooks and videos courses covering every tech area you can think of
Renews at $15.99/month. Cancel anytime