Where we are going (today)
Bits store whatever you want, including integers. How do we
manipulate sequences of bits?
Q: How do we arrange bits in the memory of the computer?
(why do we care? we want the computer to store many individual
Where are we?
Instruction set architecture (e.g., MIPS)
Datapath & Control
translating source code (C or Java)
Programs to assembly language
And linking your code to
How the software talks
Thought question before class
(answer in clickers)
Why are we picking register transfer language
r2 <- r1 + r0
r0 <- M[address]
as the basis of our processors programming language?
Meeting 5: MIPS
A computer that plays cards
1. Come up with a binary encoding for a 52-card deck
Operations on a pair of cards
2. We want the following operations to be easy to implement
Compare two cards, which is higher value?
Compare two cards, are they the same sui
CS2630: Computer Organization
Bits, bytes, and memory organization
Due January 25, 2017, 11:59pm
Instructions: Show your work. Correct answers with no work will not receive full credit.
Whether you write or type (or both) your answers, save you
or linked from ICON
Class has been increased to 60 enrollments
To the 26 students on the waitlist:
get started on the class, but probably not everyone will make
it in L
Before class practice
write a method for the BinaryTree class
class BinaryTree cfw_
/* returns the max data of the internal (nonleaf) nodes in the tree */
int maxInternalNode() cfw_
CS II: Data structures
Meeting 26: implementi