Fazaia College of Education

For Women

Department: Computer Science

Prepared By: Amaar Feroze

Course Title: Computer Organization and

Assembly Language

Course Code: CS 223

Session: 20209-2024
 Fazaia College of Education for Women

Department: Computer Science

Course Plan

Instructor Name: Amaar Feroze Semester: BSCS-III (Sep 202120 – Feb

202221)

Department: Computer Science Program: BSCS Semester No: III

Course Title: Computer Organization Code:  CS-223 Credit Hours: 3+1

and Assembly Language

Course Content:
Introduction to computer systems: Information is bits + context, programs are translated by other
programs into different forms, it pays to understand how compilation systems work, processors read
and interpret instructions stored in memory, caches matter, storage devices form a hierarchy, the
operating system manages the hardware, systems communicate with other systems using networks;
Representing and manipulating information: information storage, integer representations, integer
arithmetic, floating point; Machine-level representation of programs: a historical perspective,
program encodings, data formats, accessing information, arithmetic and logical operations, control,
procedures, array allocation and access, heterogeneous data structures, putting it together:
understanding pointers, life in the real world: using the gdb debugger, out-of-bounds memory
references and buffer overflow, x86-64: extending ia32 to 64 bits, machine-level representations of
floating-point programs; Processor architecture: the Y86 instruction set architecture, logic design and
the Hardware Control Language (HCL), sequential Y86 implementations, general principles of
pipelining, pipelined Y86 implementations

Domai Leve PL
CLO n l O

Acquire the basic knowledge of computer organization, computer

1 architecture and assembly language C 2 1

Understand the concepts of basic computer organization,

2 architecture, and assembly language techniques C 3 1

Solve the problems related to computer organization and assembly

3 language C 4 2
 Reference Books:

1. Computer Systems: A Programmer's Perspective, 3/E (CS:APP3e), Randal E. Bryant and

David R.O' Hallaron, Carnegie Mellon University
2. Robert Britton, MIPS Assembly Language Programming, Latest Edition,
3. Computer System Architecture, M. Morris Mano, Latest Edition,
4. Assembly Language Programming for Intel- Computer, Latest Edition
5. Instructor's Manual for Computer Organization and Assembly Language Book by James
Lyle Peterson
6. Principles of Computer Organization and Assembly Language Book by Patrick Juola

Course Outline:
1 Data representation and Number system
2 Computer Organization
3 The 80x86 Microprocessor
4 80x86 Addressing Mode
5 Introduction to Assembly Programming
6 Directives and a simple program
7 Data types and data definition
8 Comparison and Conditions
9 Arithmetic and Logic Instructions and Program
10 The Stack
11 Interrupts
12 What is a Macro and how is it Used?
13 String Processing
14 Combining
15 Comparison with other Processor
Lecture Plan:

Weeks Topics Sub Topics Activities

• Binary Numbers
• Conversion Between Number System
• Addition and Subtraction
• How Integers are Presented in the Computer
• Unsigned Integers
Data • Signed Integers
1 Representation
and Number • Decimal Interpretation
System • Hexadecimal Interpretation
• Character Presentation

• Some Important terminology

• Internal organization of computers
Computer • System Buses Quiz No. 1
2 Organization • CPU and its relation to RAM and ROM
• Inside CPU
• Internal working of Computers
• Brief History of the CPU
• CICS vs. RISC
•
• Brief History of the 80x86 Family
• Memory organization
The 80x86 • Segmented memory model
3 Microprocessor • Logical address and physical address Quiz No.
• Registers Architecture 1Assignment 01
• FLAGS Register

•
• Register Addressing mode 41
• Immediate addressing mode 41
• Direct addressing mode 42
4 80x86 Addressing • Register indirect addressing mode 42
mode • Based relative addressing mode 43
• Indexed relative addressing mode 43
• Based indexed address mode 44

• Assembly language Programming

• MOV instruction
Introduction to • ADD instructions
5 Assembly • Program Segments Assignment
programming • Assembl. Links. and RUN a program 1Quiz No. 2
• More sample programs
 • Segments of a program
• Stack segment definition
Directives and • Data segment definition
6 a simple • Code segment definition
program • Assembly. Links and RUN a program

• 80x86 data type

7 Data Types and • Assembly data directives Quiz No.23
Data definition • Creating and Running a program
• More Sample Programs
• Analysis of program

• Loops
• Conditional Jumps
8 Comparison • Unconditional Jump
and Conditions • Relative Addressing
• Types of Jump
• Sorting Example

• Unsigned Addition and Subtraction

• Unsigned Multiplication and Division
Arithmetic and • Logic Instruction and sample program Assignment 2
Logical • Shift Instruction
Instructions and • Rotate Instruction
9 Program

• A Stack application
• Terminology of production
10 The Stack • CALL and RET Quiz No. 4
• An Example of a procedure
• Program design using procedures

• Software Interrupts
• Hooking an interrupts Quiz No. 3
11 Interrupts • BIOS and DOS Interrupts
• Hardware Interrupts

• MACRO definition
12 What is a macro • Comments in a macro
and how it is used • Analysis of program
• Local Directive and it is use in macros
• Include directive
 • STOS Example Clearing the screen
• LODS Example String Printing
13 String processing • SCAS Example String Length
• LES and LDS Example
• MOVS Example String Comparison
•

• Why C?
• Interesting 80x86 assembly code into C programs
14 Combining • C program that call Assembly Procedures Quiz No. 4
Assembly • C Calling Convention
Language and C • How parameters are returned to
• New assemblers and linking with C
• Passing array address from C to the Stack
• Linking assembly language routines with C

Comparison with • Motorola 68k processor

15 other procedures • SUN SPARC processor
Assessment Policy:

(a) Quizzes: A minimum of 4 quizzes will be conducted throughout the semester 2

prior to midterm and 2 after midterm. There will be no makeup quizzes for any type of
absentees.
(b) Assignments: Assignments will be conducted throughout the semester.
(c) Midterm Test: There will be one such test in each semester. The test will be of 35
marks and 120 minutes duration. Marked papers will be shared with the students. There
will be no makeup midterm for any type of absentees.
(d) Project: The students will prepare project individually. The instructor will check
and return. Presentation and discussion of the project will be held in the classroom. No
extension in timelines will be provided to any individual student.
(e) Final Examination: The final comprehensive examination will be held in each
course at the end of the semester. The test will be of 45 marks and 180 minutes duration.
The final term exam will be conducted from complete syllabus and at least one third of the
paper content will comprise from the syllabus covered before midterm.
(f) Paper Pattern: The pattern of the examination for midterm and final term
Examination will be determined by the instructor according to the nature of the subject, in
consultation with the Principal and Program Coordinators.
 Weight-age of Examinations: Following distribution of marks is to be followed
for determining a student’s grade
 Quizzes 10%
 Midterm 35%
 Assignments 10%
 Final Examination 45%
 Minimum Attendance Requirement: Students are expected to attend all the
classes to take full advantage of the learning opportunities including quizzes, tests,
home assignments, projects and presentations. A minimum of 75 percent class
attendance is mandatory to sit in the final examination of every semester. No
allowance whatsoever shall be given on this account.
Teaching Methodologies

 Lecture Method
 Discussion Method
 Demonstration Method
 Project Method
 Inductive/Deductive Method

Activities

 Group Activities
 Individual Activities
 Pair Work
 Home Assignment
 Project
 Presentations
 Class room discussion.
GRADING POLICY:

Percentage Letter Grades Grade Points Mid Points of

Grade
90-100 A 4
85-89 A- 3.67-3.99 3.83
80-84 B+ 3.33-3.66 3.49
75-79 B 3.00-3.32 3.16
70-74 B- 2.67-2.99 2.83
66-69 C+ 2.33-2.66 2.49
62-65 C 2.00-2.32 2.16
58-61 C- 1.67-1.99 1.83
50-57 D 1.00-1.66 1.32
Note:

i. Grading Key for final exams implemented W.E.F

June 2010.
ii. Grading Key is according to the HEC ‘S Criteria.

iii. No Marks will be round off on subject Performa at any

stage even in the final marks columns.