Scribd
Upload
62 views2 pages

Coa Solution

The document discusses locality of reference in computer science which refers to situations where the same or related storage locations are frequently accessed. It lists three types of locality: temporal, spatial, and sequential.

Uploaded by

nandini sharma
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
62 views2 pages

Coa Solution

The document discusses locality of reference in computer science which refers to situations where the same or related storage locations are frequently accessed. It lists three types of locality: temporal, spatial, and sequential.

Uploaded by

nandini sharma
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 2

a. What do you understand by locality of reference?

In computer science, locality of reference, also called the principle of locality, is the term


applied to situations where the same value or related storage locations are frequently accessed.
There are three basic types of locality of reference: temporal, spatial and sequential:
Temporal locality :- resource that is referenced at one point in time is referenced again soon
afterwards.
Spatial locality: - likelihood of referencing a storage location is greater if a storage location near it
has been recently referenced.
Sequential locality: - storage is accessed sequentially, in descending or ascending order. 

b. List three types of control signals?

Section B

a. Evaluate the arithmetic statement X= (A+B) * (C+D) using a general register computer with
three address, two address and one address instruction format a program to evaluate the
expression?
b. Perform the division process of 00001111 by 0011 (use a dividend of 8 bits )
c. A two way set associative cache memory uses blocks of 4 words. The cache can accommodate
a total of 2048 words from memory. The main memory size is 128K x 32.
I) Formulate all pertinent information required to construct the cache memory?
II) What is the size of Cache Memory?
d. What is associative memory? Explain with the help of a block diagram. Also mention the
situation in which associative memory can be effective utilized?
Answer: - Associative Memory: - A memory unit accessed by content is called is called an
associative memory or content addressable memory (CAM)
The block diagram of an associative memory is displayed in Figure below.

Figure: Associative Memory - Block Diagram


It comprises of a memory array and logic for m words with n bits per word. Argument register A and
key register K both have n bits, one for every bit of a word. Match register M has m bits, one for each
memory word. Every word in memory is compared in parallel with content of argument register then
the words which match the bits of argument register set a corresponding bit in match register. After
matching process those bits in match register which have been set denote the fact that their
corresponding words have been matched. Reading is achieved by a sequential access to memory for
those words whose corresponding bits in match register have been set.

Key register offers a mask for choosing a specific key or field in argument word. The complete
argument is compared with every memory word if key register contains all 1s. Or else only those bits in
argument which have 1s in their corresponding positions of key register are compared. So the key
offers a mask or identifying information that specifies how reference to memory is made.

To explain with a numerical illustration assume that argument register A and key register K have the bit
configuration displayed below. Only three leftmost bits of a compared with memory words since K has
1's on these positions.

A                101 111100


K                111 000000
Word 1       100 111100      no match
Word 2       101 000001      match      
Word 2 matches unmasked argument field since the three leftmost bits of argument and word
are equal.

e. A Computer uses a memory unit with 256K words of 32bits each. A binary instruction code is
stored in one word of memory. The instruction has four parts:
An indirect bit, an operation code, a register code part to specify one of 64 registers and an
address part
(i) How many bits are there in the operation code, the register code part and the address
part?
(ii) Draw the instruction word format and indicate the number of bits in each part?
(iii) How many bits are there in the data and address inputs of the memory?

You might also like