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

Which type of addressing mode requires the least number of memory references?

Solution

In implied addressing mode, the operand is already implied in the instruction.

So, there is no need to specify any operand address separately.

Therefore, implied addressing mode requires the least number of memory references.

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

Nearest first
1
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)
2
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)
3
List-I List-II (a) $p \to q$ (i) $\neg(q \to \neg p)$ …
Topic: UGC NET Computer Science June 2019 (Paper II)
4
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)
5
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)
6
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)
7
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)
8
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)
9
How many ways are there to place $8$ indistinguishable balls into four distinguishable bins?
Topic: UGC NET Computer Science June 2019 (Paper II)
10
Consider the poset $\left({3,5,9,15,24,45}, \mid\right)$. Which of the following is correct for the given poset?
Topic: UGC NET Computer Science June 2019 (Paper II)

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

Ascending by ID
1
Suppose that the register $A$ and the register $K$ have the bit configuration. Only the three leftmost bits of $A$ are …
Topic: UGC NET Computer Science June 2019 (Paper II)
2
How many different Boolean functions of degree $n$ are there?
Topic: UGC NET Computer Science June 2019 (Paper II)
3
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)
4
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)
5
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)
6
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)
7
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)
8
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)
9
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)
10
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)
Ask Your Question or Put Your Review.

loading...