Course Syllabus for Computer Organization | CPSC 2105, Lab Reports of Computer Architecture and Organization

Download Course Syllabus for Computer Organization | CPSC 2105 and more Lab Reports Computer Architecture and Organization in PDF only on Docsity! TSYS Department of Computer Science College of Science – Columbus State University Course Title: CPSC 2105 - Computer Organization Instructor Name: Neal L Rogers, Ph.D. Office: Tech 425 Phone: (706) 565-4095 E-Mail: Rogers_Neal@colstate.edu 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: 1. The top-level architecture of a computer: CPU, Memory, and I/O Component. ABET Criteria Covered: A, C, I Program Objectives Covered: 2 2. Description of the instruction set of a simple computer; the Fetch-Execute cycle. ABET Criteria Covered: A, C, I Program Objectives Covered: 2 3. The defining characteristics of the first four generations of computers. ABET Criteria Covered: A, C, I Program Objectives Covered: 2 4. Different number systems: binary, octal, decimal, and hexadecimal. ABET Criteria Covered: A, C, I Program Objectives Covered: 2 5. Data representation in modern computers: two’s-complement arithmetic, Floating point representation in computers: the IEEE-754 standard, and Character representation in computers: ASCII, EBCDIC, and UNICODE. ABET Criteria Covered: A, C, I Program Objectives Covered: 2 6. The Basic Boolean functions and gates used to implement above functions. ABET Criteria Covered: A, C, I Program Objectives Covered: 2 7. The function of simple combinational circuits: Adders, Multiplexers, Demultiplexers, Encoders, and Decoders. ABET Criteria Covered: A, C, I Program Objectives Covered: 2 8. Computer arithmetic: Numeric Overflow and Saturation Arithmetic. ABET Criteria Covered: A, C, I Program Objectives Covered: 2 9. The four basic types of flip-flops and the tables characterizing each type. Introduction to the design of sequential circuits. ABET Criteria Covered: A, C, I Program Objectives Covered: 2 10. The basic ideas of an instruction set, including instruction types, addressing modes, and instruction-level pipelining. ABET Criteria Covered: A, C, I Program Objectives Covered: 2 11. The difference between RISC and CISC architectures and the advantages of each. ABET Criteria Covered: A, C, I Program Objectives Covered: 2 12. Basic concepts of computer memory: ROM, RAM, the memory hierarchy (cache and virtual memory), and Big–Endian vs. Little–Endian addressing. ABET Criteria Covered: A, C, I Program Objectives Covered: 2 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 Subroutine Linkage and Stacks Subroutine Linkage: Static and Dynamic Memory Allocation Stack-Based Linkage and Recursion System Software An overview of the operating system Protected Environments: Virtual Machines and Partitions. Database Software and Management of Database Transactions. The Java Virtual Machine. Communications and the Internet Low-Level I/O, TCP Sockets, and TCP Ports Network Protocols: ISO/OSI and TCP/IP Network Organization. Other Course Policies Attendance Policy I usually do not take roll, but believe that it is important for students to attend class regularly. If you find it necessary to miss one or more classes, you are still responsible for all material covered in the class, and for submitting the homework on time (prior to the start of class). Students absent without excuse on a day that homework is due will get a 0 (zero) on that homework assignment, unless it is submitted early. Any student absent without excuse on a day when he or she is called to present a homework solution to the class will receive a 0 (zero) for that presentation. Students should notify me in advance of expected class absences to avoid penalties on homework due on the date you miss. Excuses will be granted after the absence only for cases of medical emergencies etc. as defined in CSU policy. For more information on class attendance and withdrawal, refer to http://aa.colstate.edu/advising/a.htm#Attendance%20Policy Dropping the Course We hope that you will complete the course and profit from it. If it is necessary for you to withdraw from the course during the semester, you must follow all official CSU procedures for withdrawing. It is not sufficient to notify the instructor; you must use the ISIS system and withdraw officially. For details on how to withdraw from a course, see the web page http://aa.colstate.edu/advising/w.htm#Withdrawal%20from%20a%20Course. NOTE: The deadline to drop courses has been changed to the fourth week of class! 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.