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 […]
Graph- Introduction A Graph is a data structure consisting of vertices and edges. the theory associated with graph is called graph theory. It can be used to solve many problems such as Planning routes for goods or services delivery, finding the shortest path, finding number of colours needed to colour […]
Regular Expression in theory of computation means by finite number of strings to be matched. In this expression, we know the limit of expression. For example, if we will talk about 10^10 , (0 + 10*) , (11)* and so on. Now I will tell you simple trick to match string in […]
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) […]
Concept of Data Structure A data type can be defined as set of values and set of operations which are permissible on those values. For example, an integer data type in C language can have range ( -32768 to 32767) and set of operations +, – , * , […]
BINARY TREE An important category of general tree is Binary Tree. A binary tree can be defined as a finite collection of nodes where each node is having the property that it can have 0,1 or 2 children. A binary tree may be empty known as Null tree or […]
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 […]
TREE A tree t can be a defined as finite(means limit or not infinite) set of nodes in which there is one specially designated node known as root of the tree. and the remaining nodes are partitioned into disjoint sets t1, t2….tn such that each t1 is itself a tree […]
