Register
Filter

Recent activity by Manoj_Kumar

2 answers
2
Test by Bikram | Databases | Test 1 | Question: 17
This is an Instance of Sailors Relation ... S2.rating ) SELECT S.sname FROM Sailors S WHERE S.rating >ALL ( SELECT S2.rating FROM Sailors S2 WHERE S2.age < 21 )
This is an Instance of Sailors Relation$$\overset{\text{Sailors Table}} { \begin{array}{|l|l|} \hline \text{S_ID} & \text{S_Name} & \text{Rating} & \text{Age} \\ \hline 1...
2 answers
3
madeeasy
Consider the effect of using slow start on a link with 5 millisec round trip time and no congestion. The receiver window is 36 KB and the maximum segment size = 2 KB. The time (in milliseconds) before the first full window can be sent is ________.
Consider the effect of using slow start on a link with 5 millisec round trip time and no congestion. The receiver window is 36 KB and the maximum segment size = 2 KB. The...
2 answers
7
please explain
1 answer
11
Expression Tree
If we have to construct the expression tree from this expression (3 + ((5+9)*2)) then what will be the order of push and pop operation on a stack ?Explain what to do with each operator and operand along the way of push and pop operation
If we have to construct the expression tree from this expression (3 + ((5+9)*2)) then what will be the order of push and pop operation on a stack ?Explain what to do with...
1 answer
12
logic functions
Given $x,y,z$ are Boolean variables and $f(x,y,z)=f(y',x',z)$. How many such functions are possible with $x, y, z$? $0$ $2^2$ $2^4$ $2^6$
Given $x,y,z$ are Boolean variables and $f(x,y,z)=f(y',x',z)$. How many such functions are possible with $x, y, z$?$0$$2^2$$2^4$$2^6$
1 answer
13
GATE Overflow | Algorithms | Test 1 | Question: 26
Maximum element in a min-heap represented by an array, can be computed in _____ time $O(n)$ $O(\log n)$ $O(n \log n)$ but not $O(n)$ $O(1)$
Maximum element in a min-heap represented by an array, can be computed in _____ time$O(n)$$O(\log n)$$O(n \log n)$ but not $O(n)$$O(1)$
6 answers
14
GATE CSE 2010 | Question: 45
The following program consists of $3$ concurrent processes and $3$ binary semaphores. The semaphores are initialized as $S0=1, S1=0$ and $S2=0.$ ... $P0$ print '$0$'? At least twice Exactly twice Exactly thrice Exactly once
The following program consists of $3$ concurrent processes and $3$ binary semaphores. The semaphores are initialized as $S0=1, S1=0$ and $S2=0.$$$\begin{array}{|l|l|}\hli...
1 answer
15
doubt
#plz explain??
#plz explain??
2 answers
16
doubt
#plz explain??
#plz explain??
2 answers
19
Test by Bikram | Computer Networks | Test 1 | Question: 26
Consider a sliding window protocol that uses Selective Repeat, the sender sliding window size is $32$. The sequence number of the frame to be sent after sending $200$ frames ___________
Consider a sliding window protocol that uses Selective Repeat, the sender sliding window size is $32$. The sequence number of the frame to be sent after sending $200$ fra...
2 answers
21
GATE Overflow | Algorithms | Test 1 | Question: 1
For the following program fragment, the running time is given by Procedure A(n) { if(n <= 2) return 1; else return A(log (n)); } $\Theta(\log \log n)$ $\Theta(\log \sqrt n)$ $\Theta(\log^* n)$ $\Theta(\sqrt n)$
For the following program fragment, the running time is given byProcedure A(n) { if(n <= 2) return 1; else return A(log (n)); }$\Theta(\log \log n)$$\Theta(\log \sqrt n)$...