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

I forgot my password
Activity
Questions
Unanswered
Tags
Subjects
Users
Ask
Prev
Blogs
New Blog
Exams
Answers 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
+22
votes
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

2.5k
views
gate2014ag
numericalability
probability
conditionalprobability
normal
numericalanswers
0
votes
2
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

982
views
+2
votes
3
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

128
views
minimalstateautomata
theoryofcomputation
+7
votes
4
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

699
views
+1
vote
5
IITD2011Interview
#IITD_2011 which is better merge sort or heap. sort ?
answered
Mar 1, 2016
in
Interview Questions

211
views
0
votes
6
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.9k
views
gateec2014
expectation
+3
votes
7
Virtual Gate Test Series: Calculus  Limits
How to solve this?
answered
Feb 5, 2016
in
Calculus

241
views
engineeringmathematics
calculus
limits
virtualgatetestseries
0
votes
8
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

133
views
0
votes
9
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

1.2k
views
gate2015me3
numericalability
numericalanswers
triangles
+3
votes
10
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

9.5k
views
gate2008
datastructures
graphs
normal
+3
votes
11
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

3.5k
views
gate2003
databases
btree
normal
+13
votes
12
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

6.6k
views
gate2003
datastructures
easy
isro2009
binarysearchtree
+2
votes
13
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

4.2k
views
gate2005
datastructures
trees
normal
+22
votes
14
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

4.4k
views
gate2005
databases
relationalalgebra
naturaljoin
normal
+13
votes
15
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

2k
views
gate2005
settheory&algebra
easy
sets
+16
votes
16
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

3.7k
views
gate2005it
computernetworks
congestioncontrol
csmacd
normal
0
votes
17
plz answer..
answered
Nov 20, 2015
in
Computer Networks

176
views
+1
vote
18
Type of language ?
it will be accepted by NPDA. Right ??
answered
Jul 31, 2015
in
Theory of Computation

139
views
+2
votes
19
In sorting algo which has a running time that is least dependent on initial ordering of inputs
answered
Jul 31, 2015
in
Algorithms

2.7k
views
+2
votes
20
how to deal with TOC
Having trouble while doing TOC, specially with languages. Please suggest somebook / notes / lectures. Very frustrated with it.
answered
Jul 31, 2015
in
Theory of Computation

355
views
theoryofcomputation
+1
vote
21
why is the time complexity of operations like isempty, isfull, size, delete stack takes constant time ?
answered
Jul 23, 2015
in
Programming

1.6k
views
datastructures
+10
votes
22
GATE19991.10
Which of the following disk scheduling strategies is likely to give the best throughput? Farthest cylinder next Nearest cylinder next First come first served Elevator algorithm
answered
Jul 4, 2015
in
Operating System

3.8k
views
gate1999
operatingsystem
diskscheduling
normal
+1
vote
23
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........
answered
Jul 4, 2015
in
Algorithms

468
views
0
votes
24
why we use log2 n otherthan log10 n in computer science algorithums (calculating time complexities
answered
Jul 3, 2015
in
Algorithms

267
views
algorithms
timecomplexity
+1
vote
25
difference between phi and epsilon?
answered
Jul 3, 2015
in
Theory of Computation

519
views
+1
vote
26
commment
Which of the following is functionally complete set? a. {NOT, OR} b. {AND, OR} c. {AND} d. All of these
answered
Jul 2, 2015
in
Digital Logic

777
views
–3
votes
27
GATE201112
Consider a relational table with a single record for each registered student with the following attributes: $\text {Registration_Num:}$ Unique registration number for each registered student $\text {UID:}$ ... that $S \cap \text{UID}$ is $\text{NULL}$ then $S \cup \text{UID}$ is also a superkey
answered
Jul 1, 2015
in
Databases

4.6k
views
gate2011
databases
normal
candidatekeys
+1
vote
28
T(A)=OT(B) which algorithm is better? O=big oh why?
answered
Jul 1, 2015
in
Algorithms

153
views
algorithms
asymptoticnotations
0
votes
29
explain
answered
Jun 30, 2015
in
CO and Architecture

495
views
stall
pipelining
+4
votes
30
Is the language WXW^R is a regular ?
is the language WXWR is regular? can any one provide the proof?
answered
Jun 30, 2015
in
Theory of Computation

2.1k
views
Page:
1
2
3
4
5
6
7
next »
52,345
questions
60,483
answers
201,809
comments
95,287
users