Course File - Course Specifications
Spring 2018
Department of Information Technology
Printed as of: Tuesday December 19 1
Faculty of Computing and Information Technology
The objective of this course is to provide an introduction to basic computer organization. Topics include binary, hexadecimal, and decimal number conversions, binary number arithmetic, laws of Boolean algebra, basic computer logic, gates, combinational circuits, sequential circuits, adders, counters, registers, decoder, encoder, comparator, multiplexer, computer organization buses and computer architecture, cache memory, computer arithmetic, instruction sets, and addressing modes.
Catalog Description
Lab/Tutorial 90 minutes 1 times/week
Meet 50 minutes 3 times/week or 80 minutes 2 times/week Class Schedule
9780135064177
Textbook
0135064171
William Stallings, "Computer Organization and Architecture" 8 edition (2009)
ISBN-13 ISBN-10
Computer Architecture CPIT-210
Department Required Prerequisite: CPCS-202
2 3 4 5 7 8 8 9 10 10 12 12 13 14 14 16
Graded Lab Work 1 Graded Lab Work 2 Graded Lab Work 3 Quiz 1
Exam 1 Quiz 2
Graded Lab Work 4 Graded Lab Work 5 Exam 2
Graded Lab Work 6 Graded Lab Work 7 Quiz 3
Graded Lab Work 8 Lab Exam
Group Project Exam
Assessment
1 1 1 2 15
2 1 1 20
1 2 1 2 10 10 30
Week Grade %
Grade Distribution
Relationship to Student Outcomes
x x x x
Design and Derive logic expressions for different hardware devices (a)
Analyze physical systems to convert into hardware design (b)
Implement hardware systems using simulators (i)
Convert the micro operations of instructions into hardware design (c)
Define the relations between hardware and operating systems (a)
Identify the interaction between the CPU and the different computer units and I/O devices (a)
Discover the need for caching and the different caching techniques (a)
Write programming in hypothetical/Intel assembly language (i)
Recognize the hardware needed to support different types of instructions (a)
Apply the different addressing modes in assembly programming (i)
Integrate basic components learned for hardware solutions of the problems (i)
Write assembly language programming (i)
Recognize the hardware support for time sharing system and modular design (i)
Course Learning Outcomes (CLO)
By completion of the course the students should be able to a b c d e f g h i j k l m n 3 ( Theory: 3, Lab: 0, Practical: 1)
Last Articulated
December 18, 2017
Dr. Muhammad Khamis, Assistant Professor
Coordinator(s)
1.
2.
3.
4.
5.
6.
7.
8.
9.
10.
11.
12.
13.
CPIT-210 Syllabus
Classification:
Credit:
Course File - Course Specifications
Spring 2018
Department of Information Technology
Printed as of: Tuesday December 19 2
Faculty of Computing and Information Technology
Analog and digital systems Number systems and logic gates
boolean algebra and Logic Circuits and simplification Arithmetic circuits and comprators
Decoder, Encoder, Multiplexer Flip/Flops and Counters
Registers, Shift Registers and review previous topics Computer Prototype
Buses and Computer Architecture Cache memory
Instruction Sets: Characteristics and Functions Instruction Sets: Addressing Modes and Format Review
1 1 1 1 1 1 1 1 1 3 1 1 1
CPIT-210 Syllabus
Topics Coverage Durations
Weeks Topics
