Comp 516
Computer
Architecture, Organization
& Assembly
Language Programming
12/15/2014
5:13 AM
Current
Events
Final Exam Tuesday,
16 Dec 2014 6pm-8pm CS Lab 1505
Required Material
·
Computer Systems, 4th
Edition J.
Stanley Warford Jones
& Bartlett 978-0-7637-7144-7
·
Flash Drive –
required – no exceptions
these can be purchased at
·
CSUN bookstore http://www.csun.edu/maps/cm1.html
·
Pierce College
bookstore
·
Brick and Mortar
stores such as Fry’s, CostCo, BestBuy, etc.
·
Amazon.com or other
online source -- make sure that you get the 4th edition.
Academic
Attendance
is required at all lectures and during all programming labs; no
exceptions – see instructor for consideration of any exception to the
rule. Occasional emergencies will be excused! Failure to attend on a regular
basis will result in a failing grade for the course. Lab Attendance Is required during EVERY week for at least long
enough to submit the projects.
Bring
the following to every lecture/lab meeting
·
Computer Systems, 4th
Edition
·
Flash Drive –
required – no exceptions
All
homework assignments are due at the beginning of the next class.
All
assembly & high-level language programs must include a comment field at the
very beginning of the document that includes the following information:
· Project # <correct number inserted
here>
· your name
· Comp 516
All
programs must include adequate evidence of testing, e.g., input/output data
trails.
The
test data should be easily identifiable and place immediately after the
relevant program that it is testing.
If
a project consists of more than a single program, the project must include a
cover sheet with the following information:
· Project # <correct number inserted
here>
· your name
· Comp 516
Place
each program on a new page and label it with the page number and program number
given in the textbook.
The
goal is to complete all programs by the stated due date; however, if you have a
problem with a particular problem, bring what you have, and I’ll give you
some debugging assistance. If need be, you can submit the assignment one week
late without penalty.
Projects must be submitted on a timely basis; any project submitted more than
two weeks after the due date will be rejected. Anyone trying to submit the
majority of the projects during the last two weeks of the semester will fail
the course.
Supplementary
Information
Administrative
Office Hours (CSUN) http://www.csun.edu/~sgs/faculty/putnam.html
Midterm
Exam
Final Exam
Pep8 Access Point: http://code.google.com/p/pep8-1/
choose the
latest version for your platform and operating system, e.g., Intel running
Windows XP or Apple Mac running OS/X.
Archive
Notice: Changes were made in the Homework and
Projects assignments
28
yields 256 unique patterns
8
bit address provides for a total memory of 256 bytes (in a byte addressable
system)
Solving
equation 2n = 4 GBytes yields address
length required
32
bits yields 232 which is 256*256*256*256 which yields 4, 294, 967, 296
4 GBytes
== 4.294967E+09 == 4, 294, 967, 296
32 bit machines are
limited to 4 GBytes of memory
64
bit machines support ?? GBytes/TeraBytes of memory
Fibonacci
Numbers 1 1 2 3 5 8 13 21 44 65 109 174 283 457 …
Index
Numbers 1 2 3 4 5 6 7 8 9 10 11 12 13
14 …
Recurrence
Equation, i.e., definition of a recursive function fib(
n + 2 ) = fib( n ) + fib( n + 1 )