Aspire Faculty ID #18770 · Topic: UGC NET Computer Science Sep 2022 (Paper II) · Just now
UGC NET Computer Science Sep 2022 (Paper II)

Consider the following two lists:
List IList II
(A) Stack overflow(I) Software Interrupt
(B) Timer(II) Internal interrupt
(C) Invalid opcode(III) External interrupt
(D) Superior call(IV) Machine check interrupt

Solution

We need to match each interrupt source with its correct interrupt type.

Stack overflow occurs due to an error inside the currently executing program.

So, it is an internal interrupt.

Therefore:

$(A)-(II)$

Timer interrupt is generated by hardware timer from outside the running program.

So, it is an external interrupt.

Therefore:

$(B)-(III)$

Invalid opcode occurs when the processor finds an invalid machine instruction.

In the given matching list, it is matched with machine check interrupt.

Therefore:

$(C)-(IV)$

Superior call means supervisor call.

A supervisor call is generated by software to request operating system service.

So, it is a software interrupt.

Therefore:

$(D)-(I)$

Final matching is:

$(A)-(II), (B)-(III), (C)-(IV), (D)-(I)$

Previous 10 Questions — UGC NET Computer Science Sep 2022 (Paper II)

Nearest first
1
How many rotations are required during the construction of an AVL tree if the following elements are to be added in the…
Topic: UGC NET Computer Science Sep 2022 (Paper II)
2
Consider the traversal of a treePreorder $\to ABCEIFJDGHKL$Inorder $\to EICFJBGDKHLA$Which of the following is correct …
Topic: UGC NET Computer Science Sep 2022 (Paper II)
3
Consider the hash table of size $11$ that uses open addressing with linear probing. Let $h(k)=k\mod 11$ be the hash fun…
Topic: UGC NET Computer Science Sep 2022 (Paper II)
4
Which of the following algorithm design approach is used in Quick sort algorithm?
Topic: UGC NET Computer Science Sep 2022 (Paper II)
5
Consider a B-tree of height $h$ minimum degree $t\ge 2$ that contains any $n$-key, where $n\ge 1$. Which of the followi…
Topic: UGC NET Computer Science Sep 2022 (Paper II)
6
The number of nodes of height $h$ in any $n$-element heap is atmost:
Topic: UGC NET Computer Science Sep 2022 (Paper II)
7
The solution of the recurrence relation $T(n)=3T\left(\frac{n}{4}\right)+n\log n$ is
Topic: UGC NET Computer Science Sep 2022 (Paper II)
8
Assume that $f(n)$ and $g(n)$ are asymptotically positive. Which of the following is correct?
Topic: UGC NET Computer Science Sep 2022 (Paper II)
9
Which of the following is correct for the destination address $4A:30:10:21:10:1A$?
Topic: UGC NET Computer Science Sep 2022 (Paper II)
10
A $4$-stage pipeline has a stage delay of $150,120,160$ and $140$ ns respectively. Registers that are used between the …
Topic: UGC NET Computer Science Sep 2022 (Paper II)

Next 10 Questions — UGC NET Computer Science Sep 2022 (Paper II)

Ascending by ID
1
Let $R(ABCDEFGH)$ be a relation schema and $F$ be the set of dependencies$F=\{A\to B,\ ABCD\to E,\ EF\to G,\ EF\to H,\ …
Topic: UGC NET Computer Science Sep 2022 (Paper II)
2
A trigger is
Topic: UGC NET Computer Science Sep 2022 (Paper II)
3
For the following page reference string $4,3,2,1,4,3,5,4,3,2,1,5$, the number of page faults that occur in the least Re…
Topic: UGC NET Computer Science Sep 2022 (Paper II)
4
A magnetic tape drive has a transport speed of $200$ inches per second and a recording density of $1600$ bytes per inch…
Topic: UGC NET Computer Science Sep 2022 (Paper II)
5
Consider two lists A and B of three strings on $\{0,1\}$X:List AList B11111011110100Y:List AList B1010101111101011Which…
Topic: UGC NET Computer Science Sep 2022 (Paper II)
6
Consider the properties of recursively enumerable sets:(A) Finiteness(B) Context Freedom(C) EmptinessWhich of the follo…
Topic: UGC NET Computer Science Sep 2022 (Paper II)
7
Consider the following : List IList II(A) Activation record(I) Linker Loader(B) Location counter(II) Garbage Collection…
Topic: UGC NET Computer Science Sep 2022 (Paper II)
8
 Consider the following related to Fourth Generation Technique $(4GT)$:(A) It controls efforts.(B) It controls res…
Topic: UGC NET Computer Science Sep 2022 (Paper II)
9
Consider the grammar $S\to SbS\mid a$.Consider the following statements:The string $abababa$ has(A) two parse trees(B) …
Topic: UGC NET Computer Science Sep 2022 (Paper II)
10
In a game playing search tree, upto which depth $\alpha-\beta$ pruning can be applied?(A) Root $(0)$ level(B) $6$ level…
Topic: UGC NET Computer Science Sep 2022 (Paper II)
Ask Your Question or Put Your Review.

loading...