COMSATS University Islamabad
Department of Computer Science
Course Syllabus
Course Information
Course Code: CSC325 Course Title: Computer Organization & Assembly Language
Credit Hours: 3(2, 1) Lecture Hours/Week: 2
Lab Hours/Week: 3 Pre-Requisites: EEE240-Fundamental of Digital Logic Design
Catalogue Description:
This course covers the concepts of computer organization along with programming in Assembly language.
Topics include: Preliminary Concepts of Computer Organization; Von Neumann Architecture; IA-32
Microprocessors Organization; Modes of the processors; Non-Von Neumann Architectures; Pipelined vs. Non-
Pipelined Systems; Parallel Processing; CISC vs. RISC Processors; Instructions Set Design & Formats;
Addressing Modes; Memory System Organization & Architecture; Utilization of Memory Systems in
Programming; IO Fundamentals; Data Transfer methods; CPU Performance Calculation; and Assembly
Language Programming.
Text and Reference Books
Textbook:
1. Assembly Language for x86 Processors, Irvine, K.R., Pearson, 2020.
Reference Books:
1. Computer Organization and Architecture, William S., Pearson, 2019.
2. Essentials of Computer Organization and Architecture, Null L., Jones and Bartlett, 2019.
Week wise Plan:
CDF
Lecture Reading
Unit Topics Covered
# Material
#
1 Kip R:Ch1
1. Basic Computer Components, Computer Organization
1 Von Neumann Architecture and Model, Instruction Execution Cycle, Kip R:Ch1
2.
Instruction Set Architecture, Instruction Processing
1 Modes of Operation/Processor; Registers; Real and Protected William:Ch3
3.
Address modes
1 Kip R:Ch2
4. X86 and X64 bit Processors
2 William:Ch10,11
5. Non-Von Neumann Architecture
2 Pipelined and Non-Pipelined Computer Systems, Pipelined System William:Ch11
6.
Clock Cycle, Efficiency. Superscalar Architecture.
2 Vector Processors and Parallel Processing. Comparison of CISC and William:Ch11
7.
RISC Processors.
2 Kip R:Ch3
8. Instruction set Format and Designs, Instruction format trade-offs
2 Common Addressing Modes, Basic Addressing Modes, Register Kip R:Ch4
9.
Addressing, X86 Addressing Modes
3 Computer Memory System Organization, Memory Types i.e., Kip R:Ch4
10.
Registers, Cache Memory, Main Memory, Secondary Memory
3 Memory Hierarchy Insights, Locality Assignment No. 01of Kip R:Ch4
11.
Reference, Cache Mapping
1
Direct Mapping, Fully Associative Mapping, Set Associative William:Ch7
12. 3
Mapping and PA(Physical Address)
Link Library Overview; Calling, Linking Book Library; Info to Kip R:Ch5
13. 4
Library procedures
Kip R:Ch5
14. 4 User define Procedures, Program design using Procedures
Boolean and Comparison Instructions (AND, OR, NOT, XOR, Kip R:Ch6
15. 4
TEST, CMP)
CPU Performance Calculations, Cycles Per Instruction (CPI) Cycles
Kip R:Ch6
16. 5 Per Instruction (CPI), CPU clock rate, Program Execution Time,
CPU Average CPI
17.
Mid Term Exam
18.
Factors Affecting CPU Performance, Aspects of CPU Execution
Kip R:Ch6
19. 5 Time Aspects of CPU Execution Time, Instruction Types & CPI,
Frequency & CPI Instruction Frequency & CPI
Kip R:Ch6
20. 5 MIPS, Megaflops, and SPEC.
21. 6 Assembly Language Programming Kip R:Ch4
22. 6 Basic Elements, Program Development Cycle Kip R:Ch4
23. 6 Instruction Formats, Data Declaration & Addressing Modes Kip R:Ch4
24. 6 Arrays & Structures Access Kip R:Ch6
25. 6 Conditional and Unconditional Jumps Kip R:Ch6
26. 6 Irvine Library and its Functions Kip R:Ch10
27. 7 Assembly Language Programming Advanced Concepts Kip R:Ch10
28. 7 Arithmetic Expressions Kip R:Ch6
29. 7 Logical Operations, Conditional & Repetitions Kip R:Ch6
30. 7 Procedures in Assembly Language and Macros Kip R:Ch5
31. 7 Windows Programming Kip R:Ch5
32. 7 High-level Language Interfaces Kip R:Ch5
Final Term Exam
Graduate Attributes (GAs)
S.# Description
Apply knowledge of computing fundamentals, knowledge of a computing specialization, and mathematics,
1 science, and domain knowledge appropriate for the computing specialization to the abstraction and
conceptualization of computing models from defined problems and requirements.
Identify, formulate, research literature, and solve complex computing problems reaching substantiated
2 conclusions using fundamental principles of mathematics, computing sciences, and relevant domain
disciplines.
Design and evaluate solutions for complex computing problems, and design and evaluate systems, components,
3 or processes that meet specified needs with appropriate consideration for public health and safety, cultural,
societal, and environmental considerations.
Course Learning Outcomes (CLOs)
Blooms
Sr.# Unit# Course Learning Outcomes Taxonomy GA
Learning Level
CLO’s for Theory
Articulate the components of a computer along with its
CLO-1 1-2 Understanding 2
architecture.
Review memory systems and its hierarchy along with
CLO-2 3-4 Understanding 2
IO methods.
2
CLO-3 5
Compute the performance of CPU. Applying 3
Demonstrate assembly language programming
CLO-4 6-7 Applying 2,3
capabilities.
CLO’s for LAB
Apply concepts of computer organization using a
CLO-5 1-4 Applying 2,4
debugging tool.
Construct assembly language programs of reasonable
CLO-6 6-7 Creating 3-4
complexity.
CLO Assessment Mechanism
Assessment
CLO-1 CLO-2 CLO-3 CLO-4 CLO-5 CLO-6
Tools
Quizzes Quiz 1 Quiz 2 Quiz 3 Quiz 4 - -
LAB
Assignment LAB
Assignments - Assignment 1 Assignment 4 Assignment
2&3 Assignments
s
Mid Term Mid Term Mid Term Lab Mid
- - -
Exam Exam Exam Term Exam
Lab Project/
Final Term
Final Term Exam - Lab Final
Exam
Term Exam
Policy & Procedures
• Attendance Policy: Every student must attend 80% of the lectures as well as laboratory in this course.
The students falling short of required percentage of attendance of lectures/laboratory work, is not allowed
to appear in the terminal examination.
• Course Assessment:
Mid Term Terminal
Quizzes Assignments Final Marks
Exam Exam
Theory (T) 15 10 25 50 100
• Grading Policy: The minimum passing marks for each course is 50% (In case of LAB; in addition to
theory, student is also required to obtain 50% marks in the lab to pass the course). The correspondence
between letter grades, credit points, and percentage marks at CUI is as follows:
Grade A A- B+ B B- C+ C C- D+ D F
Marks >= 85 80 - 84 75 - 79 71 - 74 68 - 70 64 - 67 61 - 63 58 - 60 54 - 57 50-53 < 50
Cr. 3.67- 3.34- 3.01- 2.67- 2.34- 2.01- 1.67- 1.31- 1.01- 0.10-
0.00
Point 4.00 3.66 3.33 3.00 2.66 2.33 2.00 1.66 1.30 1.00
• Missing Exam: No makeup exam will be given for final exam under any circumstance. When a student
misses the mid-term exam for a legitimate reason (such as medical emergencies), his grade for this exam
will be determined based on the Department policy. Further, the student must provide an official excuse
within one week of the missed exam.
• Academic Integrity: All CUI policies regarding ethics apply to this course. The students are advised to
discuss their grievances/problems with their counsellors or course instructor in a respectful manner.
• Plagiarism Policy: Plagiarism, copying and any other dishonest behaviour is prohibited by the rules and
regulations of CUI. Violators will face serious consequences.