




Study with the several resources on Docsity
Earn points by helping other students or get them with a premium plan
Prepare for your exams
Study with the several resources on Docsity
Earn points to download
Earn points by helping other students or get them with a premium plan
Material Type: Lab; Professor: Rogers; Class: Computer Organization; Subject: Computer Science; University: Columbus State University; Term: Unknown 2003;
Typology: Lab Reports
1 / 8
This page cannot be seen from the preview
Don't miss anything!





Course Title: CPSC 2105 - Computer Organization Instructor Name: Neal L Rogers, Ph.D. Office: Tech 425 Phone: (706) 565- E-Mail: [email protected] Website: http://csc.colstate.edu/rogers/ Office Hours Office hours can be found on the home page of website. (Link above!) Textbooks Required Text The Essentials of Computer Organization and Architecture Linda Null and Julia Lobur Jones and Bartlett (Sudbury, MA), 2003 ISBN 0 – 7637 – 2585 – 4 Optional Reference & Supplementary Materials How Computers Work Ron White Que Corporation (Macmillan Corporation), 1998 ISBN 0 – 7897 – 1728 – X Catalog Course Description Overview of basic computer organization. Representation of data in computers. Brief introduction to Boolean algebra, basic logic gates, MSI components, and a Full Adder. Overview of computer arithmetic. Instruction set of a simple computer. Overview of the major software and hardware components of a typical computer, including the CPU. I/O system, memory, and system software. Interaction of the machine and computer languages including discussion of the compilation, assembly, and loading processes. Overview of the Java run-time system. Introduction to networking and the computer interface to the Internet. Course Prerequisite CPSC 1301 (Computer Science I) and CPSC 1301L (Computer Science I – Lab) both with a grade of ‘C’ or better. It is assumed that the student has programmed in some higher level language, preferably either Java or C++. Course Objectives: Upon completing this course, the students will demonstrate an understanding of the organization of computer components, instruction sets and their operation, binary and decimal number systems, simple Boolean operations, simple logic gates and their operation, interrupts and their uses, and the basic levels of computer languages.
Course Outcomes: At the end of the course the student will be able to describe and explain the following:
Notes: Students are responsible for all assigned readings and all information presented in class and lab session, including any changes in due dates, assignments, exams, etc. LATE ASSIGNMENTS WILL NOT BE ACCEPTED. Students are expected to attend all of the class lectures, lab, and review sessions. Students are NOT permitted to submit extra work in an attempt to raise grade. Typical Course Schedule The course CPSC2105 (Computer Organization) will cover the following topics in approximately this order. Introduction Data Representation Number Systems Conversion between Number Systems Decimal Numbers: Terminating and Non-Terminating Introduction to Binary Addition and Subtraction Signed and Unsigned Integers – Two’s compliment arithmetic Representation of Real Numbers: Normalized Numbers and IEEE- Character Codes: ASCII, EBCDIC, and Unicode Boolean Algebra and Digital Logic Basic Logic Gates: AND, OR, NOT, and XOR Truth Tables Sample MSI (Medium Scale Integration) Circuits Review of binary codes (unsigned integer notation) Decoders and Encoders SOP and POS Expressions Multiplexers and Demultiplexers Computer Arithmetic Design of a Full Adder Multiple-Bit Full Adders Arithmetic Overflow Saturation Arithmetic Bitwise Logical Operations on Integers Memory, Flip-Flops, and Sequential Circuits Definition of Combinational and Sequential Logic Synchronous and Asynchronous Circuits The Idea of a Clock and Related Definitions Description of Flip-Flops: Characteristic and Excitation Tables Four Flip-Flop Types: SR, JK, D, and T. Sample Sequential Circuit Analysis Introduction to Computer Architecture Top-Level Structure of a Stored-Program Computer
The Fetch-Execute Cycle Registers and Memory The Program Status Register (PSR) Structure of a Typical Bus Memory Organization and Addressing Registers Associated with the Memory System: MAR and MBR Memory as a Collection of Chips Word-Addressing vs. Byte-Addressing Big-Endian vs. Little-Endian Addressing Description of the architecture of a simple computer The Instruction Set Architecture Design Approaches to the CPU: RISC vs. CISC Instruction-level pipelining. Characterization of the CPU by Register Set General Purpose Registers Special Purpose Registers The Intel 80386 Register Set Characterization of the CPU by I/O Strategy Isolated I/O Memory-Mapped I/O The Memory System Levels of Memory – Several Approaches Access Time for a Multi-Level Memory Random Access Memory: RAM and ROM Registers Associated with the Memory System Memory Organization: Bits, Bytes, Words, and Long Words Address Space and Physical Memory Byte Addressed Machines: Big-Endian and Little-Endian Addressing Segment/Offset Addressing Near and Far Pointers Impact of Memory on Algorithm Development: the Z-Buffer Algorithm Input / Output Design Issues Structures for the I/O System I/O Primitives for Isolated I/O and Memory-Mapped I/O Privileged Instructions as the Context for I/O Strategies Program-Controlled I/O Interrupt-Driven I/O Direct Memory Access and I/O Channels Vectored Interrupts and IRQ’s on the Intel 80386 CPU
Policy on academic integrity: Students are encouraged to study together; however, each student must individually prepare his/her own submission. Cheating or plagiarism is not permitted and will be sanctioned according to the CSU policy on academic standards. You should carefully read the section on Academic Misconduct in the Student Handbook. Your continued enrollment in this course implies that you have read it, and that you subscribe to the principles stated therein. Policy prohibiting sexual harassment: As your instructor, one of my responsibilities is to treat all students fairly and equally and to abide by the policies and procedures governing faculty/student relationships, including those concerning sexual harassment as stated in the Faculty Handbook. Students with a documented disability as described by the Rehabilitation Act of 1973 (P.L. 933-112 Section 504) and Americans with Disabilities Act (ADA) that affect their ability to participate fully in class or to meet all course requirements are encouraged to bring this to the attention of the instructor so that appropriate accommodations can be arranged. Further information is available from the Office of Disability Services in the Center for Academic Support and Student Retention, Tucker Hall (706) 568-2330. Course requirements will not be waived but reasonable accommodations may be provided as appropriate. ABET Criteria: A. An ability to apply knowledge of computing and mathematics appropriate to the discipline; B. An ability to analyze a problem, and identify and define the computing requirements appropriate to its solution; C. An ability to design, implement and evaluate a computer-based system, process, component, or program to meet desired needs; D. An ability to function effectively on teams to accomplish a common goal; E. An understanding of professional, ethical, legal, security, and social issues and responsibilities; F. An ability to communicate effectively with a range of audiences; G. An ability to analyze the local and global impact of computing on individuals, organizations and society; H. Recognition of the need for, and an ability to engage in, continuing professional development; I. An ability to use current techniques, skills, and tools necessary for computing practice. J. An ability to apply mathematical foundations, algorithmic principles, and computer science theory in the modeling and design of computer-based systems in a way that demonstrates comprehension of the tradeoffs involved in design choices; K. An ability to apply design and development principles in the construction of software systems of varying complexity.
CS Program Objectives: Our graduates will have achieved: