Jordan University of Science & Technology

Faculty of Computer & Information Technology

Year: 2009/2010 Department of Computer Engineering Semester: Second

Course Information
Course Title Computer Organization and Design
Course Number CPE 252
Prerequisites CPE 251: Digital Logic Design
Course Website http://elearning.just.edu.jo
Instructor Dr. Khaldoon Mhaidat, Dr. Mohammad Fraiwan, Dr. Moad Mowafi
Coordinator
Office Location E1-L3, C5-L2, M2-L2
Office Phone 7201000
Office Hours TBD
E-mail mhaidat@just.edu.jo, mfraiwan@just.edu.jo, mowafi@just.edu.jo
Assistants TBA
Catalog Description
Basic computer organization; memory systems including caches, computer arithmetic, processors, controllers, input/output,
buses, DMA; data formats; addressing modes; instruction sets and microcode; design of a simple computer. Pre: CPE 251

Text Book
Title Computer System Architecture
Author(s) M. Morris Mano
Publisher Prentice-Hall
Edition / Year 3rd Edition / 1993
Book Website N/A
References Computer Organization and Design: The Hardware/Software Interface, Patterson and Hennessy

Assessment Policy
Assessment Date Weight
First Exam During the 5th or 6th week 25%
Second Exam During the 11th or 12th week 25%
Pop-up Quizzes 10%
Final Exam During the 16th week (Scheduled by A & R) 40%
Total 100%

Course Objectives Weights

This course is designed to help students:
1. Understand the various digital components used in the organization and design of digital computers 15%
2. Design an elementary basic computer 30%
3. Develop basic instruction set for a simple digital computer. 30%
4. Write assembly-language programs for various computer applications 20%
5. Understand and design Input/output and memory units 5%

Teaching & Learning Methods

ƒ Lectures, lecture notes and assignments are designed to achieve the course objectives.
ƒ Students are expected to read the material as detailed in the text, complete the assignments/project on time and
participate in class.
ƒ Course web page is an essential part of the course.
 Learning Outcomes:
Upon successful completion of this course, students should be able to:
Related Reference(s)
Objective(s)
1,2,4 Use register transfer language to express microoperation in symbolic forms Ch 4
1,5 Construct a common bus system with multiplexers and three-state gates Ch 4
1,2 Develop a composite arithmetic logic shift unit Ch 4
1 Describe the internal operations of a basic computer Ch 4
1, 2,3 Use register transfer language to specify the requirements for the design of a basic computer Ch 5
2,3 Identify opcodes for basic computer instructions Ch 5
1,2 Design control logic circuits for various hardware computer components such as AC, AR, Ch 5
adder, etc.
2,3 Define memory- and register-reference instructions by means of register transfer language. Ch 6
(e.g ADD, LDA, etc.)
1,2,3 Demonstrate how interrupt instruction is executed on a basic computer Ch 6
3,4 Translate an assembly language (symbolic) code to an equivalent a binary program. Ch 6
4 Use a loop in an assembly\t language program Ch 6
4 Write a small-size subroutine program Ch 6
1,2 Specify the address sequencing capabilities in a control memory Ch 7
2,3,4 Write symbolic microprogram for different control routines such as FETCH, ADD, STORE Ch 7
2 Describe the steps in designing a microprogrammed control unit Ch 7
1,4 Understand the operation and design of a stack in a basic computer Ch 8
4 Understand the use of different addressing modes (e.g. direct, indirect,..) in programming Ch 8
4 Describe the operation of arithmetic, logical, and shift instructions Ch 8
4 Calculate the effective address for a given instruction using different addressing modes. Ch 8
5 Differentiate between synchronous and asynchronous transfer modes Ch 11
5 Design a daisy –chain priority interrupt Ch 11
1,5 Describe the operation of DMA transfer in a computer system Ch 11
1, 5 Understand the organization of the main memory Ch 12
1,5 Use basic RAM and ROM chips to make larger memory space Ch12

Course Content
Week Topics Chapter in Text
1 Review of Digital Logic: Components, Circuits and Representations 1, 2 and 3
2 Register Transfer Language and Microoperations 4
3 Micro-operations 4
4+5 Instruction Codes and Instruction Sets 5
6+7 Timing and Control 5
8 Programming: Machine and Assembly Language 6
9 Programming: Arithmetic, Logic and I/O 6
10 + 11 Microprogrammed Control 7
12 Central processing Units 8
13 Memory Technology and Organization 12
14 Input/Output Organization 11
15 Evaluation and Exam Review
 Essential Notes
Homework ƒ Homework assignments are due at the beginning of class.
ƒ Late homework assignments will not be accepted.
ƒ Assignments have to be done independently and submitted in hand-written.
ƒ Similar works will receive ZERO and may face disciplinary actions.
Exams ƒ May include: Definitions, True/False, Multiple-Choice, Analysis and Descriptive formats.
ƒ Use only your own tools: calculator, pens and ruler
ƒ Instructions on the first page of the exam are quite important.
ƒ Not abiding by the rules is a reason for dismissal from the exam.

Additional Notes
Makeups ƒ Makeup exam should not be given unless there is a valid excuse.
Drop Date ƒ Last day to drop the course is before the 12th week of the current semester.
Cheating ƒ Standard JUST policy will be applied.
Attendance ƒ Excellent attendance is expected.
ƒ JUST policy requires the faculty member to assign ZERO (35%) if a student misses more than
10% of the classes without an excuse.
ƒ Attendance will be taken by calling the names, passing a sign-up sheet, or through quizzes.
ƒ If you miss a class, it is your responsibility to find out about any announcements or assignments
you may have missed.
Workload ƒ Average work-load student should expect to spend is 10 hours/week.
Graded Exams ƒ Graded exam papers will be returned within a week.
Participation ƒ Participation in the class will positively affect your performance.
ƒ Disruption and side talks will possibly result in dismissal from class.
ƒ No eating or chewing gums are allowed in class.