It is required to assign a unique integer ID number to each student in a class of
100 students. What is the minimum number of bits required?
_
What range of signed integer values can be represented in
n bits?
_
Determine the decimal value of the byte
xFC
;
; For the Datum provided do three kinds of Shifts instructions,
; Each of them in the right and left direction.
; Shifts are: Logical, Arithmetic and Circular
; Each shift instruction will be printed along with its original data.
;
.ORIG x3000
MAIN
LEA
Page | 1
Name
Description
FETCH:
DECODE:
EVALUATE ADDRESS:
FETCH OPERANDS:
EXECUTE:
STORE RESULT:
Which phases always occur during the processing of every instruction?
_FETCH and DECODE_
Which phase is specific to the DATA MOVEMENT instructions?
_EVALUATE
;
; This program will:
; Set the bits for the DATA according to the MASK
; Complement the bits for the DATA according to the MASK
; Test for Carry and Overflow for four different additions (R1 + R2)
; If Carry and/or Overflow is detected, the subsequent l
CDA 3103
Pestaina
Test 3
1 Hour
Summer 2013
August 1, 2013
Name: _
Student #: _
Closed Book
No calculators
Please turn your communication devices OFF
There are questions on 4 pages.
Write your answers in the spaces provided.
You must answer all 4 question
CDA 3103
Test I
Pestaina
Name:
1 Hour
Summer 2013
May 30, 2013
_
Student #:
_
There are questions on 4 pages.
Answer all questions for full points. The points for each part are
shown in square brackets, e.g. [3]
Show all your work in the spaces provided
T
1. Circuits/Control/Data Path
a. High Bit = (JAMZ * Z) + (JAMN * N) + Next_Address[8]
But, the Next_Address[8] is wired directly to MPC so it doesnt need to be included
b. MPC[0-8] = NEXT_ADDRESS[i] + ( JMPC * MBR[i] )
Typically, we only want the contents
CDA 3103
Pestaina
Assignment #1: Machine Language
DUE: Wednesday, July 8
Summer 2015
1) Download the source code for Figure 5.17 from the textbook webpage as code1.bin.
Enter x3000 for the programs load-address as the first line of the program.
Enter x3
CDA 3103
Pestaina
Assignment #1: Machine Language
DUE:
Fall 2016
1) Download the (incomplete) source code for Figure 5.17. Save it as charCount1.bin.
Enter x3000 for the programs load-address on the first line of the program.
Enter x3100 for the startin
CDA 3103
Pestaina
Assignment #2: Assembly Language
DUE: Sunday, July 19
Summer 2015
Overview
The LC-3 provides TRAP routines for character input and output. For this assignment,
you must implement and test user subroutines for input and output of unsigned
CDA 3103
Pestaina
Assignment #3: Assembly Language
DUE: Sunday,
Summer 2015
Overview
Software integer multiplication can be implemented using shifting and addition. One algorithm
is described in the class notes:
http:/users.cis.fiu.edu/~pestaina/RightShif
Patt & Patel, Problem 3.24, Page 89
a. What is the output of the circuit?
When X = 0, S =
When X = 1, S =
b. Modify the circuit (small adjustments only) so that
When X = 0, S = A + B
When X = 1, S = A - B
Figure 3.39, page 89
Homework 6 Due 12:00PM on Monday, April 9
Primary contact for this homework: Yinggang Huang [[email protected]]
You must do this homework in groups of two. This homework must be submitted online. No hard copies
will be accepted.
Important Notes:
This h
CDA 3103
Test II
Summer 2013
Pestaina
1 Hour
June 27, 2013
Name: _
Student #: _
Closed Book
No calculators
Please turn your communication devices OFF
There are questions on 3 pages.
Write your answers in the spaces provided.
You must answer all 3 question
CDA 3103
Pestaina
Assignment #1: Machine Language
DUE: Sunday, November 08
Fall 2015
1) Download the (incomplete) source code for Figure 5.17. Save it as charCount1.bin.
Enter x3000 for the programs load-address on the first line of the program.
Enter x
7.1 Assembly Language Programming
Assembly languages let us use mnemonic devices for opcodes (e.g. ADD and NOT) and give
meaningful symbolic names to memory locations (e.g. SUM and PRODUCT), rather than use
their 16-bit addresses.
7.2 An Assembly Language
Instruction Cycle
FETCH
MAR PC; PC PC + 1;
rd; MDR memory[MAR];
IR MDR;
DECODE
IR[15:12] interpreted by Control Unit
EVALUATE ADDRESS
Calculate memory address needed to complete
the operation identified at the DECODE phase
FETCH OPERANDS
Obtain data from
Signed Integer Representations
All representations: 0/1
in the high bit position indicates +/-
Sign-Magnitude Representation
High bit stores 0/1 to represent +/ Remaining n-1 bits store the magnitude of the integer
59
-59
Example (1 Byte):
= b0011 1011
Binary equivalent of a real number
1.
2.
3.
4.
5.
Convert the integer part by repeated division by 2 (or some other algorithm)
Convert the fraction part by repeated multiplication by 2
Join these two parts together to form a binary fixed point number
Add
CDA 3103
Pestaina
Assignment #3: Assembly Language
DUE: Sunday, December 6
Fall 2015
Overview
Software integer multiplication and division can be implemented using shifting and addition.
Efficient extended multiplication and division algorithms are descri
Hello, Im Alain Galvan, a student in your CDA3103 U01 class. I thought Id
spend a bit of time making a web game for your students to play around with
converting binary and hex numbers to decimal. Here, check it out.
http:/codepen.io/alaingalvan/pen/uspCc
Character String Formats
Unpacked
F
I
U
P
a
n
t
h
e
r
s
!
00
00
00
00
00
00
00
00
00
00
00
00
00
00
46
49
55
20
50
61
6E
74
68
65
72
73
21
00
Packed
49
20
61
74
65
73
00
00
46
55
50
6E
68
72
21
00
a
b
a AND b
a OR b
a XOR b
0
0
1
1
0
1
0
1
0
0
0
1
0
1
1
1
0
1
1
0
0 AND x = 0
1 AND x = x
Data:
Mask:
AND:
xxxxxxxx
11110000
xxxx0000
AND to clear bits
-0 OR x = x
Data: x x x x x x x x
1 OR x = 1
Mask: 1 1 1 1 0 0 0 0
OR:
1111xxxx
OR to set bits
-0 XOR