Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Filter
neeraj
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Recent activity by neeraj
5
answers
1
GATE CSE 2007 | Question: 20
Which one of the following uses UDP as the transport protocol? HTTP Telnet DNS SMTP
Which one of the following uses UDP as the transport protocol?HTTPTelnetDNSSMTP
12.1k
views
commented
Apr 8, 2017
Computer Networks
gatecse-2007
computer-networks
network-protocols
application-layer-protocols
easy
+
–
5
answers
2
GATE CSE 2015 Set 2 | Question: 34
Assume that the bandwidth for a $\text{TCP}$ connection is $1048560$ bits/sec. Let $\alpha$ be the value of RTT in milliseconds (rounded off to the nearest integer) after which the $\text{TCP}$ window scale option is needed. Let $\beta$ be the maximum possible ... $^{16}$ $500$ milliseconds, $65535$ $\times $2$^{14}$ $500$ milliseconds, $65535$ $\times $2$^{16}$
Assume that the bandwidth for a $\text{TCP}$ connection is $1048560$ bits/sec. Let $\alpha$ be the value of RTT in milliseconds (rounded off to the nearest integer) afte...
27.6k
views
commented
Apr 8, 2017
Computer Networks
gatecse-2015-set2
computer-networks
difficult
tcp
+
–
3
answers
3
Theory of Computation
Consider the grammar G given by S→0SA2 S→012 2A→A2 1A→11 Test whether (a)00112∈L(G) and (b)001122∈L(G)
Consider the grammar G given byS→0SA2S→0122A→A21A→11Test whether (a)00112∈L(G) and(b)001122∈L(G)
986
views
commented
Apr 8, 2017
Theory of Computation
theory-of-computation
+
–
0
answers
4
Regarding Comparison Between GATE 2017 SET 1 AND SET 2
@Arjun Sir, I think you might have seen both the sets. Sir, can you please share view point about both the sets. As I literally think that set 1 is really tough and set 2 has many direct questions. I have seen many questions ... coaching rather than self-study. It will be great for all of us if you can share your thought for the same.
@Arjun Sir, I think you might have seen both the sets. Sir, can you please share view point about both the sets.As I literally think that set 1 is really tough and set 2 ...
2.4k
views
asked
Feb 14, 2017
Others
general
query
+
–
1
answer
5
Test by Bikram | Mock GATE | Test 2 | Question: 29
Given a graph $G$ with vertex set $V$ and edge set $E$, which of the following statements is/are correct about graph $G$? If $G$ is directed and acyclic, the asymptotic algorithmic complexity of topological sort on $G$ is $O$\left ... ancestors to descendants), and cross edges (all other remaining links). I only III only I and II only I, II and III
Given a graph $G$ with vertex set $V$ and edge set $E$, which of the following statements is/are correct about graph $G$?If $G$ is directed and acyclic, the asymptotic al...
811
views
commented
Feb 6, 2017
GATE
tbb-mockgate-2
algorithms
graph-algorithms
depth-first-search
+
–
2
answers
6
Test by Bikram | Mock GATE | Test 1 | Question: 11
Consider following recursive functions: function fib(n : integer); integer begin if (n = 0) or (n = 1) then fib = 1 else fib = fib(n-l) + fib(n-2) end The above function is run on a computer with a stack of $x$ ... we can execute this function for maximum value $n = 10$ without overflowing the stack. Then the size of the stack is ______ $Bytes$.
Consider following recursive functions:function fib(n : integer); integer begin if (n = 0) or (n = 1) then fib = 1 else fib = fib(n-l) + fib(n-2) endThe above function is...
1.4k
views
commented
Feb 6, 2017
GATE
tbb-mockgate-1
numerical-answers
runtime-environment
compiler-design
+
–
3
answers
7
Test by Bikram | Mock GATE | Test 1 | Question: 49
Consider two machines, machine $A$ and machine $B$. Machine $B$ runs floating-point instructions $n$ times faster than machine $A$. Consider a program that takes $100$ $seconds$ to run on machine $A$, and spends half of its time in ... $A$) then the value of $n$ is _________ (In case of fractional value of $n$ give nearest higher positive integer).
Consider two machines, machine $A$ and machine $B$. Machine $B$ runs floating-point instructions $n$ times faster than machine $A$.Consider a program that takes $100$ $se...
1.3k
views
commented
Feb 6, 2017
GATE
tbb-mockgate-1
numerical-answers
speedup
co-and-architecture
+
–
2
answers
8
Test by Bikram | Mock GATE | Test 1 | Question: 23
Consider the relational schema S= {A,B,C,D} and the following functional dependencies on S: $A$\rightarrow BCD$ $B$\rightarrow C$ $CD$\rightarrow A$ Which of the following is true? $S$ is in $3NF$ and also in $BCNF$ $S$ is in $2NF$ not in $3NF$ $S$ is in $3NF$ but not in $BCNF$ $S$ is in $BCNF$ but not in $4NF$
Consider the relational schema S= {A,B,C,D} and the following functional dependencies on S:$A$$\rightarrow BCD$$B$$\rightarrow C$$CD$$\rightarrow A$Which of the followin...
656
views
commented
Feb 5, 2017
GATE
tbb-mockgate-1
database-normalization
databases
+
–
1
answer
9
Test by Bikram | Mock GATE | Test 1 | Question: 35
What will be the resulting grammar after removal of left-recursion from the following grammar? $E$ $\rightarrow$ $Ea $|$ Eb $|$ a $|$ b$ $E$\rightarrow$ $aE'$|$ bE'$ ; $E$'$\rightarrow$ $aE'$ $|$ $bE'$ | $\epsilon$ $ ... ;$ |$\epsilon$ $E$\rightarrow$ $aE' $|$ bE'$; $E'$ $\rightarrow$ $a$ | $b$ $|$ $\epsilon$
What will be the resulting grammar after removal of left-recursion from the following grammar?$E$ $\rightarrow$ $Ea $|$ Eb $|$ a $|$ b$$E$$\rightarrow$ $aE'$|$ bE'$ ; ...
313
views
commented
Feb 5, 2017
GATE
tbb-mockgate-1
grammar
compiler-design
+
–
10
answers
10
GATE CSE 2016 Set 2 | Question: 05
Suppose that a shop has an equal number of LED bulbs of two different types. The probability of an LED bulb lasting more than $100$ hours given that it is of Type $1$ is $0.7$, and given that it is of Type $2$ is $0.4$. The probability that an LED bulb chosen uniformly at random lasts more than $100$ hours is _________.
Suppose that a shop has an equal number of LED bulbs of two different types. The probability of an LED bulb lasting more than $100$ hours given that it is of Type $1$ is ...
9.4k
views
commented
Feb 5, 2017
Probability
gatecse-2016-set2
probability
conditional-probability
normal
numerical-answers
+
–
10
answers
11
GATE CSE 2016 Set 2 | Question: 49
Consider a non-negative counting semaphore $S$. The operation $P(S)$ decrements $S$, and $V(S)$ increments $S$. During an execution, $20$ $P(S)$ operations and $12$ $V(S)$ operations are issued in some order. The largest initial value of $S$ for which at least one $P(S)$ operation will remain blocked is _______
Consider a non-negative counting semaphore $S$. The operation $P(S)$ decrements $S$, and $V(S)$ increments $S$. During an execution, $20$ $P(S)$ operations and $12$ $V(S)...
15.6k
views
commented
Feb 4, 2017
Operating System
gatecse-2016-set2
operating-system
semaphore
normal
numerical-answers
+
–
4
answers
12
GATE CSE 2016 Set 1 | Question: 17
Which of the following decision problems are undecidable? Given NFAs $N_1$ and $N_2$ , is $L(N_1) \cap L(N_2) = \Phi$ Given a CFG $G = (N,\Sigma,P,S)$ and a string $x \in \Sigma^{*}$, does $x \in L(G)$} ? Given CFGs $G_1$ and $G_2$, is $L (G_1) = L(G_2)$? Given a TM $M$, is $L(M)=\Phi$ ? I and IV only II and III only III and IV only II and IV only
Which of the following decision problems are undecidable?Given NFAs $N_1$ and $N_2$ , is $L(N_1) \cap L(N_2) = \Phi$Given a CFG $G = (N,\Sigma,P,S)$ and a string $x \in ...
8.5k
views
commented
Feb 3, 2017
Theory of Computation
gatecse-2016-set1
theory-of-computation
decidability
easy
+
–
4
answers
13
GATE CSE 2016 Set 1 | Question: 18
Which one of the following regular expressions represents the language: the set of all binary strings having two consecutive $0$'s and two consecutive $1$'s? $(0+1 )^ *0011 (0+1)^* +(0+1)^*1100(0+1)^*$ $(0+1)^* (00(0+1)^*11+11(0+1)^*00)(0+1)^*$ $(0+1)^*00(0+1)^* + (0+1)^*11 (0+1)^*$ $00(0+1)^*11 +11(0+1)^*00$
Which one of the following regular expressions represents the language: the set of all binary strings having two consecutive $0$'s and two consecutive $1$'s?$(0+1 )^ *001...
20.6k
views
commented
Feb 3, 2017
Theory of Computation
gatecse-2016-set1
theory-of-computation
regular-expression
normal
+
–
4
answers
14
GATE CSE 2007 | Question: 83
A process, has been allocated $3$ ... above reference string, how many more page faults occur with LRU than with the optimal page replacement policy? $0$ $1$ $2$ $3$
A process, has been allocated $3$ page frames. Assume that none of the pages of the process are available in the memory initially. The process makes the following sequenc...
6.5k
views
commented
Feb 2, 2017
Operating System
gatecse-2007
normal
operating-system
page-replacement
+
–
3
answers
15
GATE CSE 2008 | Question: 55
An LALR(1) parser for a grammar G can have shift-reduce (S-R) conflicts if and only if The SLR(1) parser for G has S-R conflicts The LR(1) parser for G has S-R conflicts The LR(0) parser for G has S-R conflicts The LALR(1) parser for G has reduce-reduce conflicts
An LALR(1) parser for a grammar G can have shift-reduce (S-R) conflicts if and only ifThe SLR(1) parser for G has S-R conflictsThe LR(1) parser for G has S-R conflictsThe...
15.7k
views
comment edited
Feb 1, 2017
Compiler Design
gatecse-2008
compiler-design
parsing
normal
+
–
8
answers
16
GATE CSE 2010 | Question: 50
Consider a complete undirected graph with vertex set $\{0, 1, 2, 3, 4\}$. Entry $W_{ij}$ in the matrix $W$ below is the weight of the edge $\{i, j\}$ ... possible weight of a spanning tree $T$ in this graph such that vertex $0$ is a leaf node in the tree $T$? $7$ $8$ $9$ $10$
Consider a complete undirected graph with vertex set $\{0, 1, 2, 3, 4\}$. Entry $W_{ij}$ in the matrix $W$ below is the weight of the edge $\{i, j\}$$$W=\begin{pmatrix} 0...
23.6k
views
commented
Jan 29, 2017
Algorithms
gatecse-2010
algorithms
spanning-tree
normal
+
–
2
answers
17
GATE Overflow | Operating Systems | Test 1 | Question: 12
In a multi-user operating system, 20 requests are made to use a particular resource per hour, on average. The probability that no requests are made in 45 minutes is - $e^-{15}$ $e^{-5}$ $1 - e^{-5}$ $1-e^{-10}$
In a multi-user operating system, 20 requests are made to use a particular resource per hour, on average. The probability that no requests are made in 45 minutes is -$e^-...
723
views
comment edited
Nov 29, 2016
Operating System
go-os-1
operating-system
resource-allocation
+
–
1
answer
18
How one can prepare well for aptitude
What are the topics and books one should refer to score good in aptitude in gate
What are the topics and books one should refer to score good in aptitude in gate
445
views
asked
Jun 14, 2016
2
answers
19
What is the time complexity of the function?
void fun(int n, int k) { for (int i=1; i<=n; i++) { int p = pow(i, k); for (int j=1; j<=p; j++) { // Some O(1) work } } }
void fun(int n, int k) { for (int i=1; i<=n; i++) { int p = pow(i, k); for (int j=1; j<=p; j++) { // Some O(1) work } }}
1.9k
views
commented
May 31, 2016
Algorithms
algorithms
time-complexity
+
–
3
answers
20
Why are user level threads faster than kernel level threads?
6.7k
views
commented
Mar 25, 2016
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register