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

Consider the following statements:

S1: LRU page replacement algorithm suffers from the Belady's anomaly

S2: Shortest remaining time first scheduling may cause starvations

S3: Stack is shared by all threads in a process

Solution

S1 is false because LRU does not suffer from Belady’s anomaly.


S2 is true because shortest remaining time first may cause starvation for long processes.


S3 is false because each thread has its own stack.


Final Answer: (b) S1, S3 false and S2 is true

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

Nearest first
1
Which is not a basic approach to the problem of conflict resolution in a production system?
Topic: UGC NET Computer Science June 2023 (Paper II)
2
Consider the following statements:A. A database design is in BCNF if each member of the set of relation schemas that co…
Topic: UGC NET Computer Science June 2023 (Paper II)
3
Consider a popular sports news site. At a given moment, 20,000 concurrent users submit a request, a transaction T, once…
Topic: UGC NET Computer Science June 2023 (Paper II)
4
A TCP server application is programmed to listen on port P on host S. A TCP client is connected to the TCP server over …
Topic: UGC NET Computer Science June 2023 (Paper II)
5
Which of the following is used to determine the cost performance index?
Topic: UGC NET Computer Science June 2023 (Paper II)
6
A three dimensional array in C++ is declared as int A [a] [b] [c]. Consider that array elements are stored in row major…
Topic: UGC NET Computer Science June 2023 (Paper II)
7
Which of the following transforms in 2 dimension is used to resize a 2-dimensional object?
Topic: UGC NET Computer Science June 2023 (Paper II)
8
A processor chip is used for application in which 30% of execution time is spent on floating point addition. For the ne…
Topic: UGC NET Computer Science June 2023 (Paper II)
9
At a particular time of computation, the value of a counting semaphore is 7. Then 20 P operations and x V operations we…
Topic: UGC NET Computer Science June 2023 (Paper II)
10
Given below are two statements: one is labelled as Assertion A and the other is labelled as Reason R.A virtual memory s…
Topic: UGC NET Computer Science June 2023 (Paper II)

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

Ascending by ID
1
Let $R(A, B, C, D, E)$ be a relational schema with following functional dependencies:$C \to F,\ E \to A,\ EC \to D,\ A …
Topic: UGC NET Computer Science June 2023 (Paper II)
2
Match List I with List II LIST ILIST II   A. Physical layer I. Transforming the raw bits in the for…
Topic: UGC NET Computer Science June 2023 (Paper II)
3
A B-tree used as an index for a large database table has four levels including the root node. If a new key is inserted …
Topic: UGC NET Computer Science June 2023 (Paper II)
4
Suppose a circular queue of capacity $(n - 1)$ elements is implemented with an array of $n$ elements. Assume that the i…
Topic: UGC NET Computer Science June 2023 (Paper II)
5
Match List I with List II LIST ILIST II  A. Scenario testing I. To verify the I/O behavior of text …
Topic: UGC NET Computer Science June 2023 (Paper II)
6
Given below are two statements:Let $f(n)$ and $g(n)$ be asymptotically positive functions. The following conjectures ar…
Topic: UGC NET Computer Science June 2023 (Paper II)
7
Consider the rectangle with vertices $(0,0)$, $(0,2)$, $(3,0)$, $(3,2)$. There is scaling of 2 towards x-axis and 3 tow…
Topic: UGC NET Computer Science June 2023 (Paper II)
8
What is the $(4+4)$ bit binary fixed point equivalent of $-(3.72)_{10}$?
Topic: UGC NET Computer Science June 2023 (Paper II)
9
Consider following statements:A. A context free language is generated by LR(0) grammar if and only if it is accepted by…
Topic: UGC NET Computer Science June 2023 (Paper II)
10
Match List I with List II LIST ILIST II  A. PERT I. Used for non repetitive jobs B. Optimistic…
Topic: UGC NET Computer Science June 2023 (Paper II)
Ask Your Question or Put Your Review.

loading...