Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Filter
Profile
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Answers by Bhagirathi
24
votes
1
GATE2014 AG: GA-10
$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 ______.
$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}\larg...
6.8k
views
answered
Apr 15, 2016
Quantitative Aptitude
gate2014-ag
quantitative-aptitude
probability
conditional-probability
normal
numerical-answers
+
–
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
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
1.4k
views
answered
Mar 28, 2016
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
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 equ...
589
views
answered
Mar 25, 2016
Theory of Computation
minimal-state-automata
theory-of-computation
+
–
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. Type-0
What type of grammar is this most accurately described as?S- b/ aDD- a/ aDDA. A regular grammar B. CFG C. CSG D. Type-0
4.9k
views
answered
Mar 24, 2016
2
votes
5
IITD2011Interview
#IITD_2011 which is better merge sort or heap. sort ?
#IITD_2011 which is better merge sort or heap. sort ?
543
views
answered
Mar 1, 2016
0
votes
6
expectation
A fair coin is tossed repeatedly till both head and tail appear atleast once. Average no of tosses required is ?
A fair coin is tossed repeatedly till both head and tail appear atleast once. Average no of tosses required is ?
4.7k
views
answered
Feb 4, 2016
Probability
gate-ec-2014
expectation
+
–
3
votes
7
Virtual Gate Test Series: Calculus - Limits
How to solve this?
How to solve this?
767
views
answered
Feb 4, 2016
Calculus
engineering-mathematics
calculus
limits
virtual-gate-test-series
+
–
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
1. S, P, M and E are four persons, working on project efficiency of M is twice that of others and Mworks only for half of the total days worked by E. M works 6 hours/day ...
379
views
answered
Feb 3, 2016
0
votes
9
GATE2015 ME-3: GA-8
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 ______
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...
3.0k
views
answered
Feb 3, 2016
Quantitative Aptitude
gate2015-me-3
quantitative-aptitude
numerical-answers
triangles
+
–
4
votes
10
GATE CSE 2008 | Question: 42
$G$ is a graph on $n$ vertices and $2n-2$ edges. The edges of $G$ can be partitioned into two edge-disjoint spanning trees. Which of the following is NOT true for $G$? For every subset of $k$ vertices, the induced subgraph has at ... least $2$ edge-disjoint paths between every pair of vertices. There are at least $2$ vertex-disjoint paths between every pair of vertices.
$G$ is a graph on $n$ vertices and $2n-2$ edges. The edges of $G$ can be partitioned into two edge-disjoint spanning trees. Which of the following is NOT true for $G$?For...
23.6k
views
answered
Jan 21, 2016
Graph Theory
gatecse-2008
graph-connectivity
normal
+
–
3
votes
11
GATE CSE 2003 | Question: 65
Consider the following $2-3-4$ tree (i.e., B-tree 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
Consider the following $2-3-4$ tree (i.e., B-tree with a minimum degree of two) in which each data item is a letter. The usual alphabetical ordering of letters is used in...
10.1k
views
answered
Jan 20, 2016
Databases
gatecse-2003
databases
b-tree
normal
+
–
14
votes
12
GATE CSE 2003 | Question: 63, ISRO2009-25
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 ... used but not a heap Both balanced binary search tree and heap can be used Neither balanced search tree nor heap can be used
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...
20.3k
views
answered
Jan 20, 2016
DS
gatecse-2003
data-structures
easy
isro2009
binary-search-tree
+
–
2
votes
13
GATE CSE 2005 | Question: 36
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$ $(n-1)k + 1$ $n(k-1) +1$ $n(k-1)$
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$$(n-1)k + 1$$n(k-1) +1$$n(k-1)...
23.1k
views
answered
Jan 17, 2016
DS
gatecse-2005
data-structures
tree
normal
+
–
28
votes
14
GATE CSE 2005 | Question: 30
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$
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 natura...
16.3k
views
answered
Jan 17, 2016
Databases
gatecse-2005
databases
relational-algebra
natural-join
normal
+
–
19
votes
15
GATE CSE 2005 | Question: 8
Let $A, B$ and $C$ be non-empty 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
Let $A, B$ and $C$ be non-empty 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 thes...
7.0k
views
answered
Jan 17, 2016
Set Theory & Algebra
gatecse-2005
set-theory&algebra
easy
set-theory
+
–
20
votes
16
GATE IT 2005 | Question: 27
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
Which of the following statements is TRUE about CSMA/CD:IEEE $802.11$ wireless LAN runs CSMA/CD protocolEthernet is not based on CSMA/CD protocolCSMA/CD is not suitable f...
13.7k
views
answered
Nov 20, 2015
Computer Networks
gateit-2005
computer-networks
congestion-control
csma-cd
normal
+
–
0
votes
17
plz answer..
390
views
answered
Nov 20, 2015
1
votes
18
Type of language ?
it will be accepted by NPDA. Right ??
it will be accepted by NPDA. Right ??
440
views
answered
Jul 31, 2015
2
votes
19
In sorting algo which has a running time that is least dependent on initial ordering of inputs
options A. insertion B. quick C. selection D. merge
optionsA. insertionB. quickC. selectionD. merge
6.5k
views
answered
Jul 31, 2015
Algorithms
sorting
time-complexity
+
–
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.
Having trouble while doing TOC, specially with languages.Please suggest somebook / notes / lectures.Very frustrated with it.
726
views
answered
Jul 31, 2015
Theory of Computation
theory-of-computation
+
–
1
votes
21
why is the time complexity of operations like isempty, isfull, size, delete stack takes constant time ?
According to me when we perform the above operations we have to traverse the entire list so then why does it all take constant time ?
4.0k
views
answered
Jul 22, 2015
Programming in C
data-structures
+
–
12
votes
22
GATE CSE 1999 | Question: 1.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
Which of the following disk scheduling strategies is likely to give the best throughput?Farthest cylinder nextNearest cylinder nextFirst come first servedElevator algorit...
11.2k
views
answered
Jul 4, 2015
Operating System
gate1999
operating-system
disk-scheduling
normal
+
–
1
votes
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 single-source 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........
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 E11 otherwiseA single-source ...
1.2k
views
answered
Jul 4, 2015
Algorithms
graph-algorithms
shortest-path
+
–
0
votes
24
why we use log2 n otherthan log10 n in computer science algorithums (calculating time complexities
708
views
answered
Jul 3, 2015
Algorithms
algorithms
time-complexity
+
–
1
votes
25
difference between phi and epsilon?
14.9k
views
answered
Jul 3, 2015
1
votes
26
commment
Which of the following is functionally complete set? a. {NOT, OR} b. {AND, OR} c. {AND} d. All of these
Which of the following is functionally complete set?a. {NOT, OR}b. {AND, OR}c. {AND}d. All of these
1.4k
views
answered
Jul 2, 2015
–2
votes
27
GATE CSE 2011 | Question: 12
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
Consider a relational table with a single record for each registered student with the following attributes:$\text {Registration_Num:}$ Unique registration number for each...
16.5k
views
answered
Jul 1, 2015
Databases
gatecse-2011
databases
normal
candidate-key
+
–
1
votes
28
T(A)=OT(B) which algorithm is better? O=big oh why?
422
views
answered
Jul 1, 2015
Algorithms
algorithms
asymptotic-notation
+
–
0
votes
29
explain
1.0k
views
answered
Jun 30, 2015
CO and Architecture
stall
pipelining
+
–
5
votes
30
Is the language WXW^R is a regular ?
is the language WXWR is regular? can any one provide the proof?
is the language WXWR is regular? can any one provide the proof?
7.8k
views
answered
Jun 29, 2015
Page:
1
2
3
4
5
6
7
next »
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register