Академический Документы
Профессиональный Документы
Культура Документы
SEMESTER DISEMBER DEPARTMENT: COURSES / CODE: CREDIT(S): PREREQUISITE(s): LECTURER: 3 NONE FAUZIH BINTI AYOB INFORMATION AND COMMUNICATION TECHNOLOGY COMPUTER ORGANISATION/FP203
SYNOPSIS: COMPUTER ORGANIZATION course is designed to introduce the basic concepts on which the stored program digital computer is formulated. These include the functional units of a computer (hardware), the flow (buses) and storage (memory management) of information, the representation and manipulation of numbers in binary form, and the five to seven levels around which any computer is designed. This goal addresses the questions, how does a computer work and how is it organized. The course also provides students with foundation knowledge of the CPU (Central Processing Unit) and assembly language programming.
LEARNING OUTCOMES: By the end of the course, students should be able to: No . Course Learning Outcome (CLO) explain appropriate hardware technical specification, input output processes and computer architecture apply appropriate method to solve arithmetic problem in numbering Construct a simple Programme Learning Outcome(s) LEARNING DOMAINS Assessment Methods Tutorial Exercises, Quiz, Peer Assessment and Test Tutorial Exercises, Quiz and Test Tutorial
PLO1, PLO9
C4
2 3
PLO4
C3
program in assembly language to perform a given task STUDENT LEARNING TIME: Code FACE TO FACE Delivery Method Coursework Assessment
PLO4
C3
Exercises, Peer Assessment, Problem Based Task and Test Student Learning Time(Hours) 30 30
Teaching and Learning Activities Lecture Tutorial Lecture Hour Assessment - Test - Quiz - Peer Assessment Tutorial Hour Assessment - Tutorial Exercises
5 30 15 7 120 3
WEEKLY SCHEDULE: TOPIC 1 : COMPUTER HARDWARE AND FLOW OF INFORMATION 1.1 Explain the basic concepts computer architecture TOPIC 1 : COMPUTER HARDWARE AND FLOW OF INFORMATION 1.2 Explain computers bus system. TOPIC 2: DATA REPRESENTATION IN COMPUTER MEMORY 2.1 Understand data representation on CPU.
WEEK 2
of
PEER ASSESSMENT
WEEK 3
TUTORIAL EXERCISE 1
WEEK 7
TOPIC 2: DATA REPRESENTATION IN COMPUTER MEMORY 2.2 Perform operations with Boolean Algebra. TOPIC 2: DATA REPRESENTATION IN COMPUTER MEMORY 2.3 Construct combinational logic circuits. TOPIC 3: INSTRUCTION SET AND ASSEMBLY LANGUAGE PROGRAMMING 3.1. Understand the instruction set. TOPIC 3: INSTRUCTION SET AND ASSEMBLY LANGUAGE PROGRAMMING 3.2 Apply assembly language. TOPIC 4: THE CENTRAL PROCESSING UNIT 4.1 Understand the Central Processing Unit (CPU). TOPIC 4: THE CENTRAL PROCESSING UNIT 4.2 Understand stack organization. TOPIC 5: MEMORY ORGANISATION 5.1 Explain the computer memory. TOPIC 5: MEMORY ORGANISATION 5.2 Understand the concept of cache memory. TOPIC 6: INPUT/OUTPUT MODULE 6.1 Understand Input/output (I/O) in computer system. TOPIC 6: INPUT/OUTPUT MODULE 6.2 Describe Input/ Output data transfer.
TUTORIAL EXERCISE 4
WEEK 11
WEEK 12
QUIZ 2
WEEK 13 WEEK 14
WEEK 15
WEEK 16
WEEK 17
EVALUATION: i. Continuous Assessment (CA) No. 1 2 3 Assessment Problem Based Task Tutorial Exercises Peer Assessment Number 1 10 2 Total (%) 20 35 10
4 5
Quiz Test
3 2 TOTAL
5 30 100
ii. Final Examinations (FE) This final examination is carried out at the end of the semester
REFERENCES: Miles J. Murdocca, Vincent P. Heuring, (2000). Principles of Computer Architecture. Prentice Hall (ISBN: 0-202-43664-7) Carl Hamacher, Vvonko Vranesic, Safwat Zaky, (2002). Computer Organization. (5th Edition. Mc Graw Hill (ISBN: 007112218-4) M. Morris Mano, (1993) Computer System Architecture (3rd Edition). Prentice Hall (ISBN: 0131757385) William Stallings, (2000). Computer Organization and Architecture. Prentice Hall (ISBN: 0-13- 085263-5)
Prepared by: Certified by: