SYLLABUS
ICS 362
Computer Organization and Architecture
Section 2
Fall 2003
Class Hours:
Tuesdays,
Mpls, Room 801 (subject to
change)
August 26
Instructor:
Sue Fitzgerald, Ph.D.
Associate
Professor of Computer Science
E-mail: Sue.Fitzgerald@MetroState.edu
Class
web site: http://redhat.ics.metrostate.edu/~sue/orgdir/orgarch.htm
Phone: 612-659-7143
Fax: 612-659-7160
Departmental support staff: Available in Mpls 305
612-659-7141
Office
Hours:
Mon.
Mon.
Tues.
Wed.
Generally
good times to reach me: Afternoons, Monday
Thursday, in my office
I
will make a reasonable effort to be available during my scheduled office
hours. However, I may be pre-empted for
meetings at other locations occasionally.
Be sure to call ahead if you wish to meet with me. I will be available in our classroom directly
before class and will stay after class to answer questions.
Do
not expect to solve programming problems in the half-hour before programs are
due. This never works.
Text: Miles J. Murdocca and Vincent P. Heuring,
Principles of Computer Architecture, Prentice Hall, 2000. ISBN:
0-201-43664-7
Assembly
tools: http://www.prenhall.com/murdocca
Course
description
(from catalog): This course introduces
machine language, computer architecture, data representations and aspects of
distributed systems. Topics include
conventional von Neumann architecture, the internal representation of data,
instruction sets and formats, addressing, the fetch/execute cycle, memory
architectures, and I/O architectures, as well as an overview of distributed,
multiprocessor and parallel systems.
Prerequisites: This course is required for CS majors and is
an elective for CIS majors. It is an introduction to the topic of computer
organization and architecture that will prepare students for ICS 462 Operating
Systems. The minimum prerequisites are
ICS 141 Programming with Objects and Math 215 Discrete Mathematics.
Competence
Statement: Knows concepts and foundations of computer
architecture well enough to understand the influence of hardware paradigms on
operating system development and to maintain an ongoing understanding of
technological advances.
Course
Statement of Objectives:
¨ Gain an understanding of
computer data representation and manipulation.
¨ Investigate the basic
organization of instruction sets, language translation, and program execution.
¨ Understand the basic
organization for data storage and access across various media.
¨ Compare and contrast
implications of various computer architectural attributes.
¨ Gain experience implementing
(simulator-based) assembly language solutions.
Learning
Outcomes:
¨ Understands simple machine
architecture and the reduced instruction set computers.
¨ Understands memory control,
direct memory access, interrupts, and memory organization.
¨ Understands basic data flow
through the CPU (interfacing, bus control logic, and internal communications).
¨ Understands number systems,
instruction sets, addressing modes, and data/instruction formats.
¨ Understands distributed,
multiprocessing, and real-time systems.
¨ Understands basic parallel
architectures.
¨ Is able to write simple
assembly language programs.
Letter
Grade: Your letter grade will be determined based on
the percentage of possible points that you earn during the quarter. The following table relates the percentage to
a letter grade:
|
Percentage |
Grade |
|
|
|
|
94
100 |
A |
|
90
93 |
A- |
|
87
89 |
B+ |
|
84
86 |
B |
|
80
83 |
B- |
|
76
79 |
C+ |
|
72
75 |
C |
|
69
71 |
C- |
|
60
68 |
D |
|
Below
60 % |
F |
If
you have selected the S/N grading option, then to receive a satisfactory rating
(S) you must earn at least 69% of the possible points. If you wish to elect S/N grading, you must
inform the registrar before the second class meeting. Bear in mind that you must earn a C- or
better (or an S) in order for a course to fulfill a requirement or elective in
your major.
Points
are allocated to different learning activities as indicated in the table
below. There may be some slight
variation in the number of programming assignments and problem sets. So, the Total of 750 possible points is an
approximation to the final total.
|
Description
of Item |
Number
of Items |
Maximum
Points per Item |
Total
Maximum Possible Points |
|
|
|
|
|
|
Tests |
2 |
100 |
200 |
|
Final
Exam (comprehensive) |
1 |
150 |
150 |
|
Programming
Assignments |
2 |
60 |
120 |
|
Homework
Problem Sets |
~10 |
~30 |
~300 |
|
|
|
|
|
|
Total |
|
|
Approx.
770 |
No Credit for Late Homework: There will be a number of homework problem
sets that will be assigned in class.
Written answers to them will be due at the beginning of the next class
period. Because the answers will be
given in class, no late homeworks will be accepted. If you cannot come to class, email, snail
mail or fax your homework assignment to me before the beginning of the class
period in which the assignment is due.
Late
programs will be assessed a 10% per day
late penalty.
It
is a good practice to keep all returned assignments in case of any grade
disputes. In addition, I strongly
recommend that you keep backup copies of all programs.
No Makeup Tests: No makeup tests will be offered. If you miss a test, the next test that you
take will be doubly counted in order to replace the missed test. You must inform me of your valid reason for
missing the test no later than one day following the test in question.
I
strongly believe that all students should take the final exam at the designated
time. This helps to ensure that all
students are tested in a uniform manner.
If you do convince me to write a separate final exam for you, it may be
more difficult than the exam given to the rest of the class. I reserve the right to refuse to give you a
makeup final exam.
Expectations: Sometimes difficulties arise when the
expectations of students and teachers are different. Here is a brief summary of what I expect from
you AND a summary of what you can expect from me.
What
you can expect from me:
¨ I will share my technical
knowledge with you as effectively as I know how.
¨ I will grade your work and
return it quickly. In most cases I will
grade your work and return it to you at the next scheduled class period (but
not before). Occasionally I will take
two class periods to return your work.
¨ I will provide you with
written feedback on the quality of your work.
If you do not understand why you were assigned a particular grade or if
my comments are not clear, I will explain more thoroughly if you ask me to.
¨ I will show up for
class. I will start and end class on
time.
¨ I will return your phone
calls and emails as quickly as possible.
However, I may take more than one business day to do so. I do not check my phone or email messages on
the weekends. If I plan to be out of my
office for a day or more, I will leave a phone message on my voice mail
explaining when I will be back.
¨ I will listen to you
respectfully. I will answer your
questions respectfully.
¨ I will provide you with a
summary of the total points earned to date anytime that you ask for it.
What
I expect from you:
¨ I expect you to read the
syllabus and to know the class policies outlined there.
¨ I expect you to seek help if
you are having difficulty with your course work. I expect you to talk to me if you are having
problems. If a stressful work or home situation arises which is affecting your
ability to perform well, please talk to me as soon as possible.
¨ If you do not understand why
you received a particular grade, I expect you to approach me and ask questions. I expect you to treat me with respect even if
you disagree with the grade you were assigned.
¨ I expect you to show up for
class on time and stay for the entire session except when you have an
unavoidable conflict. If you must miss
class, assignments and most handouts can be obtained from the class web site.
¨ I expect you to turn in your
assignments. I expect them to be submitted
in a timely fashion. Late homework will
not be accepted since answers will be given out at the beginning of the class
period when the homework is due. Late
penalties for other sorts of work will be explained when assignments are made.
¨ I expect you to turn in
individual and original work. This means
that what you turn in must be your own work and it cannot be work previously
done for some other class. If you turn
in work done by someone else, or work containing even a sentence or phrase
copied from someone else, you may be assigned an F in this course. Repeated instances of academic dishonesty can
result in expulsion from the University.
¨ I expect you to say no if
another student asks you for a copy of your work. The penalty for permitting another student to
copy your work is the same as if you yourself had turned in work that was not
individual and original.
¨ I recommend that you
complete the reading assignments before you come to class, particularly if you
are having difficulty understanding the material.
Incompletes: From time to time I am
asked to consider assigning a grade of incomplete. A grade of incomplete may be considered if
the person requesting has successfully completed at two thirds of the class and
is a student in good standing in the class.
Good standing means that the requester is earning a minimum of a B
grade and has attended class regularly.
I reserve the right to say no to any request for an incomplete without
justifying my position.
Respect:
If
you do not feel comfortable sharing your concern directly with me, please
contact Jigang Liu, chairman of the Department of Information and Computer
Sciences, at 612-659-7142 or Jigang.Liu@MetroState.edu.
Learning
Disabilities: If you have a documented learning disability,
or if you suspect you have a learning disability that may have an impact on
your opportunity to succeed in this course, please notify me before the second
class so we can explore ways to reasonably accommodate your learning
style. If you want, you may work with
Disability and Special Services by calling 651-772-7819. Note that I must receive adequate notice in
order to honor requests.
TENTATIVE
SCHEDULE
|
Week |
Date |
Topics |
Reading/Assignments |
|
1 |
Aug
26 |
Course
logistics Overview
and history Numbering
systems |
Syllabus Chapter
1 http://www.ifi.unizh.ch/se/people/hoyle/Lecture/ or http://www.eingang.org/Lecture/
(see page 17) Chapter
2 |
|
|
Sept
1 |
LAST
DAY TO DROP CLASS AND REMAIN ELIGIBLE FOR REFUND |
THIS
IS A |
|
2 |
Sept
2 |
Data
representation Character
sets |
Homework
# 1 due Chapter
2 |
|
3 |
Sept
9 |
Digital
Logic |
Appendix
A |
|
4 |
Sept
16 |
Digital
Logic Arithmetic |
Chapter
3 (p. 61-76) |
|
5 |
Sept
23 |
Test
#1 |
Test
#1 |
|
6 |
Sept
30 |
Go
over test Instruction
sets, assembly language |
Chapter
4 |
|
7 |
Oct
7 |
Languages
and the Machine |
Chapter
5 (p. 151-176) ARC
tutorial due |
|
8 |
Oct
14 |
Assembly
language |
Chapters
4 & 5 |
|
9 |
Oct
21 |
Datapath
and control |
Chapter
6 Program
#1 due |
|
10 |
Oct
28 |
Datapath
and control Test
#2 |
Chapter
6 Test
#2 |
|
11 |
Nov
4 |
Go
over test Memory |
Chapter
7 (skip 7.7 on Virtual Memory) |
|
12 |
Nov
11 |
Memory
(continued) Mass
Storage |
Program
#2 due Section
8.5 |
|
|
Nov
16 |
LAST
DAY TO WITHDRAW FROM FALL CLASSES (W on transcript) |
|
|
13 |
Nov
18 |
Input
and Output |
Chapter
8 |
|
14 |
Nov
25 |
Trends
and current technologies |
Chapter
10 (p. 385-396) |
|
15 |
Dec
2 |
Final |
Final
exam |
Homework
will be due nearly every class session.
Minor adjustments to the schedule will be made as needed.