CS225, Fall 2006, Wednesday Nov. 15, Day 35After class Hit
reload!
HW Day 35, Due Friday
Day 36 (7 class days after today)
A) Continue with programming. Goal: To have a working
program (main & procedures combined) by Monday, with or without
refinements.
Post on the Wiki or Email me by 11 a.m. Friday what you have working
(however simple); or if not, something whose bugs you can't solve.
B) Postponed, obviously. Sorry for the
delay updating this page.
B) (See Day 29 for notes) Fancier Addressing modes:
Investigate n
(indirect),
sf, sx, sfx, "cold" using RTL (p. A4)
a) Tell in words what each one does. Use as the
operand specifier 0003, tell what is done to compute the operand.
b) Use an imaginary set of microcode
operations, on registers B, C, D (and A and X and SP), with our usual
operations and more operations which can, for example
Move B, D Copy
contents of D to B
AddB, A
Add contents of register A to B
AddB,
Mem[A] Treat the contents of register A as an
address. Go to that address and add the value at that address to
register B.
(make up any more you need, using the
registers more freely than we actually can.)
Now write "microcode" which will
calculate the Operand from the OprndSpec, for each of n, sf, sx, sfx
addressing modes. Note, for each, how many times you
have to go get something from a memory location.
Amnesty extended again: Any old "Programs"
handed in by last day of classes will be only 1 day late.
= = = = = = = = = = = = = = = = = = = = = = = = = = = = = = =
=
= = = = = = =
Notes: Continuing with TicTacToe, with Wiki. Most
up-to-date versions of files are on the Wiki.
Review structure, examine algorithms and code. Solve problems.
More about addressing modes
Day 29
This page belongs to Sally Sievers who is solely
responsible
for its content. Please see our statement
of responsibility.