Simplify the following Boolean function in POS form using K-maps, also draw a logic diagram using only NAND gates 5m Dec2005

By | January 21, 2015

 Simplify the following boolean function in POS form using K-maps :

F (A, B, C, D) = Σ (0, 2, 4, 5, 6, 8, 10, 13, 15)

Also draw a logic diagram using only NAND gates.         5m Dec2005

  

K-Map for F is:

Kmap002

Thus, the simplified equations for F (A, B, C, D) = Σ (0, 2, 4, 5, 6, 8, 10, 13, 15)

are:

F = (|A+|B+D) (B+|D) (|C+|D)

Logic diagram:-

Logic_Diag01

 

Logic diagram using only NAND gates:-

Logic_Diag02

 Assume a compuier having 64 word RAM and cache memory of 8 blocks. Where can we find the main memory location 26 in cache jf

(i) Associative mapping is used;

(ii) Direct rnapping is used;

(iii) 2-way set associative (2 blocks per set) mapping is used.

Assume 1 word = 16 bits and block size = 32 bits   Make suitable assumptions if any 5m Dec2005

 

Solved answer can be found on this link http://cssimplified.com/assignments/a-computer-has-512-words-ram-with-a-word-size-of-32-bits-and-a-cache-memory-of-8-blocks-with-block-size-of-64-bits-ignou-mca-assignment-2014-15