Now that we know how to add and subtract we’ll figure out how to implement multiplication and division.
Slides for today.
Study chapter 3.
Now that we know how to add and subtract we’ll figure out how to implement multiplication and division.
Slides for today.
Study chapter 3.
Issued: 17 Feb 2010
Due: 3 March 2010
Problem set 4 will be the culmination of your assembly language programming journey. In this exercise you’ll get to wrestle with the issues of representation and functions. Enjoy!
Update : I have modified the example so that it doesn’t cause an overflow in 32 bits. Your num2str need only handle 32 bits of input.
Here is the first midterm exam from last time I taught this class. Another older sample .
The exam will be open book and notes. No computers, phones, etc.
Today we’ll see how to implement arithmetic (and some logical) functions using gates.
Slides for today.
Readings: Appendix C1-C3, C5, skim C6
The first of 2 mid term exams will be 22 Feb covering material up until then.
In today’s lecture we’ll dive deep into the implementation of computers to explore the lowest level building blocks.
Slides for today.
Readings: Appendix C.1-C.3
and to read ahead go ahead and read: Ch. 3.1-3.2, Appendix C.5-C.6
Today we’ll talk about how assemblers and compilers prepare programs for execution.
Reading 2.12-14 in 4th ed or 2.10-13 in 3rd ed.
Issued 3 Feb 2010
Due 17 Feb 2010 (before class)
Problem Set 3 and program template ps3.asm .
Today we’ll begin talking about how to manage procedure call and return.
Slides for today.
Read section 2.8 in the 4th edition, 2.7 in the 3rd.