CS2100: Computer Organisation
Tutorial #2: Boolean Algebra and Logic Gates
Answers to Selected Questions
Tutorial Questions:
1. Using Boolean algebra, simplify each of the following expressions into simplified
sum-of-products (SOP) expressions. Indicate t
CS2100 Computer Organisation
Tutorial #4: MSI Circuits
(17 18 February 2014)
[ This document is available on course website http:/www.comp.nus.edu.sg/~cs2100/3_ca/tutorials.html ]
The 3 IVLE discussion questions below will not be discussed in tutorial. Yo
CS2100 Computer
Organisation
http:/www.comp.nus.edu.sg/~cs210
0/
MSI Components
(AY2015/6 Semester 1)
WHERE ARE WE NOW?
Number systems and codes Preparation: 2 weeks
Boolean algebra
Logic gates and circuits
Simplification
Logic Design: 3 weeks
Combination
CS2100 Computer Organisation
Tutorial #12
(Virtual Tutorial)
This is for you to practice. I will post the answers some
time later.
1.
Using square DRAM bit planes of 512x512 bits, show how a 16 bit word
DRAM organization would be like by filling in the de
CS2100 Computer Organisation
Tutorial #10
(3-7 November 2014)
For this tutorial, in order to save time, first draw your answers on the Powerpoint slide
tut9.ppt (for the first two questions) and tut10.ppt found in the Tutorial folder of IVLE
which you sho
CS2100 Computer Organisation
Tutorial #11
(10-14 November 2014)
This is the last tutorial.
1.
A machine with a word size of 16 bits and address width of 32 bits has a directmapped cache with 16 blocks and a block size of 2 words.
(a)
Given a sequence of m
CS2100 Computer Organisation
Tutorial #9
(27-31 Oct November 2014)
1. Using the true MIPS instructions of slti, be and bne, show how the following
branch pseudo-instructions may be implemented:
a) bgt
b) blt
c) bge
d) ble
$x,
$x,
$x,
$x,
$y,
$y,
$y,
$y,
L
CS2100 Computer Organisation
Tutorial #8
(20-24 October 2014)
1. Show the minimal sequence of MIPS instructions for this C statement:
c = (a + b) * 32;
Assume that variables a, b and c correspond to registers $s0, $s1 and $s2 respectively.
2. Show the min
CS2100 Computer Organisation
Tutorial #6
(7-10 October 2014)
1.
Below is the a 2-bit synchronous counter built using T-flip-flops. The default
initial output of Q is 0. The T-flip-flops are positive edge triggered. Give the 2bit (AB in that order) count s
CS2100 Computer Organisation
Tutorial #7
(13 Oct 17 Oct 2014)
1. The following are two IEEE 754 Single Precision floating point numbers
(represented as hexadecimal strings): (a) 0x383FFBAD, and (b) 0x3FD0ECCD.
Perform floating point addition of (a) and (b
CS2100 Computer Organisation
Tutorial #5
(29 Sep-3 October 2013)
1. Given the following two functions:
(a) f(x, y, z) = m(1, 3, 5)
(b) g(x, y, z) = m(0, 1, 4, 5, 6)
0
38
Decoder 1
How do you implement each of them using a
single 38 decoder with active-low
CS2100 Computer Organisation
Tutorial #3
(8 12 September 2014)
1. What is the function of the circuit below?
A
(MSB)
X
(MSB)
Y
B
C
Z
a.
b.
c.
d.
e.
2.
Convert from 3-bit sign-magnitude code to 3-bit excess-4 code
Convert from 3-bit excess-4 code to 3-bit
CS2100 Computer
Organisation
http:/www.comp.nus.edu.sg/~cs210
0/
Number Systems and Codes
(AY2015/6 Semester 1)
NUMBER SYSTEMS & CODES
Information Representations
Number Systems
Read up DLD for
Base Conversion
Negative Numbers
Excess Representation
Floati
CS2100 Computer
Organisation
http:/www.comp.nus.edu.sg/~cs210
0/
Sequential Logic
(AY2015/6 Semester 1)
WHERE ARE WE NOW?
Number systems and codes Preparation: 2 weeks
Boolean algebra
Logic gates and circuits
Simplification
Logic Design: 3 weeks
Combinati
NUMBER SYSTEMS
SUPPLEMENTARY NOTES
Complements
Floating-point Numbers
CS2100
Number Systems Supplementary
Notes
1
COMPLEMENTS (1/3)
Find the complement of a number or complement a
number is the short way of saying find the negated
value in that complem
CS2100 Computer
Organisation
http:/www.comp.nus.edu.sg/~cs210
0/
Boolean Algebra
(AY2015/6 Semester 1)
WHERE ARE WE NOW?
Number systems and codes Preparation: 2 weeks
Boolean algebra
Logic gates and circuits
Simplification
Logic Design: 3 weeks
Combinatio
CS2100 Computer
Organisation
http:/www.comp.nus.edu.sg/~cs210
0/
Karnaugh Maps
(AY2015/6 Semester 1)
WHERE ARE WE NOW?
Number systems and codes Preparation: 2 weeks
Boolean algebra
Logic gates and circuits
Simplification
Logic Design: 3 weeks
Combinationa
CS2100 Computer
Organisation
http:/www.comp.nus.edu.sg/~cs210
0/
Logic Gates and Circuits
(AY2015/6) Semester 1
WHERE ARE WE NOW?
Number systems and codes Preparation: 2 weeks
Boolean algebra
Logic gates and circuits
Simplification
Logic Design: 3 weeks
C
CS2100 Computer
Organisation
http:/www.comp.nus.edu.sg/~cs210
0/
Combinational Circuits
(AY2015/6 Semester 1)
WHERE ARE WE NOW?
Number systems and codes Preparation: 2 weeks
Boolean algebra
Logic gates and circuits
Simplification
Logic Design: 3 weeks
Com
CS2100 Computer
Organisation
http:/www.comp.nus.edu.sg/~cs210
0/
Quine-McCluskey
(AY2015/6 Semester 1)
Quine-McCluskey
A tabulation method similar in concept to K-map
Applicable for functions with any number of
variables
K-map is useful for functions with
CS2100 Computer
Organisation
http:/www.comp.nus.edu.sg/~cs210
0/
Introduction to Computer Organisation
(AY2015/6) Semester 1
Overview
The Big Picture
Brief History of Computer
Current Trend
The Course (2nd Part)
CS2100
Von Neumann Architecture
Instruction