Register
Filter

Recent questions in Others

0 votes
0 answers
162
UGC NET CSE | June 2023 | Part 2: 41
How many integral solutions are there to $x+y+z+\mathrm{w}=29$, where $x \geq 1, y \geq 2, z \geq 3$ and $w \geq 0$ ? 2400 2600 2800 3000
How many integral solutions are there to $x+y+z+\mathrm{w}=29$, where $x \geq 1, y \geq 2, z \geq 3$ and $w \geq 0$ ?2400260028003000
User Avatar
1 votes
0 answers
165
UGC NET CSE | June 2023 | Part 2: 45
What is the $(4+4)$ fit binary fixed point equivalent of $-(3.72)_{10}$ ? $0011.1100$ $0011.1010$ $1100.0100$ $0011.1011$
What is the $(4+4)$ fit binary fixed point equivalent of $-(3.72)_{10}$ ?$0011.1100$$0011.1010$$1100.0100$$0011.1011$
User Avatar
0 votes
0 answers
166
UGC NET CSE | June 2023 | Part 2: 46
Consider a popular sports news site. At a given moment, $20,000$ concurrent users submit a request (a transaction, T) once every $2$ ... is the throughput? $8$ megabits per second $4$ megabits per second $6$ megabits per second $2$ megabits per second
Consider a popular sports news site. At a given moment, $20,000$ concurrent users submit a request (a transaction, T) once every $2$ minutes on average. Each transaction ...
User Avatar
0 votes
0 answers
169
UGC NET CSE | June 2023 | Part 2: 49
Consider the following language : \[ L=\left\{w \in\{a, b, c\} *: n_{a}(\omega)+n_{b}(\omega)=n_{c}(\omega)\right\} \] $\mathrm{L}$ is Context free but not linear Not context free Context free and linear Linear
Consider the following language :\[L=\left\{w \in\{a, b, c\} *: n_{a}(\omega)+n_{b}(\omega)=n_{c}(\omega)\right\}\]$\mathrm{L}$ isContext free but not linearNot context f...
User Avatar
0 votes
0 answers
170
UGC NET CSE | June 2023 | Part 2: 50
The clipping process in computer graphics is used for Adding graphics Copying Zooming Removing objects and lines
The clipping process in computer graphics is used forAdding graphicsCopyingZoomingRemoving objects and lines
User Avatar
0 votes
0 answers
173
UGC NET CSE | June 2023 | Part 2: 53
Match List I with List II List I List II A. Critical region I. Hoare's monitor B. Wait/signal II. Mutual exclusion C. Working set III. Principle of locality D. Deadlock IV. Circular wait ...
Match List I with List IIList IList IIA. Critical regionI. Hoare's monitorB. Wait/signalII. Mutual exclusionC. Working setIII. Principle of localityD. DeadlockIV. Circula...
User Avatar
0 votes
0 answers
177
UGC NET CSE | June 2023 | Part 2: 57
Match List I with List II List I List II A. The running time of straight forward recursive method to compute nth Fibonacci number $\text{Fn}$ I. $O (n \left.{ }^{2}\right)$ B. The running time to compute Fn using memoization II. $\text{O (lg n)}$ C. The running time ...
Match List I with List IIList IList IIA. The running time of straight forward recursive method to compute nth Fibonacci number $\text{Fn}$I. $O (n \left.{ }^{2}\right)$B....
User Avatar
0 votes
0 answers
178
UGC NET CSE | June 2023 | Part 2: 58
Suppose a circular queue of capacity ( $\mathrm{n}-1)$ elements is implemented with an array of $\mathrm{n}$ ... FULL: REAR $==$ FRONT 4. EMPTY: REAR== FRONT FULL: $($ FRONT+1) $\bmod \text{n}==$ REAR
Suppose a circular queue of capacity ( $\mathrm{n}-1)$ elements is implemented with an array of $\mathrm{n}$ elements. Assume that the insertion and deletion operations a...
User Avatar
0 votes
0 answers
180
UGC NET CSE | June 2023 | Part 2: 60
A $\text{B}$-tree used as an index for a large database table has four levels including the root node. If a new key is inserted in this index, then maximum number of nodes that could be newly created in the process is $5$ $4$ $3$ $2$
A $\text{B}$-tree used as an index for a large database table has four levels including the root node. If a new key is inserted in this index, then maximum number of node...
User Avatar
Page: