Aspire Faculty ID #18565 · Topic: UGC NET Computer Science Dec 2022 Shift I (Paper II) · Just now
UGC NET Computer Science Dec 2022 Shift I (Paper II)

Match List I with List II
 List I

 List II

A. DAA
I. Program Control Instruction
B. LXI
II. Interrupt instruction 
 C. RST
 III. Data Movement Instruction
 D. JMP

IV. Arithmetic Instruction

Solution

DAA means Decimal Adjust Accumulator, so it is an Arithmetic Instruction.

LXI means Load register pair immediate, so it is a Data Movement Instruction.

RST is a Restart instruction, so it is an Interrupt instruction.

JMP is a Jump instruction, so it is a Program Control Instruction.

So,

A → IV
B → III
C → II
D → I

Correct option is:

$\boxed{(b)\ A-IV,\ B-III,\ C-II,\ D-I}$

Previous 10 Questions — UGC NET Computer Science Dec 2022 Shift I (Paper II)

Nearest first
1
Match List I with List II List I List II A. Linear Program I. Prim's Algorithm B. Predicate Lo…
Topic: UGC NET Computer Science Dec 2022 Shift I (Paper II)
2
Consider the following draw backs is/are of Rule based approach is/are:A. The learning is static.B. Any changes made to…
Topic: UGC NET Computer Science Dec 2022 Shift I (Paper II)
3
Consider the following features of Neural networks. A. It is essentially a machine learning algorithm. B. It is useful …
Topic: UGC NET Computer Science Dec 2022 Shift I (Paper II)
4
Consider two hosts P and Q are connected through a router R. The maximum transfer unit $(MTU)$ value of the link betwee…
Topic: UGC NET Computer Science Dec 2022 Shift I (Paper II)
5
Consider the routing table of an organization'srouter as shown in the table given below Subnet NumberSubnet Mask&n…
Topic: UGC NET Computer Science Dec 2022 Shift I (Paper II)
6
Which of the following statement(s) are correct?A. Syntax Directed Translation can be applied in Type Checking.B. Synta…
Topic: UGC NET Computer Science Dec 2022 Shift I (Paper II)
7
Which of the following statement(s) are correct?A. Syntax Directed Translation can be applied in Type Checking.B. Synta…
Topic: UGC NET Computer Science Dec 2022 Shift I (Paper II)
8
Which of the following Finite Automata,recognizes the language L = {a , b}* ?A. $M=({q_0},{a,b},\delta,q_0,{q_0})$&nbsp…
Topic: UGC NET Computer Science Dec 2022 Shift I (Paper II)
9
For matrix multiplication, if we use divide and conquer algorithm, then ______A. the running time is $T(n)=\Theta(n^3)$…
Topic: UGC NET Computer Science Dec 2022 Shift I (Paper II)
10
In the context of a Hamiltonian problem, which of the following are correct?A. Hamiltonian cycle problem is NP-Complete…
Topic: UGC NET Computer Science Dec 2022 Shift I (Paper II)

Next 10 Questions — UGC NET Computer Science Dec 2022 Shift I (Paper II)

Ascending by ID
1
Match List I with List II List I List IIA. 2-D Array InputI. Liquid Crystal DisplayB. Transmissive deviceII. …
Topic: UGC NET Computer Science Dec 2022 Shift I (Paper II)
2
Match List I with List II List I List IIA. Timestamp protocolI. As long as the transaction is already running…
Topic: UGC NET Computer Science Dec 2022 Shift I (Paper II)
3
Match List I with List II List I List IIA. reference bit = $0$, modify bit = $0$ I. Must write out before rep…
Topic: UGC NET Computer Science Dec 2022 Shift I (Paper II)
4
Match List I with List II List I List IIA. Condition coverage I. Black box testing B. Equivalence class Parti…
Topic: UGC NET Computer Science Dec 2022 Shift I (Paper II)
5
Match List I with List II List I List IIA. 8-Queens problems I. Divide and conquer B. Closest Pair of points …
Topic: UGC NET Computer Science Dec 2022 Shift I (Paper II)
6
Match List I with List II List I List IIA. Initial Configuration of stack and input in the LL Parsing process…
Topic: UGC NET Computer Science Dec 2022 Shift I (Paper II)
7
Match List I with List II List I List IIA. Physical Layer I. Transforming the raw bits in the form of a frame…
Topic: UGC NET Computer Science Dec 2022 Shift I (Paper II)
8
Match List I with List II List I List IIA. Regression I. Unsupervised Learning B. KNN II. Supervised Learnin…
Topic: UGC NET Computer Science Dec 2022 Shift I (Paper II)
9
Let $G$ be a simple, undirected graph with $n$ vertices and $k$ connected components. What is the minimum possible numb…
Topic: UGC NET Computer Science Dec 2022 Shift I (Paper II)
10
Arrange the following search and sort algorithms in ascending order of their worst-case complexities.A. Merge sortB. Li…
Topic: UGC NET Computer Science Dec 2022 Shift I (Paper II)
Ask Your Question or Put Your Review.

loading...