chp 9 hmwk

November 23, 2009


Hey sorry  I forgot to post earlier, but are there any hints on completing homework 9.18, I’m assuming that they are all one liners.


Study Guide Test 2

October 29, 2009

Your studies should focus on the following homework problems.  However, expect 20% of the test to consist of programming problems which will be hand written, i.e. no assembly.

Guide: 5.1, 5.5 a,c,d, 5.9 (understand why each instruction will or will not make a good NOP instr), 5.13 a, 5.29 a, 6.7, 6.10, 6.15 (definite ques), 6.16 (definite ques), 7.10, 7.12, and 7.13.

ASM labs added to course calendar

October 26, 2009

Labs 2 and 3 have now been posted to the course calendar.  Please see these labs.

Calendar update

October 26, 2009

The calendar has been updated, please see the changes in due dates and test #2.  Test #2 will be on Nov 2 to accommodate a longer class period for the test.  Consequently, labs have been shifted so, please, see the calendar.  If you have any questions post to blog, email, or contact my in person.

Machine Language Lab

October 16, 2009


I have provide some insight into ML lab part A.  There are two parts to the lab 1 that can be solved separately and then brought together after each has proven to work successfully.  In chp 6 we discussed how to organize machine code based on three programming constructs: sequential, conditional, and iterative.  You should use these constructs to develop a flowchart of your program.  The flowchart for part A has been provided here.

From the flowchart you can use the corresponding ML code segments from page 158 to help in organization of the code.  Please see the attached graphic for an example.

Don’t forget to test your code.  You use LCEdit to enter your binary (machine langauge) code. Create an object file *.obj by selecting the b ->.  If there are no errors then you test your code in the LC3Simulator.  Load the code.  Place a break point at the HALT command (trap 37).  Edit the value at location x3031 to make it an odd number using “set value”. Step through the code line by line to ensure that it is executing properly.  If you get the right answer for an odd value try an even value.


Good Luck….

Repost of 6.16 question

October 15, 2009

Michael Sodomsky Says:
October 15, 2009 at 1:37 am | Reply edit

I’m doing 6.16 now and I’m really confused on how you would go about it. Any information would be awesome. thanks.

Test 1 Extra Credit

October 1, 2009

Corrections of for test 1 are due on Friday.  Students who correct their wrong answers and turn in on Friday will receive partial credit for the incorrect problems.  The diagram for chapter 3 problem 2 is located in the textbook on page 84 (prob. 3.6).

Test #1 Review

September 17, 2009

Chapter 1
Important items are ISA and its role and relationship to microarchitecture, developer of universal Touring machine, Touring machine as a universal computing device.

Study: 1.5, 1.16, 1.17

Chapter 2
Important items are Boolean simplification (with algebra and kmaps (3-term) as in full-adder), Boolean identities, DeMorgan’s, double negative, conversion of bin to decimal and decimal to bin, conversion of hex to bin in unsigned and signed, masking with bit vector, canonical representation and circuit design from.

Study: 2.8, 2.12, 2.39, 2.40 and reduction of not[[not(a) or b] and b]

Chapter 3
Important items are CMOS construction of circuits, formation of NAND gate, the Boolean sufficiency of the NAND gate, ability to read a logic circuit (know the basic gates, NOT, AND, OR, NAND,  construction of a mux and full adder, address space and addressability, and components of memory (logic components, sequential)
Study: 3.6, 3.15, 3.16,  3.44

Chapter 4
Important items are the 4 components of the von Neumann machine, what makes up the processing unit, the role of the control unit, how is memory organized and accessed, the instruction cycle, particularly what happens in the fetch cycle, what is the PC, MAR, MDR, IR and their relationship (if it exists) to each other and how is execution flow changed (i.e. jump)

Study: 4.1, 4.5, 4.16

chp3 hmwk

August 31, 2009

Hmwk: 3.2, 3.4, 3.5, 3.6, 3.7, 3.13, 3.14, 3.15, 3.16,3.23, 3.27, 3.44 (due: 9/11)

3.44 was discussed at length during today’s lecture.  The wise student would be able to extend the discussion on sufficiency of NAND gates. Hint: use the truth table of for the NAND and three basic gates (AND, OR, NOT) to figure out a NAND only implementation of the basic gates.

Wednesday and Friday Class

August 31, 2009

There will not be a podcast for the upcoming Wednesday and Friday class.  Mrs. Amrutha Sethuram will be the guest lecturer for these classes. Mrs. Sethuram is a member of the Face Aging Group ( where she is a research scholar.  She has been working with the group for 5 years.