CMSC 265
Spring 2014
Homework 13 (120 points available)
#133 #135 are due midnight, Friday April 18
131.Give a presentation of no longer than 5 minutes on a person from the history of
information technology. Your presentation should include the following:

CMSC 265
Spring 2014
Homework 4 (125 points available)
Due: Midnight Monday Feb 10
41. Write down the boolean expression computed by the following circuit.
(10 points)
~( ~x and y) or x) or ~ (~x and z)
42. Construct the truth-table for the boolean expres

CMSC 265
Spring 2014
Homework 5 (120 points available)
Due: Midnight Monday Feb 17
51. Implement the following chips as described in Chapter 1 of the Textbook (folder
projects/01).
Copy and paste the Parts part of your hdl file into your hand-in document.

CMSC 265
Spring 2014
Homework 6 (115 points available)
Due: Midnight Monday Feb 24
61. Implement the ALU as described on pg 36 of the Textbook (folder projects/02).
Copy and paste the Parts part of your hdl file into your hand-in document. Before
handing

CMSC 265
Spring 2014
Homework 3 (120 points available)
Due: Midnight Monday Feb 3
30. Decode 48 65 6C 6C 6F 21 into English, assuming it is a hexadecimal representation of 8-bit ASCII.
(10
points)
HELLO!
31. (a) Represent the decimal number 234 in 24 bits

CMSC 265
Spring 2014
Homework 2 (120 points available)
SHOW ALL WORK!
Due: Midnight Monday Jan 27
21. Compute each of the following using using 8-bit twos complement. Then
determine whether the result is correct; explain why or why not.
(a) 21 + 44 = 65
i

CMSC 265
Spring 2014
Homework 9 (110 points available)
Due midnight Mon Mar 25
91. Write a Hack machine language program that computes RAM[1] + RAM[2] + RAM[3] + . +
RAM[10], storing the result somewhere else in RAM. Use a loop to do the repeated addition

CMSC 265
Spring 2014
Homework 8 (130 points available)
Due midnight Mon Mar 17
81. Implement the Memory and CPU chips as described in Chapter 5 of the Textbook
(folder projects/05).
Copy and paste the Parts part of your hdl file into your hand-in document

CMSC 265
Spring 2014
Take Home Final (250 points available)
Hand-in by Final Exam Time (Thurs May 1, 5:15pm)
Youmayconsultanyreferences,butyoumayNOTworkwith
anyotherperson.
SHOWALLCALCULATIONS!
140. According to https:/nookkin.com/articles/computer-scienc

CMSC 265
Spring 2014
Homework 11 (125 points available)
Due midnight Mon Apr 7
For partial credit, SHOW ALL WORK!
106. The page table must be accessed on every program instruction, so it seems sensible to store
the page table in cache. Why is this not don

CMSC 265
Spring 2014
Homework 12 (125 points available)
Due midnight Mon Apr 14
120. Send me in email by midnight Saturday Apr 12 the name of someone from the history
of computing you would like to do a presentation about. Also let me know if you have a
p

CMSC 265
Spring 2014
Homework 10 (125 points available)
Due midnight Mon Mar 31
SHOW ALL CALCULATIONS!
100.
A program loops 3 times through the instructions in locations 0 to 6710 in
memory. Answer the following, assuming a direct-mapped cache with 8 bloc

CMSC 265
Spring 2014
Homework 7 (125 points available)
Due: Midnight Mon Mar 3
71. Implement the following chips as described in Chapter 3 of the Textbook (folder
projects/03 subfolder b).
Copy and paste the Parts part of your hdl file into your hand-in d