Cmpt 150
A Simple Computer
March, 2012
A Simple Computer
Its time to assemble some pieces and create a computer. Were not going to
cover this in depth many details will be swept under the rug but at the end
we should have a pretty good idea of how assembl

Lab 2 - Estimated Time: 40 minutes
-Bobby Chan - Last Modified: May 15th, 2008
This labs is designed to start building simple circuits in LogicWorks/DesignWorks. Please
complete the following instructions and show the results to the lab instructor at the

CMPT 150: Introduction to Computer Design
Instructor: Muntaseer Salahuddin
Fall 2011 SYLLABUS (tentative)
Overview
Computer design is about the construction of digital circuits to implement the instructions
that are expressed symbolically in assembly lang

c A.H.Dixon
CMPT 150 : Assignment 2 SOLUTION
Due 23:59 Wednesday, February 13, 2008
1
A
B
C
D
E
1
1
1 0
s4
1
A
1 0
s3
2
1 0
s2 2
1 0
s1
+5V
3
1 0
m
7
3
2
0
4
4
A
B
C
D
E
Figure 1: SOLUTION 1: Schematic
c A.H.Dixon
CMPT 150 : Assignment 2 SOLUTION
2
ns A m

c A.H.Dixon
CMPT 150 : ASSIGNMENT 1
Due 23:59 Monday, January 28, 2008 (2 pages)
1
NOTE: Before you prepare your nal submission, please access the course website and check the Submissions link of the course website for information on how to present your s

c A.H.Dixon
CMPT 150: Week 1 (Jan 7 - 11, 2008)
1
1
ALPHABETS AND ENCODINGS
An alphabet is a nite set of distinct symbols often called characters. Some, but not necessarily all, sequences of characters are meaningful. That is, they have been selected to r

c A.H.Dixon
CMPT 150: Week 8 (Feb 25 - 29, 2008)
64
22
COUNTERS
A mod-n counter is a register that generates the same sequence of n values repeatedly. The most common examples are incrementing mod-2n counters as these counters repeat the sequence: 0, 1, 2

c A.H.Dixon
CMPT 150 : Assignment 5 SOLUTION
Due 23:59 Monday, April 7, 2008
1
For the following programming exercises, you are to use only the instructions provided on the HC-12 ASSEMBLY LANGUAGE SUBSET for Assignment 5. This can be downloaded from the l

Name:_
Student Number:_
CMPT 150 04-1 : TEST #1
Time: 50 minutes 3 Questions 30 MARKS February 11, 2004 3 Pages A
INSTRUCTIONS 1. ALL questions to be answered on the test paper. The backs of pages can be used for rough work. 2. Place your name at the top

c A.H.Dixon
CMPT 150 : Assignment 5
Due 23:59 Monday, April 7, 2008 (1 page)
1
NOTE: Before you prepare your nal submission, please access the course website and check the Submissions link for information on how to present your solutions and what to submi

c A.H.Dixon
CMPT 150 : ASSIGNMENT 1
Due 23:59 Monday, January 28, 2008 (2 pages)
1
NOTE: Before you prepare your nal submission, please access the course website and check the Submissions link of the course website for information on how to present your s

c A.H.Dixon
CMPT 150 : Assignment 3 SOLUTION
Due 23:59 Wednesday, February 27, 2008
1
1. 2 1 MUX:
d0 d1 m
s
2. T-ip-op with synchronous clear (clr):
T
0 m 1s R TQ Q
clr
R
c A.H.Dixon
CMPT 150 : Assignment 3 SOLUTION
2
3. (a) A mod-2 counter using only a T

CMPT 150 SAMPLE FINAL EXAMINATION
Time: 3 Hours
5 Questions
SPRING
CLOSED BOOK
Name:_
1. A combinational circuit for a Boolean function
Karnaugh map:
f(a,b,c,d)
is
defined
by
the
following
c,d
f 00 01 11
1
0
1
00 X
a,b
0
1
11
01
0
X
00
X1
0
1
X
10
1
0
1
a

c A.H.Dixon
Laboratory Exercise 2 HEXADECIMAL ENCODING
1
This lab session is part of the Academic Enhancements Program (AEP) and is presented by the Student Learning Commons, Diana Cukierman and Donna McGee Thomposn, coordinators. NOTE: Change of venue: R

Assignment 4 (due: Aug 4th, 2008 - 3:30pm)
-Bobby Chan - Last Modified: July 20th, 2008
Instructions: For this assignment, you will only be required to submit a soft copy onto the
submission server. Please make sure you follow the instructions for submiss

Name:_
Student Number:_
CMPT 150 : TEST #2 SOLUTION
Time: 50 minutes 3 Questions 30 MARKS 2 Pages (both sides) A INSTRUCTIONS 1. ALL questions to be answered on the test paper. The backs of pages can be used for rough work. 2. Place your name at the top o

More practice questions
In terms of difficulty, type of questions, and length of exam, there is no correlation between
these questions and the actual exam :P
1.
Use a 4-bit adder/subtractor and another gate o

A
B
C
D
E
1
1
2
2
EN
Part A of Assignment 2 for question 3
Basic logic is as follows: We take the min-terms of the root decoder in the decoder tree
and hook them to the ENs of the children decoders then on those children decoders
hook the selection lines

Program
CE
Memory
address
$0800
00
$0801
31
$0802
9E
$0803
00
$0804
2D
$0805
01
$0806
08
$0807
18
$0808
06
$0809
3F
$0810
A7
$0811
Assign
ment 5
1. As a refresher here is the portion of the assembly
language program
CE 00 31 9E 00 2D 01 08 18 06 3F A7
The

Echo Liu
CMPT 150
TA: Xi Ao, Lab: D106 Student Number: 301223101 echol@sfu.ca
Echo
CMPT 150 Assignment Four
1. See sheet attached
2. See sheet attached
3. See sheet attached for circuit, but underlying logic to the solution will be
illustrated here
Finite

Cmpt 150-D1 Assignment 3 (Due: Mar 6 10:20am in CSIL dropbox and submitted online)
1. Complete the following mathematical operations in twos complement arithmetic (be sure to indicate
whether there is an overflow):
(a

Cmpt 150 Assignment 1 (due Friday Jan 30 10:20am in the CSIL dropbox and online submission)
1.
Perform the following conversions and mathematical operations (show your work):
(a) 100001100111BCD + 1001010001012 =?10
(b) 496.310 =?2 =?8 =?16
(c) 3E8F16 + A

CMPT 150
Introduction to Computer Design
Page 1
CMPT 150
Logic Gates
Introduction to Computer Design
Page 2
Logic Gates
For example, the AND gate:
Logic gates take electrical signals as input and
produce electrical signals as output
We assume the signals

CMPT 150
Introduction to Computer Design
Page 1
CMPT 150
Introduction to Computer Design
Page 2
What is a Computer?
CMPT 150: Introduction to
Computer Design
!Simplest definition:
Harinder Singh Khangura
School of Computing Science
input
Computer
output
S

CMPT 150
Tri-state Gates
Page 1
CMPT 150
Tri-state Gates
Larger k-maps
The dont care Condition
!How can we have 5 variable k-maps?
!Some truth tables are incompletely specified
! Each minterm has _ neighbours
! We have to start stacking the 4-variable map

CMPT 150 2013-1, Midterm #2
Instructor: Diana Cukierman
Page 1 of 2
Simon Fraser University
CMPT-150, Introduction to Computer Design
MIDTERM EXAM #2
Instructor: Diana Cukierman
March 26, 2013
Last Name: _
First Name: _
English name: _
(if different from

Fall 2005
PHYS 355 Optics
FINAL EXAMINATION
12:0015:00 Wednesday, 14 December, 2005
You will have three hours to complete the exam. Answer all problems. All problems have equal weight,
as does each part of multi-part problems.
1. Maxwells equations and li

c
A.H.Dixon
5.4
CMPT 150: Week 3 (Jan 21 - 25)
14
The Duality Principle
Boolean algebras possess a very important property that expands the ways in which
expressions can be manipulated while still preserving equivalence. That property is the
Principle of