Faculty of Computing and

Technology Department of
Computing
Bachelor of Science in Computer Science/
Software Engineering Fundamentals of
Computer Systems – Batch 01

Assignment :

Tasks1
1. Explain the functions of all of MARIE’s registers.
Accumulator – 16 bit register that holds a conditional operator or
one operand of a two operand instruction.
Memory address register – 12 bit register that holds the memory
address of an instruction or the operand of an instruction.
Memory buffer register – A bit register that holds the data after its
retrieval from, or before its placement in memory.
Program counter- A bit register that holds the address of the next
program instruction to be executed.
Instruction register – Which holds an instruction immediately
preceding its execution.
Input register – An 8 bit register that holds data read from an input
device.
Output register- An 8 bit register that holds data that is ready for
the output device.

2. Explain how each instruction in MARIE works.

Load instruction – Moves data from memory into the CPU

Store instruction – Allows us to move data from the CPU back to

memory
Add and Subt instructions – Adds and Subtracts respectively the
data value found at address X to or from the value in the AC.

Input and Output – Allow MARIE to communicate with the outside

world.

The Halt command – Causes the current program execution to

terminate

The Skipcond instruction - Allows us to perform conditional

branching

Jump X – Load the value of X onto the PC.

3. How does a machine language differ from an assembly

language? Is the conversion one-to- one (one assembly
instruction equals one machine instruction)?
Machine language is a series of bit patterns, that are directly
executed by a computer, whereas Assembly Language is a low
level language that needs a compiler and an interpreter, which
converts that language to machine language.
Machine language is platform dependent, whereas Assembly is
platform independent.
Machine language is not human readable, but Assembly
language is a set of instructions which can be read by humans
and can be understood as well.
Machine language can be extremely time consuming, tedious
and error prone whereas Assembly language is much less
tedious and error prone than machine code

One machine language instruction corresponds to one machine

language instruction.
4. What is the significance of RTN?
RTN- Register Transfer Notation
The significance of RTN is that Symbolic notation is used to describe
the behavior of micro-operations.

5. Is a microoperation the same thing as a machine

instruction?

A micro operation is the most basic operation achievable by a

processor.
A micro instruction is a set of micro operations which are
executable simultaneously.
6. Explain the difference between register-to-register,

register-to-memory, and memory-to- memory

instructions.

Register to register - Arguments involve only registers, data

moves only within the registers, time execution is much
faster and the length of the bus connecting the registers is
the shortest.

Register to memory – Arguments involve a register and a

memory location, data moves between a register and a
location in memory time of execution is slower and the
length of the bus is
longer.hbdhbchvdgcvdwguvdgvcdgvgvdgvcgddd

Memory to memory - Arguments involve only memory

locations, data moves between two locations in memory,
time of execution is the slowest and the length of the bus is
longer.

7. Several design decisions exist with regard to instruction

sets. Name four and explain.
1. Complexity: How much efforts are required to decode an
 instruction, how complex it is and what amount of time will
be required.

2. Space: While designing the total amount of space needs to be

calculated as everything comes with a cost and we need to
have a better design with as minimal cost as it could be.

3. Length: The length of instruction needs to undergo thinking

while design decision, do we need fixed length instruction or
variable length as before executing the instruction the CPU
needs to first decode the instruction size and again everything
comes with a price.

4. Number: Number of instructions needs to be thought

properly as the more number of instructions the more time
consuming and complex the design becomes.

8. What is an expanding opcode?

Expanding opcodes represent a compromise between the need for
a rich set of opcodes and the desire to have short opcodes, and
thus short instructions.

9. If a byte-addressable machine with 32-bit words stores

the hex value 98765432, indicate how this value would be
stored on a little-endian machine and on a big-endian
machine. Why does “endian-ness” matter?
00 01 10 11
Big Endian 98 76 54 32
Little 32 54 76 98
Endian

If one computer reads bytes from left to right, and another

computer reads from right to left, we're going to have issues when
both computers need to communicate. Endianness means that the
bytes in computer memory are read in a certain order, therefore
we won't have any issues if we never need to share information.
 10. How do memory-memory, register-memory, and load-
store architectures differ? How are they the same?
Memory-memory architectures may have two or three
operands in memory, allowing an instruction to perform an
operation without requiring any operand to be in a register.
Intel and Motorola are examples of register-memory
architectures

Register-memory architectures require a mix, where at least

one operand is in a register and one is in memory. Digital
Equipment’s VAX architecture allows memory-memory
operations

Load-store architectures require data to be moved into

registers before any operations on those data are performed.
SPARC, MIPS, Alpha, and the PowerPC are all load-store
machines.

11. Name the seven types of data instructions and explain

each.
Data Movement - Most frequently used instructions. Data is
moved
from memory into registers, from registers to registers and from
registers to memory. Many machines provide different instructions
depending on the source and destination.

Arithmetic Operations - Arithmetic operations include those

instructions that use integers and floating-point numbers.

Boolean Logic Instructions - Boolean logic instructions perform

Boolean operations, much in the same way that arithmetic
operations work. There are typically instructions for performing
AND, NOT, OR, XOR, TEST, and COMPARE.
Bit Manipulation Instructions - Bit manipulation instructions are
used for setting and resetting individual bits within a given data
word.

Input/Output Instructions - I/O instructions vary greatly from

architecture to architecture. The input instruction
transfers data from a device or port to either memory or a specific
register. The output instruction transfers data from a
register or memory to a specific port or device.

Transfer of control - Control instructions are used to alter the

normal sequence of program execution. These instructions include
branches, skips, procedure calls, returns, and program termination.
Branching can be unconditional or conditional.

Special Purpose Instructions - Special-purpose instructions include

those used for string processing, high-level language support,
protection, flag control, word/byte conversions, cache
management, register access, address calculation, no-ops, and any
other instructions that don’t fit into the previous categories.
12. What is an address mode?
Addressing modes allow us to specify where the instruction
operands are located. An addressing mode can also specify a
constant, a register, or a location in memory.
13. Convert the following expressions from infix to reverse
Polish (postfix) notation.
a) A * B + P * Q + V * U

Input Expression Stack Positive Expression

A ( A
* (* A
B (* AB
+ (+ AB*
P (+ AB*P
* (+* AB*P
Q (+* AB*PQ
+ (++ AB*PQ*
V (++ AB*PQ*V
* (++* AB*PQ*V
U (++* AB*PQ*VU
) AB*PQ*VU*++

b) A X B + W X (U X V + Z)

Input Expression Stack Postfix Expression

A ( A
* (* A
B (* AB
+ (+ AB*
W (+ AB*W
* (+* AB*W
( (+*( AB*W
U (+*( AB*WU
* (+*(* AB*WU
V (+*(* AB*WUV
+ (+*(+ AB*WUV*
Z (+*(+ AB*WUV*Z
) (+* AB*WUV*Z+
) AB*WUV*Z+*+

14. (W X (A + B X (U X V)))/(U X (A + B))

Input Expression Stack Postfix Expression

( ((
W (( W
* ((* W
( ((*( W
A ((*( WA
+ ((*(+ WA
B ((*(+ WAB
* ((*(+* WAB
( ((*(+*( WAB
U ((*(+*( WABU
* ((*(+*(* WABU
V ((*(+*(* WABUV
) ((*(+* WABUV*
) ((* WABUV**+
) ( WABUV**+*
/ (/ WABUV**+*
( (/( WABUV**+*
U (/( WABUV**+*U
* (/(* WABUV**+*U
( (/(*( WABUV**+*U
A (/(*( WABUV**+*UA
+ (/(*(+ WABUV**+*UA
B (/(*(+ WABUV**+*UAB
) (/(* WABUV**+*UAB+
) (/ WABUV**+*UAB+*
) WABUV**+*UAB+*/

Convert the following expressions from reverse Polish

15.
notation to infix notation.
a) W A B Z *+ *
W*(A+B*Z)
b) U V W * Y Z + + +
U+(V*W+Y+Z)
c) X Y Z + V W Z+

16. In a computer instruction format, the instruction length

is 11 bits and the size of an address field is 4 bits. Is it
possible to have
 5 2-address instructions
 45 1-address instructions
  32 0-address instructions
using the format? Justify your answer.

There are 2^11 possible values which can be represented with 11

bits, so there will be 2048 possible instruction codes.
The given patterns are possible if the number of combinations is
lesser than the total number of possible combinations.
5 2-address instructions
Every address has 2^4 (16) possible values, and two addresses
require 16*16vpossible combinations. 5 such instructions need
5*16*16 (1280) values in all.
1280 < 2048
Hence , 5 two-address instructions are possible.

45 1-address instructions
In the same way we can find out that we need 45*16 (720) values
to represent all the 1-address instructions.
720 < 2048
Hence , 45 one-address instructions are possible.

32 0-address instructions
The zero-address instructions need only one value each. Therefore
32 values will be needed.
32 < 2048
Hence , 32 zero-address instructions are possible.
 Task 2:

Computers are categorised into four groups based on their

shape, size, and computing power. A computer's preference is
determined by various aspects, including the type of CPU and
processing speeds, memory and storage volume, quantity of
user interactions, and cost. Supercomputers are the most
powerful and require an exclusive environment to process
millions of data points.
I. Server Computers
II. Workstations
III. Laptop
IV. Portable devices including Tab and Mobile

Server Computers

A Server can be either a physical machine, a virtual machine or a

software, executing server functions. A physical server refers to a
computer known as “server computer” that runs server software.
Servers can be seen in three shapes : Tower, Blade and Rack
Mount.
These shapes are
Compare the specifications of the following computer systems
and suggest the best usage of each device.

Submit: Online LMS (No emails are accepted).

Submissions: MS Word (doc or docx) format. (Maximum 1000
words. Include clear diagrams if necessary).
Deadline: 20th February 2023 on or before 5.00 pm.
Deadlines are not extending. However, the late submissions
are accepted with 10% deduct on each day for the late
submissions).
Note that: 50% or 100% penalty for the plagiarism.

******End of the
Assignment******