The Gateway to Computer Science Excellence
For all GATE CSE Questions
Toggle navigation
Facebook Login
or
Email or Username
Password
Remember
Login
Register

I forgot my password
Activity
Questions
Unanswered
Tags
Subjects
Users
Ask
Prev
Blogs
New Blog
Exams
Recent activity by Bhagirathi
User Bhagirathi
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
User Bhagirathi
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
2
answers
1
GATE2014 AG: GA10
$10$% of the population in a town is $\text{HIV}\large ^{+}$. A new diagnostic kit for $\text{HIV}$ detection is available; this kit correctly identifies $\text{HIV}\large ^{+}$ individuals $95$ ... time. A particular patient is tested using this kit and is found to be positive. The probability that the individual is actually positive is ______.
answered
Apr 16, 2016
in
Numerical Ability

1.8k
views
gate2014ag
numericalability
probability
conditionalprobability
normal
numericalanswers
1
answer
2
link for page table concept
Till now i have not got any exciting and detailed explanation of page tables and multi level page tables concept. if you have any resource on this please post the link ..
asked
Mar 29, 2016
in
Operating System

157
views
studyresources
pagetable
5
answers
3
DFA States Question
Let Σ= {0, 1} What will be the number of states in minimal DFA, if the Binary number string is congruent to (mod 8). A. 8 B. 9 C. 7 D. 4
answered
Mar 29, 2016
in
Theory of Computation

958
views
1
answer
4
confusion in finding states in minimal DFA
number of states in the dfa which accepts the binary strings whose decimal equivalent is divisible by 5 ? since ∊ is not accepted as it doesn't have any decimal equivalent so initial state cannot be accepting state so to accept 0 (zero) there should be some other state than the initial state . so what will be the answer 5 or 6
answered
Mar 25, 2016
in
Theory of Computation

105
views
minimalstateautomata
theoryofcomputation
2
answers
5
Type of Grammar
What type of grammar is this most accurately described as? S> b/ aD D> a/ aDD A. A regular grammar B. CFG C. CSG D. Type0
answered
Mar 24, 2016
in
Theory of Computation

525
views
3
answers
6
IITD2011Interview
#IITD_2011 which is better merge sort or heap. sort ?
answered
Mar 1, 2016
in
Interview Questions

186
views
2
answers
7
IITM2012
Prove that in a group of 6 people, there are at least three mutual friends or three mutual strangers.
commented
Feb 25, 2016
in
Interview Questions

286
views
5
answers
8
expectation
A fair coin is tossed repeatedly till both head and tail appear atleast once. Average no of tosses required is ?
answered
Feb 5, 2016
in
Probability

1.4k
views
gateec2014
expectation
2
answers
9
Virtual Gate Test Series: Calculus  Limits
How to solve this?
answered
Feb 5, 2016
in
Calculus

222
views
engineeringmathematics
calculus
limits
virtualgatetestseries
1
answer
10
FOERIGN KEY
what is the advantage of keeping the Foreign Key null as we know if we make the Foreign Key null we cant reference it again so thats a disadvantage ......so there must be some advantage which outweighs this disadvantage so whats that advantage
asked
Feb 3, 2016
in
Databases

139
views
databases
referentialintegrity
6
answers
11
GATE19992.21
If $T_1 = O(1)$, give the correct matching for the following pairs: $\begin{array}{ll}\hline \text{(M) $T_n = T_{n1} + n$} & \text{(U) $T_n = O(n)$} \\\hline \text{(N) $T_n = T_{n/2} + n$} & \text{(V) $T_n = O(n \log n)$} \\\hline \text{(O) $ ... $\text{MW, NU, OX, PV}$ $\text{MV, NW, OX, PU}$ $\text{MW, NU, OV, PX}$
commented
Feb 3, 2016
in
Algorithms

3.5k
views
gate1999
algorithms
recurrence
asymptoticnotations
normal
2
answers
12
aptitude
1. S, P, M and E are four persons, working on project efficiency of M is twice that of others and M works only for half of the total days worked by E. M works 6 hours/day and E works 12 hours/day. Ratio of contribution of work to project of M and E is (i.e., work done by M work done by (A) 1 : 1 (B) 1 : 2 (C) 1 : 4 (D) 1 : 3
answered
Feb 3, 2016
in
Numerical Ability

110
views
3
answers
13
GATE2015 ME3: GA8
In the given figure angle $Q$ is a right angle, $PS:QS = 3:1, RT:QT = 5:2$ and $PU:UR = 1:1. $ If area of triangle $QTS$ is $20cm^{2},$ then the area of triangle $PQR$ in $cm^{2}$ is ______
answered
Feb 3, 2016
in
Numerical Ability

991
views
gate2015me3
numericalability
numericalanswers
triangles
5
answers
14
GATE200661
The atomic fetchandset $x, y$ instruction unconditionally sets the memory location $x$ to $1$ and fetches the old value of $x$ in $y$ without allowing any intervening access to the memory location $x$. Consider the following implementation of $P$ and $V$ ... set, a pair of normal load/store can be used The implementation of $V$ is wrong The code does not implement a binary semaphore
commented
Jan 22, 2016
in
Operating System

8.1k
views
gate2006
operatingsystem
processsynchronization
normal
8
answers
15
GATE200654
Given two arrays of numbers $a_{1},...,a_{n}$ and $b_{1},...,b_{n}$ where each number is $0$ or $1$, the fastest algorithm to find the largest span $(i, j)$ such that $ a_{i}+a_{i+1}+\dots+a_{j}=b_{i}+b_{i+1}+\dots+b_{j}$ or report that ... $\Theta (n)$ time and space Takes $O(\sqrt n)$ time only if the sum of the $2n$ elements is an even number
commented
Jan 22, 2016
in
Algorithms

6.1k
views
gate2006
algorithms
normal
algorithmdesign
timecomplexity
5
answers
16
GATE200842
$G$ is a graph on $n$ vertices and $2n2$ edges. The edges of $G$ can be partitioned into two edgedisjoint spanning trees. Which of the following is NOT true for $G$? For every subset of $k$ ... are at least $2$ edgedisjoint paths between every pair of vertices. There are at least $2$ vertexdisjoint paths between every pair of vertices.
answered
Jan 21, 2016
in
DS

7.7k
views
gate2008
datastructure
graphs
normal
6
answers
17
GATE200365
Consider the following $234$ tree (i.e., Btree with a minimum degree of two) in which each data item is a letter. The usual alphabetical ordering of letters is used in constructing the tree. What is the result of inserting $G$ in the above tree? None of the above
answered
Jan 20, 2016
in
Databases

2.9k
views
gate2003
databases
btree
normal
5
answers
18
GATE200363, ISRO200925
A data structure is required for storing a set of integers such that each of the following operations can be done in $O(\log n)$ time, where $n$ is the number of elements in the set. Deletion of the smallest element Insertion of an element if ... be used but not a heap Both balanced binary search tree and heap can be used Neither balanced search tree nor heap can be used
answered
Jan 20, 2016
in
DS

5.4k
views
gate2003
datastructure
easy
isro2009
binarysearchtree
3
answers
19
GATE200354
Define languages $L_0$ and $L_1$ as follows : $L_0 = \{\langle M, w, 0 \rangle \mid M \text{ halts on }w\} $ $L_1 = \{\langle M, w, 1 \rangle \mid M \text{ does not halts on }w\}$ Here $\langle M, w, i \rangle$ is a triplet, whose first component ... $L'$ is not $L'$ is recursively enumerable, but $ L$ is not Both $L$ and $L'$ are recursive Neither $L$ nor $L'$ is recursively enumerable
commented
Jan 20, 2016
in
Theory of Computation

7.3k
views
theoryofcomputation
turingmachine
gate2003
difficult
1
answer
20
GATE20037
Consider the set $\Sigma^*$ of all strings over the alphabet $\Sigma = \{0, 1\}$. $\Sigma^*$ with the concatenation operator for strings does not form a group forms a noncommutative group does not have a right identity element forms a group if the empty string is removed from $\Sigma^*$
commented
Jan 20, 2016
in
Set Theory & Algebra

2.2k
views
gate2003
settheory&algebra
groups
normal
6
answers
21
GATE200536
In a complete $k$ary tree, every internal node has exactly $k$ children. The number of leaves in such a tree with $n$ internal node is: $nk$ $(n1)k + 1$ $n(k1) +1$ $n(k1)$
answered
Jan 18, 2016
in
DS

3.4k
views
gate2005
datastructure
trees
normal
3
answers
22
GATE200535
How many distinct binary search trees can be created out of $4$ distinct keys? $5$ $14$ $24$ $42$
commented
Jan 18, 2016
in
Graph Theory

2.2k
views
gate2005
graphtheory
counting
normal
4
answers
23
GATE200530
Let r be a relation instance with schema R = (A, B, C, D). We define $r_1 = \pi_{A, B, C} (R)$ and $r_2=\pi_{A, D} (r)$. Let $s =r_1 \: * \: r_2$ where $*$ denotes natural join. Given that the decomposition of $r$ into $r_1$ and $r_2$ is lossy, which one of the following is TRUE? $s \subset r$ $r \cup s =r$ $r \subset s$ $r*s=s$
answered
Jan 18, 2016
in
Databases

3.3k
views
gate2005
databases
relationalalgebra
naturaljoin
normal
5
answers
24
GATE20058
Let $A, B$ and $C$ be nonempty sets and let $X = ( A  B )  C$ and $Y = ( A  C )  ( B  C ).$ Which one of the following is TRUE? $X = Y$ $X ⊂ Y$ $Y ⊂ X$ None of these
answered
Jan 18, 2016
in
Set Theory & Algebra

1.2k
views
gate2005
settheory&algebra
easy
sets
5
answers
25
GATE200665
Consider three processes, all arriving at time zero, with total execution time of $10$, $20$ and $30$ units, respectively. Each process spends the first $\text{20%}$ of execution time doing I/O, the next $\text{70%}$ of time doing computation, and the last $\text{10%}$ of ... For what percentage of time does the CPU remain idle? $\text{0%}$ $\text{10.6%}$ $\text{30.0%}$ $\text{89.4%}$
commented
Jan 17, 2016
in
Operating System

5.2k
views
gate2006
operatingsystem
processschedule
normal
1
answer
26
pipeline cycles
I think they calculated whole things wrong.. with operand forwarding answer is 9,but they drew wrong diagram..and without answer will be 14.as we can use id stage under wb stage. so answer shoyld be 5. @arjun sir.
commented
Jan 12, 2016
in
CO and Architecture

265
views
pipelining
coandarchitecture
5
answers
27
GATE2005IT27
Which of the following statements is TRUE about CSMA/CD: IEEE $802.11$ wireless LAN runs CSMA/CD protocol Ethernet is not based on CSMA/CD protocol CSMA/CD is not suitable for a high propagation delay network like satellite network There is no contention in a CSMA/CD network
answered
Nov 21, 2015
in
Computer Networks

2.7k
views
gate2005it
computernetworks
congestioncontrol
csmacd
normal
5
answers
28
GATE2005IT28
Which of the following statements is FALSE regarding a bridge? Bridge is a layer $2$ device Bridge reduces collision domain Bridge is used to connect two or more LAN segments Bridge reduces broadcast domain
commented
Nov 21, 2015
in
Computer Networks

2.6k
views
gate2005it
computernetworks
lantechnologies
normal
2
answers
29
TCP connection
Suppose a client C repeatedly connects via TCP to a given port on a server S, and that each time it is C that initiates the close. If timewait state lasts for 60 seconds, then how many TCP connections a second can 'C' make with all available ports? Assume client port are in the range of 1024 to 5119. A) 70 per sec B)10 per sec C) 13 per sec D) 100 per sec
answer selected
Nov 21, 2015
in
Computer Networks

500
views
computernetworks
tcp
3
answers
30
Let a cluster of stations share 48 Kbps of pure Aloha channel. Every station outputs frames of length 1024 bits on an average of every 50 seconds. Then what is the maximum value of number of stations?
answer selected
Nov 21, 2015
in
Computer Networks

914
views
pure_aloha
2
answers
31
The round trip delay for a 100 Mbps Ethernet having 48 bit jamming signal is 64 * 10^6 sec. What is the minimum frame size? 1. 400 bytes 2. 800 bytes 3. 600 bytes 4. 1400 bytes
commented
Nov 21, 2015
in
Computer Networks

1k
views
2
answers
32
plz answer..
answered
Nov 20, 2015
in
Computer Networks

154
views
2
answers
33
L1 = {ca^nb^n} ∪ {da^nb^2n} L2 = {a^nb^n c} ∪ {a^nb^2n d}
$L_1 = \left\{ca^nb^n\right\} \cup \left\{da^nb^{2n}\right\}$ $L_2 = \left\{a^nb^n c\right\} \cup \left\{a^nb^{2n} d\right\}$ Both are DCFL’s Both are NCFL’s L1 is DCFL, L2 is NCFL L1 is NCFL, L2 is DCFL
commented
Aug 22, 2015
in
Theory of Computation

679
views
theoryofcomputation
6
answers
34
GATE201232
Fetch_And_Add(X,i) is an atomic ReadModifyWrite instruction that reads the value of memory location $X$, increments it by the value $i$, and returns the old value of $X$. It is used in the pseudocode shown below to implement a busywait ... can take on a nonzero value when the lock is actually available works correctly but may starve some processes works correctly without starvation
commented
Aug 10, 2015
in
Operating System

9.6k
views
gate2012
operatingsystem
processsynchronization
normal
1
answer
35
GATE200666
Consider the following snapshot of a system running $n$ processes. Process $i$ is holding $x_i$ instances of a resource $R$, $ 1\leq i\leq n$ . Currently, all instances of $R$ are occupied. Further, for all $i$, process $i$ has placed a request for an additional $y_i$ ... $ \max(x_{p},x_{q})>1$ $ \min(x_{p},x_{q})>1$
answer selected
Aug 10, 2015
in
Operating System

5.2k
views
gate2006
operatingsystem
resourceallocation
normal
1
answer
36
Can Regular Grammar be ambiguous ?
commented
Aug 7, 2015
in
Compiler Design

2.2k
views
2
answers
37
How to solve below question of undirected subgraph for finding shortest path ?
Let G = (V, E) be an undirected graph with a subgraph G1 = (V1, E1). Weights are assigned to edges of G as follows : w(e) = 0 if e belongs to E1 1 otherwise A singlesource shortest path algorithm is executed on the weighted ... B) G1 is connected (C) V1 forms a clique in G (D) G1 is a tree Plz tell the approach........
commented
Aug 6, 2015
in
Algorithms

429
views
3
answers
38
why is the time complexity of operations like isempty, isfull, size, delete stack takes constant time ?
commented
Aug 6, 2015
in
Programming

1.4k
views
datastructure
7
answers
39
GATE200916, ISRO201712
Which one of the following is FALSE? There is a unique minimal DFA for every regular language Every NFA can be converted to an equivalent PDA. Complement of every contextfree language is recursive. Every nondeterministic PDA can be converted to an equivalent deterministic PDA.
commented
Aug 6, 2015
in
Theory of Computation

4.3k
views
gate2009
theoryofcomputation
easy
isro2017
nondeterminism
2
answers
40
Type of language ?
it will be accepted by NPDA. Right ??
answered
Jul 31, 2015
in
Theory of Computation

124
views
50,644
questions
56,500
answers
195,546
comments
101,001
users