Login
Register
@
Dark Mode
Profile
Edit my Profile
Messages
My favorites
Register
Activity
Q&A
Questions
Unanswered
Tags
Subjects
Users
Ask
Previous Years
Blogs
New Blog
Exams
Dark Mode
Filter
User 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
commented
in
Computer Networks
Apr 8, 2017
12.2k
views
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}$
commented
in
Computer Networks
Apr 8, 2017
27.7k
views
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)
commented
in
Theory of Computation
Apr 8, 2017
1.0k
views
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.
asked
in
Others
Feb 14, 2017
2.4k
views
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
commented
in
GATE
Feb 6, 2017
860
views
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$.
commented
in
GATE
Feb 6, 2017
1.4k
views
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).
commented
in
GATE
Feb 6, 2017
1.4k
views
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$
commented
in
GATE
Feb 5, 2017
742
views
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$
commented
in
GATE
Feb 5, 2017
328
views
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 _________.
commented
in
Probability
Feb 5, 2017
9.4k
views
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 _______
commented
in
Operating System
Feb 4, 2017
15.7k
views
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
commented
in
Theory of Computation
Feb 3, 2017
8.5k
views
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$
commented
in
Theory of Computation
Feb 3, 2017
20.7k
views
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$
commented
in
Operating System
Feb 2, 2017
6.5k
views
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
comment edited
in
Compiler Design
Feb 1, 2017
15.7k
views
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$
commented
in
Algorithms
Jan 29, 2017
23.7k
views
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}$
comment edited
in
Operating System
Nov 29, 2016
760
views
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
asked
in
Verbal Aptitude
Jun 14, 2016
453
views
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 } } }
commented
in
Algorithms
May 31, 2016
1.9k
views
algorithms
time-complexity
3
answers
20
Why are user level threads faster than kernel level threads?
commented
in
Operating System
Mar 25, 2016
6.8k
views
Subscribe to GATE CSE 2024 Test Series
Subscribe to GO Classes for GATE CSE 2024
Quick search syntax
tags
tag:apple
author
user:martin
title
title:apple
content
content:apple
exclude
-tag:apple
force match
+apple
views
views:100
score
score:10
answers
answers:2
is accepted
isaccepted:true
is closed
isclosed:true
Recent Posts
Post GATE 2024 Guidance [Counseling tips and resources]
GATE CSE 2024 Result Responses
[Project Contest] Pytorch backend support for MLCommons Cpp Inference implementation
Participating in MLCommons Inference v4.0 submission (deadline is February 23 12pm IST)
IIITH PGEE 2024 Test Series by GO Classes
Subjects
All categories
General Aptitude
(3.5k)
Engineering Mathematics
(10.4k)
Digital Logic
(3.6k)
Programming and DS
(6.2k)
Algorithms
(4.8k)
Theory of Computation
(6.9k)
Compiler Design
(2.5k)
Operating System
(5.2k)
Databases
(4.8k)
CO and Architecture
(4.0k)
Computer Networks
(4.9k)
Artificial Intelligence
(79)
Machine Learning
(48)
Data Mining and Warehousing
(25)
Non GATE
(1.4k)
Others
(2.7k)
Admissions
(684)
Exam Queries
(1.6k)
Tier 1 Placement Questions
(17)
Job Queries
(80)
Projects
(11)
Unknown Category
(870)
64.3k
questions
77.9k
answers
244k
comments
80.0k
users
Recent Blog Comments
category ?
Hi @Arjun sir, I have obtained a score of 591 in ...
download here
Can you please tell about IIT-H mtech CSE self...
Please add your admission queries here:...