Pellissippi State
Technical Community
College
Master Syllabus
MACHINE ORGANIZATION
CSIT 1410
|
Class Hours: 3.0
|
Instructor:
|
|
Laboratory Hours: 3.0
|
Office No.:
|
|
Credit Hours: 4.0
|
Phone No.:
|
|
Revised: December 2006
|
Email:
|
Catalog Course Description:
A study of assembly language and computer organization. Topics include
organization, architecture, number systems, storage concepts, I/O memory
management and process management.
Prerequisite: CSIT 1110
Textbooks and Other Supplies:
Textbook: Detmer, Richard C, 80x86 Assembly Language
and Computer Architecture, Jones and Bartlett, 2001.
I. WEEK /CHAPTER/TOPIC BASIS:
|
1
|
1
|
Representing Data
|
|
2
|
1,2
|
Representing Data, Parts of a Computer
|
|
3
|
3
|
Elements of Assembly Language
|
|
4
|
4
|
Basic Instructions
|
|
5
|
4
|
Basic Instructions, Test 1
|
|
6
|
5
|
Branching and Looping – Jump Statements
|
|
7
|
5
|
Branching and Looping - Selection Statements
|
|
8
|
5
|
Branching and Looping, Repetition Statements
|
|
9
|
6
|
Procedures – The Stack
|
|
10
|
6
|
Procedures, Test 2
|
|
11
|
7
|
String Operations
|
|
12
|
8
|
Bit Manipulation
|
|
13
|
|
Circuits
|
|
14
|
|
Circuits, Test 3
|
|
15
|
→
|
Optional, comprehensive final exam
|
II. COURSE OBJECTIVES:
- Demonstrate familiarity with
the architecture and operation of the IBM PC family of computers. I, II,
III, IV, V, VI
- Demonstrate an understanding
of basic assembly language techniques by writing short, modular programs
in IBM assembler and using these modular programs to enhance understanding
of high-level languages. IV, V, VI, VIII, IX
- Use binary, decimal, and
hexadecimal codes to demonstrate an understanding of how programs and data
are stored III, IV
- Apply Boolean algebra to
design and implement algorithms and digital logic to design and implement
simple hardware components of a computer. III, V, VI
- Use program development
facilities and utilities to create executable programs IV
- Demonstrate an understanding
of a hierarchical directory structure and manipulate files within this
structure. IV
III. INSTRUCTIONAL PROCESSES:
Students will:
- Create several short modular
programs using the 80x86 assembler which
implement several common algorithms and data structures. Communication,
Technological Literacy, Transitional Strategy, Active Learning
- Examine and implement
algorithms that are efficient and reliable. Technological Literacy,
Transitional Strategy, Active Learning
- Use professional tools to
produce software components and documentation. Technological Literacy,
Transitional Strategy, Active Learning
- Use professionally accepted
methods and materials in their approach to completion of applications. Technological
Literacy, Transitional Strategy, Active Learning
IV. EXPECTATIONS FOR STUDENT
PERFORMANCE:
Upon successful completion of the course, the student should
be able to:
- Identify and use the major
addressing modes of PC assembler. A,B
- Write programs in PC
assembler making use of the processor status word for conditional
branching. A,B,D
- Be able to implement a stack
using PC assembler and make use of the user stack. A,B
- Write functions and
procedures in PC assembler. A,B
- Write programs in PC
assembler which call functions and procedures and pass arguments. A,B
- Define, invoke and expand
macros in PC assembler programs. A,B,D
- Use PC bit instructions to
implement the laws of logic and Boolean algebra. A,B,D
- Write PC assembler programs
which call system macros and procedures. A,B
- Create modular programs using
PC assembler. B
- Produce list files produced
from PC assembler source files, relating the machine code produced to the
PC assembler statements which produced it. B,C
- Know the different internal
formats of integers, real numbers and character data and be able to
convert between the forms whenever possible. C,D
- Use Debug in debugging
programs. A,B,C,D
- Write high-level language
modules which call PC assembler modules.
- Pass arguments by value,
reference. A,B
- Use the major assembler
directives for memory reservation and initialization. A,B,C
- Explain the operation of
2-pass assembler, such as the PC assembler. B,C
- Use the linker and answer
questions concerning the linking process. B
- Create and use a macro
library using PC assembly language. A,B
- Create, edit, delete, rename,
copy and display the contents of files. A,E,F
- Use PC compilers, assembler,
linker and symbolic debuggers to develop programs. A
V. EVALUATION:
- Testing Procedure:
There will be three tests worth 50% of
the grade. A fourth test, a comprehensive
final exam, may be taken and will replace a single, lowest test
score. Failure to make a passing test
average will result in a grade of F for the course.
- Laboratory Expectations:
Lab attendance is required. At least 7 lab assignments will be given and
must be completed and handed in on the designated date. The student is
expected to turn in all required documentation for each lab. Lab
assignments are 50% of the grade. Failure to make a passing test
average will result in a grade of F for the course.
- Field Work:
None is required.
- Other Evaluation Methods:
None.
- Grading Scale:
|
93 – 100
|
A
|
|
88 – 92
|
B+
|
|
83 – 87
|
B
|
|
78 – 82
|
C+
|
|
73 – 77
|
C
|
|
65 – 72
|
D
|
|
Below 65
|
F
|
VI. POLICIES:
- Attendance Policy:
Pellissippi State Technical
Community College
expects students to attend all scheduled instructional activities. As a
minimum, students in all courses (excluding distance learning courses)
must be present for at least 75 percent of their scheduled class and
laboratory meetings in order to receive credit for the course. Individual
departments/programs/disciplines, with the approval of the vice president
of Academic and Student Affairs, may have requirements that are more
stringent. In very specific circumstances, an appeal of the policy can be
addressed to the head of the department in which the course was taken. If
further action is warranted, the appeal can be addressed to the vice
president of Academic and Student Affairs (Pellissippi State Catalog)
- Academic Dishonesty:
Academic misconduct committed either directly or indirectly by an
individual or group is subject to disciplinary action. Prohibited
activities include but are not limited to (Pellissippi State Catalog):
- Cheating, including
but not limited to unauthorized assistance from material, people, or
devices when taking a test, quiz, or
examination; writing papers or reports; solving problems; or completing
academic assignments
- Plagiarism, including
but not limited to paraphrasing, summarizing, or directly quoting
published or unpublished work of another person, including online or
computerized services, without proper documentation of the original
source
- Providing others with
information and/or answers regarding exams, quizzes, homework or other
classroom assignments unless explicitly authorized by the instructor
- Taking an exam for
another student
- Accommodations for
Disabilities:
If you need accommodations because of a disability, if you have emergency
medical information to share, or if you need special arrangements in case
the building must be evacuated, please inform the instructor immediately.
Please see the instructor privately after class or in his/her office.
Students must present a current accommodation plan from a staff member in
Services for Students with Disabilities (SSWD) in order to receive
accommodations in this course. Services for Students with Disabilities may
be contacted by going to Goins 127 or 131 or by phone: 694-6751(Voice/TTY)
or 539-7153.
- Computer Usage Guidelines:
College-owned or –operated computing resources are provided for use by
students of Pellissippi State.
All students are responsible for the usage of Pellissippi State's
computing resources in an effective, efficient, ethical and lawful manner.
(Pellissippi State Catalog)
- Other Policies:
Students are expected to promptly attend all lecture and lab classes. If a
class is missed, it is the student’s responsibility to make up all work
and get notes and/or handouts. In the event that a student has an emergency
beyond his/her control, he/she must notify the instructor as soon as
possible.