Course: Computer Architecture and Organisation

1

Course Contents

Lecture Schedule

Week 1 - Overview

Week 2 - Representation of Data

Week 3 - Representation of Data

Integers

Week 4 - Integers
Week 5 - Boolean Algebra
Week 6 - Boolean Algebra
Week 7 - The Arithmetic Logic Unit
Week 8 - Computer Architecture
Week 9 - Computer Architecture
Week 10 - Programming Overview
Week 11 - Programming Overview
Week 12 - Instruction
Week 13 - Structure of Computer Systems

Week 14 - Operating Systems

Tutorial Schedule

Week 1 - Introduction to DEBUG

Week 2 - Introduction to DEBUG

Number Conversion

Week 3 - Number Conversion
Week 4 - Arithmetic Operators
Week 5 - Arithmetic Operators

Logical Operators
Week 6 - Logical Operators
Week 7 - Addressing Modes
Week 8 - Addressing Modes

Instructions
Week 9 - Instructions

Lab Test

Week 10 - String Operations
Week 11 - String Operations
Week 12 - String Operations and Script File
Week 13 - Script File

Week 14 - Test

2

Course Learning Outcomes

At the end of the course, student will be able to:

describe boolean algebra, computer arithmetic, manipulation of numbers in alternative bases, basic ideas, principles, memory, data and program used in all digital system; (C2, PLO1)
classify the operations performed by major hardware components based on the logical structure of typical system hardware and software; and (P2,PLO2)
outline simple logic circuits . (C4,PLO3)

3

Assessment Schedule

This course is assessed by both coursework and examination.

Coursework Percentage: 40%

Examination Percentage: 60%

TASKS	Marks	Week
Class Test	20%	Week 11
Practical Test	10%	Week 13
Programming Report	10%	Week 8

ASSESSMENT COVER PAGE File

4

Online Class

5

Topic 1: Overview

LEARNING OUTCOMES

By the end of this topics, you will be able to:

1. define some different types of computer systems and basic components of a digital computer.

2. describe CPU operation.

3. explain evolution of CPU.

4. explain pipelining and super scaling.

INTRODUCTION

This topic explains about the computer architecture and computer organisation which has major contributions to the computer system. Computer architecture deals with the functional behavior of a computer system as viewed by a programmer. It is like the size of a data type for example 32 bits to an integer). There are many levels in computer architecture which can be classified into the highest level to the lowest level. User runs the program at the highest level while the transistors and wires are available at the lowest level. Computer organization deals with structural relationships that are not visible to the programmer which like clock frequency or the size of the physical memory

Lecture Note: Topic 1 - Overview (2 SLT) File

This is the Lecture Note of Topic 1 - Overview. Please read before you continue with the exercise in Self-Check 1. It will cover 2 hours of student learning time (SLT).
Self Check: Quiz 1 (1 SLT)

Now, you have to answer the questions in this section before you are allow to continue to the new topic. This activity will cover 1 hour of student learning time (SLT)
Summary
In this topic you have learnt that:

Some different types of computer systems, basic components, basic components of a digital computer, Central Processing Unit (CPU) operation, evolution of Central Processing Unit (CPU), pipelining and super scaling.

6

Topic 2: Representation of Data

LEARNING OUTCOMES

By the end of this topics, you will be able to:

1. describe data organisations and numbering system.

2. convert numbers between number bases.

3. use binary numbers, hexadecimal numbers and arithmetic.

4. use fraction and mixed number conversions.

INTRODUCTION

This topic explains about data representation methods used to represent information stored in a computer. There are different types of data stored in the computer such as numbers, letters, sounds and images.

Lecture Note: Topic 2 - Representation of Data (2 SLT) File

This lecture note will deepen your understanding on this topic. Please read through the note before you continue with the activities.
Self Check: Representation of Data (2 SLT) Lesson

In this activity, you have to watch the video and answer the question given. This activity will cover 2 hours of student learning time (SLT).
Summary
In this topic you have learnt that:
Data organisation, numbering system, numeric conversion between number bases, binary numbers, hexadecimal numbers, arithmetic, fraction and mixed number conversions.

7

Topic 3: Integers

LEARNING OUTCOMES

By the end of this topics, you will be able to:

1. describe unsigned, BCD number representation, sign magnitude and negative numbers.

2. explain overflow, carry, floating points, format and exponents.

3. use unsigned, BCD number representation, sign magnitude and negative numbers.

4. use overflow, carry, floating points, format and exponents.

INTRODUCTION

This topic explains about unsigned, BCD number representation, signed magnitude and negative numbers. It also covers the overflow, floating points, format and exponents.

Unsigned

Unsigned represents the positive integers. For example, 157₁₀ can be represented as shown in Table 3.1 below:

Table 3.1
Position	7	6	5	4	3	2	1	0
Bit pattern	1	0	0	1	1	1	0	1
Contribution	2⁷			2⁴	2³	2²		2⁰

ADVANTAGES AND DISADVANTAGES OF UNSIGNED

BCD NUMBER REPRESENTATION

BCD number representation is a way to express each of the decimal digits with a binary code. In BCD, the decimal digit is represented by a 4-bit binary number. It can represent sixteen numbers (0000 to 1111) however in BCS code, it is only first ten of these are used (000 to 1001). The remaining are invalid in BCD.

It is shown in Table 3.2:

advantages and disadvantages of BCD representation

SIGN AND MAGNITUDE

Sign magnitude notation is one of the methods used to represent the negative numbers. In signed magnitude the left-most bit represents the sign of the integer where zero (0) for positive numbers and one (1) for negative numbers. The remaining bits represent magnitude of the numbers.

Example 1:

0 0 1 1 0 1 0 1 = +53 Positive magnitude bits sign

1 0 1 1 0 1 0 1 = -53 Negative magnitude bits sign

Example 2:
Suppose 10011101₂ is a signed magnitude representation. The sign bit is 1, then the number represented is negative. It can be represented as in Table 3.3:

Table 3.3

Position

7

6

5

4

3

2

1

0

Bit pattern

1

0

0

1

1

1

0

1

Contribution

-

2⁴

2³

2²

2⁰

The magnitude is 0011101₂ with a value 2⁴+2³+2²+2⁰= 29₁₀. So, the number represented by 10011101₂is –29.

The advantage of signed magnitude representation is it represents positive and negative numbers. The disadvantages of signed magnitude representation; it has two representations of zero and arithmetic operations are difficult.

Lecture Note Topic 3 - Integers File
Self Check: Integers Quiz
Restricted Not available unless:
The activity UnsignedUnsigned represents the positive integers... is marked complete
The activity Lecture Note Topic 3 - Integers is marked complete
Summary
In this topic you have learnt that:
Unsigned, BCD number representation, sign magnitude, negative numbers, overflow, carry, floating points, format and exponents.

8

Topic 4: Boolean Algebra

LEARNING OUTCOMES

By the end of this topics, you will be able to:

1. describe fundamental concept of Boolean Algebra, Boolean Functions, Truth Table and Algebraic manipulation of Boolean expressions.

2. simplify Boolean functions.

3. use Boolean function for correspondence with electronic circuits, combinational logic and sequential logic.

4. use sequential and clocked logic mutually exclusive projects.

INTRODUCTION

This topic explains about the fundamental of Boolean Algebra, Boolean functions, truth table and Algebraic manipulation of Boolean expressions.

Boolean Algebra

Operator Name	Alternate Name	Example	Alternative Representations
AND	Intersection logical multiplication	xy	x.y, x∩y, x&y, x∧y
OR	Union logical addition	x + y	x∪y, x∨y
NOT	Complement inversion	¬x	x’

For example, the values of x∧y, x∨y, and ¬x can be expressed by tabulating their values with the following truth table:

x	y	x∧y	x∨y	¬x	¬y
0	0	0	0	1	1
1	0	0	1	0	1
0	1	0	1	1	0
1	1	1	1	0	0

LOGIC GATES

Restricted Not available unless: The activity Self Check: Integers is marked complete

Lecture Note Topic 4: Boolean Algebra File
Self Check: Boolean Algebra

1. Use a truth table to simplify the following expressions:

(x.y) + (¬x.y)
(¬x.y).(x.y)

2. Use a Boolean Algebra to simplify the following truth tables:

x

y

x∨y

0

0

0

1

0

1

0

1

1

1

1

1

3. List THREE (3) basic logic gates.

4. Draw a logic gate for the AND, OR and NOT logic operation.
5. Draw a logic diagram for the following Boolean expressions:

(A + ^¬B + C) (^¬A + B + ^¬C)
(A + B + ^¬C) (A + B + ^¬C) (^¬A + ^¬B + ^¬C)
^¬A +((B + C)(^¬B + ^¬C)
Restricted Not available unless:
The activity Boolean Algebra is marked complete
The activity Lecture Note Topic 4: Boolean Algebra is marked complete
Summary:
In this topic you have learnt that:
Fundamental concept of Boolean Algebra, Boolean Functions, Truth Table, Algebraic manipulation of Boolean expressions, Boolean functions, Boolean function for correspondence with electronic circuits, combinational logic, sequential logic, sequential and clocked logic mutually exclusive projects

9

Topic 5: The Arithmetic Logic Unit

LEARNING OUTCOMES

By the end of this topics, you will be able to:

1. describe the construction of the ALU.

2. explain the binary half-adder, full adder and binary-coded-decimal (BCD) adder.

3. explain positive and negative BCD numbers, shift operation and high speed arithmetic.

INTRODUCTION

This topic explains about the Arithmetic Logic Unit (ALU) construction, binary half-adder, binary full adder, binary coded decimal (BCD), positive and negative BCD, shift operation and high speed arithmetic.

Arithmetic Logic Unit (ALU)

The arithmetic logic unit (ALU) is a part of computer that performs arithmetic and bitwise operations on integer binary numbers which contrast to a floating-point unit (FPU) that operates on floating point numbers. It consists of combinational digital electronic circuit that becomes a fundamental building block of many types of computing circuits, including the central processing unit (CPU) of computers.

BINARY HALF-ADDER

The binary half adder is a logic circuit (Figure 5.29) that has 2 inputs; A and B that added together. It has two outputs; sum (S) and carry (C). The value of the sum in decimal system is 2C + S. The carry signal represents an overflow into the next digit of a multi-digit addition.

The simplest half-adder incorporates an XOR gate for S and an AND gate for C. With the addition of an OR gate to combine their carry outputs, two half adders can be combined to make a full adder.

The half-adder truth table is as shown in Table 5.9 where S= A Å B (Exclusive OR) and C = A.B (AND).

A	B	Sum	Carry-Out
0	0	0	0
0	1	1	0
1	0	1	0
1	1	0	1

FULL ADDER

The full-adder has 3 inputs; A, B and C_inthat adds three one-bit binary numbers. The outputs are 2 one-bit binary numbers, a sum (S) and a carry (C_out). The full-adder is usually a component in a cascade of adders that add 8, 16, 32 binary numbers.

The simplest way to construct a full adder logic diagram is to connect two half- adder and
an OR gate as shown below. The full-adder is then the fundamental logic
circuit incorporated in digital computers to perform arithmetic functions.

The full adder truth table is represented in Table 5.10 where S= A Å B Å C_in and C=AB + C_in (A Å B).

A

B

Carry-In

Sum

Carry-Out

0

0

0

0

0

0

0

1

1

0

0

1

0

1

0

0

1

1

0

1

1

0

0

1

0

1

0

1

0

1

1

1

0

0

1

1

1

1

1

1

Restricted Not available unless: The activity Self Check: Boolean Algebra1. &nb... is marked complete

Lecture Note Topic 5 - The Arithmetic Logic Unit File
Self Check - Topic 5 Lesson
Summary
In this topic you have learnt that:
The Arithmetic Logic Unit (ALU) construction, binary half-adder, binary full adder, binary coded decimal (BCD), positive and negative BCD, shift operation and high-speed arithmetic.

10

Topic 6: Computer Architecture

LEARNING OUTCOMES

By the end of this topics, you will be able to:

1. describe the computer operation, interconnection of buses and addressing techniques

2. explain the flags, condition codes, status registers and storage units.

3. explain the subroutine calls, interrupts, pipelined computers.

4. identify the RISC architecture, CISC architecture, security and protection.

INTRODUCTION

This topic explains the computer operation, interconnection of buses, addressing techniques, flags, condition codes, status registers, storage units, subroutine calls, interrupts, pipelined computers, RISC architecture, CISC architecture, security and protection.

Processing and Control Unit

The central processing unit (CPU) is a part of the computer architecture that performs as an electronic circuitry within a computer. It carries out the instructions of a computer program by performing the basic arithmetic, logical, control and input/output (I/O) operations specified by the instructions.

The Components of Central Processing Unit

Fetch-Execute Instruction Cycle

Interconnection Buses

Addressing Techniques

The most common addressing techniques are:

1) Implied and Immediate Addressing Modes

2) Direct or Indirect Addressing Modes

3) Register Addressing Modes

4) Register Indirect Addressing Mode

5) Auto-Increment and Auto-Decrement Addressing Modes

6) Displacement Based Addressing Modes

Flags, Conditions Codes and Status Registers

Flag

Name

Description

Z

Zero Flag

Indicates that the result of an arithmetic or logical operation (or, sometimes a load) was zero.

C

Carry Flag

Carry/borrow. Set with a carry from an addition or borrow from a subtraction.

S/N

Sign Flag

Negative Flag

Indicates that the result of a mathematical operation is negative.

V/O/W

Overflow Flag

Overflow. Set if a 2’s complement overflow condition is generated.

Lecture Note Topic 6 - Computer Architecture File
Self Check - Topic 6 Forum

Discuss the function of memory, cache memory and virtual memory.
Summary
In this topic you have learnt that:
The computer operation, interconnection of buses, addressing techniques, flags, condition codes, status registers, storage units, subroutine calls, interrupts, pipelined computers, RISC architecture, CISC architecture, security and protection.

11

Topic 7: Programming Overview

LEARNING OUTCOMES

By the end of this topics, you will be able to:

1. define the features of high-level programming languages and program editors.

2. describe the concept of program translation, compilers, interpreters and assemblers.

3. explain the linking, loading and debuggers.

INTRODUCTION

This topic explains the features of high-level programming languages, program editors, concept of program translation, compilers, interpreters and assemblers, linking, loading and debuggers.

Features of High Level Programming Language
Mostly, in computer architecture, contemporary programming is carried out using high-level languages. It has the following characteristics:

·      Require translation

·      Portable

·      Easier to read, write and maintain as commands are similar to English

·      Allow access to module libraries

·      Use data types and data structures, selection statements and repetition/iteration constructs

·      Use logic operators and functions that are built into the language
Program Editors

The program editors or text editors are software programs that enable the user to create and edit text files. In the programming, the program editor usually refers to source code editors that include many special features for writing and editing code. The Notepad and Wordpad are common program editors on Window operating system and vi, emacs, Jed, pico are the program editors on UNIX operating system. The text editors’ features are moving the cursor, deleting, replacing, pasting, finding, finding and replacing, saving etc.
Program Translation

There is a translator software in random access memory (RAM) during the program execution. The translator software will take the code written in a high-level language and translate it into an executable code. The executable code is in binary form and can be understood by the processor. In high level programming language, there is no one to one conversion between code and binary instructions.

There are two forms of translator software; compiler or an interpreter.
Compiler
The compiler will translate the source code into an object code. It is held in random access memory (RAM) only for the time that it takes to translate the source code into object code. The compilers will translate lines one after the other however they do not execute a line immediately after translation. Instead, the object code file can be used to run the program after translation. The run time is more efficient when the object code creation by compiler however if there are errors in the source code, the programmer will be responsible to re-compile for the corrected code.
Interpreters
The translation with interpreter will translate each line of code one line at a time. The code will be executed once the line of code is translated and if there is error, the interpreter will not move on to translate the next line. The notification on the error will be sent immediately to user. The interpreter is less efficient than a compiler because it is only presenting in main memory during the program execution and for the execution of every line only. The benefit of using an interpreter is that the execution will stop immediately if the interpreter translates a line of source code that results in an error. It will help the programmers to identify and rectify the errors. It cannot determine the actual error but can indicate the line that was not translated into executable machine code.
Assemblers
Assemblers are the program that translates assembly program (input) into object
code (output).

The assembler is a software utility that takes an assembly program as input and produces object code as output. The assembler views this file as a block of memory starting at relative location 0.

There are two general approaches of assemblers; Two-pass Assembler (more common) and One pass Assembler.

In the first pass of two-assembler, the assembler is only concerned with label definitions which construct a symbol table that consists of label and location counter values. The second pass reads the program again from the beginning. The, each instruction is translated into the appropriate binary machine code.

It is possible to implement as assembler that makes only a single pass through the source code however the main difficulty in trying to assemble a program in one pass involves forward references to labels. The instruction operands may be symbols that have not yet been defined in the source program
Linking and Loading

Debuggers
In programming, the debugger is a program or tool that can run other program one line at a time. The debugger can show exactly how the computer sees the code. The debugger shows what is happening in the program at any moment in time, and allows to perform step by step through the program. Proper use of the debugger is essential to finding semantic (logical) errors in how the program behaves.
Lecture Note Topic 7 - Programming Overview File
Self-Check - Topic 7 Forum

Discuss how the compilers, interpreters and assemblers used for programme translation.
Summary
In this topic you have learnt that:
The features of high-level programming languages, program editors, concept of program translation, compilers, interpreters and assemblers, linking, loading and debuggers.

12

Topic 8: Instruction

LEARNING OUTCOMES

By the end of this topics, you will be able to:

1. explain the characteristics of instructions.

2. write format, type and number of address.

INTRODUCTION

This topic explains the characteristics of instructions, format, type and number of address.

Characteristics

The machine instructions or computer instructions is a processor operation which determined by the execution of the instructions. The collection of different instructions that the processor can execute is referred to as the processor’s instruction set.

The processor required the information provided by each instruction for execution. There are four elements of instructions; operation code, source operand reference, result operand reference and next instruction reference. Operation code or opcode specifies the operation to be performed (e.g., ADD, I/O). The operation is specified by a binary code. The source operand reference in the operation may involve one or more source operands that are inputs for the operation. Result operand reference becomes the reference for operation after produce a result. Lastly, next instruction reference that tells the processor the location to fetch the next instruction after the execution of current instruction complete.

The source and result operands consist of main or virtual memory, processor register, immediate and input/output device.

Format, Type, Number and Address

Opcode	Description
ADD	Add
SUB	Subtract
MUL	Multiply
DIV	Divide
LOAD	Load data from memory
STOR	Store data to memory

Most computers fall into one of the following types of CPU organization:

i. Single Accumulator organization: ADD X AC ® AC + M [×]

ii. General Register Organization: ADD R1, R2, R3 R ® R2 + R3

iii. Stack Organization: PUSH X

Following are the address instructions in computer:

i. Three address instruction

Computer with three addresses instruction format can use each address field to specify either processor register is memory operand.

For example:

ADD R1, A, B R1 ® M [A] + M [B]
ADD R2, C, D R2 ® M [C] + M [D]		X = (A + B) * (C + D)
MUL X, R1, R2 M [X] R1 * R2

ii. Two address instruction

Most common in commercial computers. Each address field can specify either a process register on a memory word.

For example:

MOV	R1, A	R1 ® M [A]
ADD	R1, B	R1 ® R1 + M [B]
MOV	R2, C	R2 ® M [C]	X = (A + B) * ( C + D)
ADD	R2, D	R2 ® R2 + M [D]
MUL	R1, R2	R1 ® R1 * R2
MOV	X, R1	M [X] ® R1

iii. One address instruction

It used an implied accumulator (AC) register for all data manipulation. For multiplication/division, there is a need for a second register.

LOAD	A	AC ® M [A]
ADD	B	AC ® AC + M [B]
STORE	T	M [T] ® AC	X = (A +B) × (C + A)
LOAD	C	AC ® M [C]
ADD	A	AC ® AC + M [A]
MUL	T	AC ® AC + M [T]
STORE	X	M[X] = AC

Lecture Note Topic 8 - Instruction File
Self Check - Instructions Lesson
Summary
In this topic you have learnt that:
The characteristics of instructions, format, type and number of address.

13

Practical 6 - Instructions

1.    You have to record (use screen recorder) all steps you perform for this practical.

2.    Open the browser and go to this link: http://ionicabizau.github.io/arc-assembler/

3.    Write the following programmes in assembly language using ARC assembler provided in the link.

4.    View the result of each programme.

5.    Save and submit the video to Moodle.
Submission: Practical 6 Assignment

14

Topic 9: Structure of Computer Systems

LEARNING OUTCOMES

By the end of this topics, you will be able to:

1. describe the hardware components and computer interconnection.

2. explain the transmission protocol and data transmission formats.

3. explain the networking local area networks and wide area networks.

INTRODUCTION

This topic explains the hardware components, computer interconnection, transmission protocol, data transmission formats, networking local area network (LAN) and wide area network (MAN).

Hardware Components
There are four basic functions that a computer can perform, data processing, data storage, data movement and control.
In data processing, the data are in various form thus the processing also is broad however there are few fundamental methods or types of data processing available. In the data storage, the computer stores some data that actively work at given time which is short-term data storage function.
The computer also performed the long-term storage function for file storage, update and retrieval. The computer requires devices which able to move the data from sources to destinations.
Process of data receiving or delivering is known as input-output and the device is known as peripheral. Data also can be moved remotely through data communication process.
Lastly, the control unit manages the computer’s resources and monitor the performance when response to instructions.

The structure of computer can be categorized into two categories;
simples-single processor computer
multicore computer structure.

The traditional simple-single processor computer has fours components; control unit, arithmetic and logic unit (ALU), registers and CPU interconnection. The multicore computer structure is for contemporary computers.
The processors are in a single chip or known as multicore computer. Each processing unit consists of control unit. ALU. registers and cache which called core.
Computer Interconnection

Transmission Control Protocol and Transmission Format

Transmission Control Protocol (TCP)
Internet Protocol (IP)

Types of Networks:
Local Area Network (LAN)
Wide Area Network (WAN)
Lecture Note Topic 9 - Structure of Computer Systems File
Summary
In this topic you have learnt that:
The hardware components, computer interconnection, transmission protocol, data transmission formats, networking local area network (LAN) and wide area network (MAN).
Self Check - Topic 9 Quiz

15

Topic 10: Operating Systems

LEARNING OUTCOMES

By the end of this topics, you will be able to:

1. describe file management and utilities.

2. explain system and communication software.

INTRODUCTION

This topic explains the file management and utilities in operating systems. It is also explains the system and communication software.

File Management
An operating system is a program that acts as an interface between the user and the computer hardware and controls the execution of all kinds of programs.

The file management is the operating system function that organized the files into directories for easy navigation and usage. These directories may contain files and other directions. An Operating System keeps track of information, location, uses, status etc, decides who gets the resources, allocates the resources and de-allocates the resources.

Utilities

Many operating systems provide utilities to administer and troubleshoot. Most of the operating systems provide context sensitive help to use the tools.

For example, anti-virus, achievers, backup software, clipboard managers, cryptographic, data compression, data synchronization, file synchronization, revision control, disk checkers and disk cleaners.

System and Communication Software

Communication software is used to provide remote access to systems and exchange files and messages in text, audio and/or video formats between different computers or users.

This includes terminal emulators, file transfer programs, chat and instant messaging programs, as well as similar functionality integrated within MUDs.

The term is also applied to software operating a bulletin board system, but seldom to that operating a computer network or Stored Program Control exchange

Communications software helps transmit information between different software systems. This platform enables you to access remote computers and transmits files in various formats between systems. Popular communication software solutions are file transfer protocol (FTP), instant messaging apps, live chat, and email. Another widely used product nowadays is Voice over Internet Protocol (VoIP). VoIP enables you to make calls at a cheap rate as all you need is internet access. Enterprises can use communications software to enable their employees to exchange info securely and privately, and also to contact customers using secure channels. To choose a suitable communications system for your company, check out the current front-runner in this category RingCentral as well as other widely used products
Summary
In this topic you have learnt that:
The file management and utilities, system and communication software.
Lecture Note Topic 10 - Operating Systems File
Self-Check - Topic 10 Quiz

16

Topic 11: Introduction to Debug

Introduction to Debug File
1.      Visit https://copy.sh/v86/debug.html

2.      Choose Debugger (MS-DOS)

3.      Loading the DEBUG program

i.        Load the DEBUG program by typing debug at the MS-DOS prompt, as shown in the example below: C:\WINDOWS>debug

NOTE: You have to hit Enter key.

ii.        You will see a dash (-) in the left-most column on the screen. This is the DEBUG prompt.

iii.        Type a (?) to see a list of available commands.

NOTE: You have to hit Enter key.

4.      Examining and modifying the contents of the 8086’s internal registers

i.          Use the REGISTER command to display the current contents of all the internal registers by typing R.

NOTE: You have to hit Enter key.
ii.          List the values of the following registers:

·         AX

·         SI

·         DI

·         DX

·         IP

iii.          Enter the command: R CL (hit Enter key) What happens and why?

5.    Examining and modifying the contents of memory:

i.     Use the DUMP command (D) to display the first 50 bytes of the current data segment.

Restricted Not available unless: The activity Introduction to Debug is marked complete
Submission: Practical 1 Assignment
Restricted Not available unless:
The activity Introduction to Debug is marked complete
The activity 1. Visit https://cop... is marked complete

17

Practical 2 - Number Conversion

Practical 2 - Number Conversion Assignment

Restricted Not available unless: The activity Lecture Video: Topic 2 - Representation of Data (1 SLT) is marked complete

18

Practical 3 - Arithmetic Operators

Practical 3 - Arithmetic Operators Assignment

Restricted Not available unless: The activity Lecture Note Topic 3 - Integers is marked complete

19

Practical 5 - Addressing Mode

1.    Given the following Assembly language programmes:

·         addtest

·         storetest

·         hextest

·         xor

2.    Add the comment for each line of the instruction.

3.    Explain what the program is intend to do.

4.    Run the programmes through the ARCToolsv1.2.8. Observe the result

5.    Screenshot the result (after you stop run).
6. Write a finding of the result.
Submission: Practical 5 Assignment
ARC Tool and Example Files

20

Examination

OEC3120 Computer Architecture and Organisation Examination 20th April 2024 9.00am - 12.00pm (Remotely Proctored) Quiz

View Make attempts: 1

Computer Architecture and Organisation

Section

General

Course Contents

Course Learning Outcomes

Assessment Schedule

Online Class

Topic 1: Overview

Topic 2: Representation of Data

Topic 3: Integers

Topic 4: Boolean Algebra

Topic 5: The Arithmetic Logic Unit

Topic 6: Computer Architecture

Topic 7: Programming Overview

Topic 8: Instruction

Practical 6 - Instructions

Topic 9: Structure of Computer Systems

Topic 10: Operating Systems

Topic 11: Introduction to Debug

Practical 2 - Number Conversion

Practical 3 - Arithmetic Operators

Practical 5 - Addressing Mode

Examination

Contact Us

Table 3.3
Position	7	6	5	4	3	2	1	0
Bit pattern	1	0	0	1	1	1	0	1
Contribution	-			2⁴	2³	2²		2⁰

A	B	Carry-In	Sum	Carry-Out
0	0	0	0	0
0	0	1	1	0
0	1	0	1	0
0	1	1	0	1
1	0	0	1	0
1	0	1	0	1
1	1	0	0	1
1	1	1	1	1