to 3a) Truth table
3b) equation d =
[CMSC 313 Home] | [Syllabus] | [Homework] | [Project] | [Lecture Notes] | [Printable all notes] | [Files] | [NASM resource] |
The most important item on all homework is YOUR NAME!
Print. No readable name, no credit.
Staple or clip pages together.
Homework must be submitted when due. You loose 10%, one grade,
the first day homework is late. Then 10% each week thereafter.
Max 50% off. A zero really hurts your average!
Paper or EMail to squire@umbc.edu ONLY PLAIN TEXT.
I can NOT accept OCTET/STREAM. .doc .gif .jpg .rtf ...
If I can not read or understand your homework, you do
not get credit. Type or print if your handwriting is bad.
Homework is always due on a scheduled class day within 15 minutes
after the start of the class. If class is canceled then homework
is due the next time the class meets. EMailed homework has until
midnight the day it is due.
EMail only plain text! No word processor formats.
You may use a word processor or other software tools and
print the results and turn in paper.
Put CS313 and HW number in subject line.
Do the following manually. Show all work similar to the method shown in Lecture 1. It is OK to check your own work on a computer or calculator. It is not OK to compare to other students answers. No "matching". Yes, those are decimal points, hexadecimal points and binary points in the numbers, integer-part.fractional-part 1. Convert hexadecimal number 1357AC.EF to binary 2. Convert binary number 110101100.001101 to hexadecimal 3. Convert decimal number 123.375 to binary 4. Convert binary number 10101101.11101 to decimal
Draw a reasonably neat picture of the Intel 386 registers. Label, as usable, AL, AH, AX, EAX etc. No 8-bit names for parts of SI, DI, etc. Label the lengths, 8, 16, 32 e.g. AL-8 AX-16 EAX-32 Yes, this seems to be a dumb assignment, but it has been found to actually help because you have to write all the forms of register names. Yes, you can use the picture from the book or WEB, but you have to draw it, not photocopy it. Do not include segment, floating point, MMX, control, debug, or test registers.
Write one line of legal NASM assembly language for each answer.
Assume reasonable declarations per previous class examples.
e.g. intarith.asm
section .data
a: dd 3
b: dd 4
section .bss
c: resd 1
section .text
main:
(do not assume the values at a: and b: remain the same)
1) add the value at label b to ecx
2) subtract the constant 7 from edx
3) integer multiply by the value at label b
4) integer divide by the value at b
5) add the address of label b to eax
6) jump to the label main
7) correct the stack pointer after using three push dword to printf
8) compare register ebx to the constant 7
9) compare register ebx to the address of label b
10) compare register ebx to the value at label b
11) place the hexadecimal constant A9876543 into ecx
12) place the address of label c into ebx
It is OK to check your work by assembling a program with
your answers, and fixing as required.
It is not OK to compare or match you answers with other
students, T.A. or others.
(please do not perform any minimization, be neat)
_
1) Convert the equation d = ((a+b)*c)+b to
1a) a truth table
1b) a schematic diagram ("and" gates into one "or" gate)
2) Convert the truth table
a b c | d
------+--
0 0 0 | 1
0 0 1 | 1
0 1 0 | 0
0 1 1 | 0
1 0 0 | 0
1 0 1 | 0
1 1 0 | 0
1 1 1 | 1
to 2a) equation d =
2b) a schematic diagram ("and" gates into one "or" gate)
3) Convert the schematic diagram
to 3a) Truth table
3b) equation d =
Draw a detailed schematic of a 6-bit add and subtract circuit.
The basic schematic is shown in Lecture 19
(an inverter, a mux and an adder).
Your schematic expands the basic schematic using six full adders,
six inverters and six multiplexors. With inputs and outputs labeled
and all connecting wires (signals) drawn.
You do not have to put signal names on internal wires.
You may use the left to right or top to bottom flow from
the inputs a {a(5), a(4), a(3), a(2), a(1), a(0)},
b {b(5), b(4), b(3), b(2), b(1), b(0)}, and
subtract
to outputs s {s(5), s(4), s(3), s(2), s(1), s(0)} and
cout
Be neat and orderly.
Compare a Karnaugh Map minimization with a Quine McClusky minimization.
The minterms are:
0 0 0 0 0 0
0 0 0 1 0 0
0 1 0 0 1 0
0 1 0 0 1 1
0 1 0 1 1 0
0 1 0 1 1 1
0 1 1 0 1 0
0 1 1 0 1 1
0 1 1 1 1 0
0 1 1 1 1 1
1 0 0 0 0 0
1 0 0 1 0 0
1 1 0 1 1 0
1 1 0 1 1 1
1 1 1 1 1 0
1 1 1 1 1 1
1a) Draw the Karnaugh Map with some valid covering.
1b) Write the circuit equation based on the covering.
2a) Use the Quine McClusky method to get the prime implicants
either by hand or use the "qm" computer program.
2b) Write the circuit equation.
(probably this will be different from 1b)
See Quine McClusky lecture notes
More information on using Quine McClusky program
A sample exam will be provided as a study guide. No assembly language questions on the final exam. Read the referenced sections on digital logic in the textbook.
Last updated 4/10/04