Download as pdf or txt
Download as pdf or txt
You are on page 1of 1

Foundations of Computer Science-CS201

Madjid Allili ∼ J125 ∼ ext. 2740 ∼ mallili@ubishops.ca

Assignment 4: Due November 22nd , 2018

1. (a) Draw the circuit corresponding to the following boolean expression:


z = ((a.b) + c) + a.c)

(b) For the circuit above, draw the truth table for the output of each gate.

2. A prime number is an integer p > 1, that cannot be divided by any other integer
except 1 and itself. A logic circuit takes 4 inputs a, b, c, d that form a binary
number as input. The output z is equal to “1” if the number formed by the input is
a prime number.

(a) Draw the Truth Table for the circuit.


(b) Write the boolean expression for the circuit.
(c) Design the circuit with AND, OR and NOT gates (you may use 2, 3, and 4
input AND and OR gates.)

3. A memory has 8 megabytes of cells

(a) What is the size of its MAR?


(b) If 2-dimensional addressing is used, what is the size of each of the horizontal
and vertical decoders?

4. Assume that a hard disk has the following characteristics:

Rotation speed = 7,200 rev/min


Arm movement time = 0.5msec fixed start-up time + 0.05 msec for each track
crossed
Number of surfaces = 2 (double-sided disk)
Number of tracks per surface = 500
Number of sectors per track = 20
Number of characters per sector = 1,024

(a) How many characters can be stored on the disk?


(b) What are the best case and worst case access time for the data (in a sector)?

You might also like