UNIVERSAL LAWS FOR BOOLEAN ALGEBRA
1. Commutative Laws: For any two finite sets A and B; (i) A U B = B U A (ii) A ∩ B = B ∩ A 2. Associative Laws: For any three finite sets A, B and C; (i) (A U B) U C = A U (B U […]
1. Commutative Laws: For any two finite sets A and B; (i) A U B = B U A (ii) A ∩ B = B ∩ A 2. Associative Laws: For any three finite sets A, B and C; (i) (A U B) U C = A U (B U […]
QUESTION: A CPU generates 32-bit addresses. The block size is 4 K Bytes. The processor has a Cache which can hold a total of 128 blocks and is 4-way set associative. The minimum size of the cache tag is: ANSWER: Firstly, write given information in the question. CPU generates 32-bit […]
Note: Compliments can be evaluated only for negative number. If number is positive we can not find compliment. There are three methods to store negative number: Sign magnitude One’s compliment Two’s compliment Sign magnitude: In this method , 1 is used for negative number(Leftmost bit) and 0 is used for […]
Effective Access Time(EAT) is very foremost topic in computer architecture. The formula is very simple; Effective Memory Access Time = Cache access time * hit rate + miss rate * Miss penalty But following formula is the easiest formula to find EAT. we will take an example for more clear […]
INTERRUPT An interrupt is a control signal sent to the microprocessor to draw its attention. It is a type of signal to processor in which processor,on receiving the interrupt request,stops its current operation and starts executing the subroutine associated with the interrupt signal. Interrupt signal is – active low (0) […]
What is binary numbers? Binary means two numbers i.e 0 or 1. What is binary addition and subtraction? Addition and subtraction are arithmetic operators. Binary addition means adding between two binary numbers. Binary subtraction means subtracting between two binary numbers. Overflow rule: In general term, overflow means , a thing […]