Aspire Faculty ID #19230 · Topic: UGC NET Computer Science June 2019 (Paper II) · Just now
UGC NET Computer Science June 2019 (Paper II)

Suppose that the register $A$ and the register $K$ have the bit configuration. Only the three leftmost bits of $A$ are compared with memory words because $K$ has $1$'s in these positions. Because of its organization, this type of memory is uniquely suited to parallel searches by data association. This type of memory is known as:

Solution

Content addressable memory is also called associative memory.

In this memory, data is searched by content instead of address.

Register $A$ contains the bit pattern and register $K$ decides which bits are to be compared.

Since this memory supports parallel searching by data association, it is called content addressable memory.

Previous 10 Questions — UGC NET Computer Science June 2019 (Paper II)

Nearest first
1
Which type of addressing mode requires the least number of memory references?
Topic: UGC NET Computer Science June 2019 (Paper II)
2
Consider an LPP given as: $\text{Max } Z=2x_1-x_2+2x_3$ subject to the constraints: $2x_1+x_2\le 10$ $x_1+2x_2-2x_3\le …
Topic: UGC NET Computer Science June 2019 (Paper II)
3
Find the zero-one matrix of the transitive closure of the relation given by the matrix $A$:
Topic: UGC NET Computer Science June 2019 (Paper II)
4
List-I List-II (a) $p \to q$ (i) $\neg(q \to \neg p)$ …
Topic: UGC NET Computer Science June 2019 (Paper II)
5
How many cards must be selected from a standard deck of $52$ cards to guarantee that at least three hearts are present …
Topic: UGC NET Computer Science June 2019 (Paper II)
6
Which of the following is principal conjunctive normal form for $[(p \vee q)\wedge[p \to q]]$?
Topic: UGC NET Computer Science June 2019 (Paper II)
7
For which values of $m$ and $n$ does the complete bipartite graph $K_{m,n}$ have a Hamilton circuit?
Topic: UGC NET Computer Science June 2019 (Paper II)
8
Suppose that a connected planar graph has six vertices, each of degree four. Into how many regions is the plane divided…
Topic: UGC NET Computer Science June 2019 (Paper II)
9
How many bit strings of length ten either start with a $1$ bit or end with two bits $00$?
Topic: UGC NET Computer Science June 2019 (Paper II)
10
How many ways are there to place $8$ indistinguishable balls into four distinguishable bins?
Topic: UGC NET Computer Science June 2019 (Paper II)

Next 10 Questions — UGC NET Computer Science June 2019 (Paper II)

Ascending by ID
1
How many different Boolean functions of degree $n$ are there?
Topic: UGC NET Computer Science June 2019 (Paper II)
2
The fault can be easily diagnosed in the micro-program control unit using diagnostic tools by maintaining the contents …
Topic: UGC NET Computer Science June 2019 (Paper II)
3
What will be the number of states when a $MOD-2$ counter is followed by a $MOD-5$ counter?
Topic: UGC NET Computer Science June 2019 (Paper II)
4
For a magnetic disk with concentric circular tracks, the seek latency is not linearly proportional to the seek distance…
Topic: UGC NET Computer Science June 2019 (Paper II)
5
The parallel bus arbitration technique uses an external priority encoder and a decoder. Suppose, a parallel arbiter has…
Topic: UGC NET Computer Science June 2019 (Paper II)
6
Consider the equation $(146)b+(313){b-2}=(246)_8$ Which of the following is the value of $b$?
Topic: UGC NET Computer Science June 2019 (Paper II)
7
How many address lines and data lines are required to provide a memory capacity of $16K \times 16$?
Topic: UGC NET Computer Science June 2019 (Paper II)
8
Suppose that a computer program takes $100$ seconds of execution time on a computer with multiplication operation respo…
Topic: UGC NET Computer Science June 2019 (Paper II)
9
Consider the following pseudo-code fragment in which an invariant for the loop is $m \times x^k=p^n$ and $k\ge 0$. Pre-…
Topic: UGC NET Computer Science June 2019 (Paper II)
10
Consider the following C-code fragment running on a $32$-bit x86 machine:typedef struct { union { unsigned char a; unsi…
Topic: UGC NET Computer Science June 2019 (Paper II)
Ask Your Question or Put Your Review.

loading...