Recent activity by Bhagirathi / GATE Overflow for GATE CSE

2 answers

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.9k views

answered Apr 15, 2016

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 ..

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 .....

453 views

asked Mar 28, 2016

4 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

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

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

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...

600 views

answered Mar 25, 2016

1 answer

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. 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

3 answers

6

IITD2011Interview
#IITD_2011 which is better merge sort or heap. sort ?

#IITD_2011 which is better merge sort or heap. sort ?

546 views

answered Mar 1, 2016

2 answers

7

IITM2012
Prove that in a group of 6 people, there are at least three mutual friends or three mutual strangers.

Prove that in a group of 6 people, there are at least three mutual friends or three mutual strangers.

2.3k views

commented Feb 25, 2016

5 answers

8

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.8k views

answered Feb 4, 2016

2 answers

9

Virtual Gate Test Series: Calculus - Limits
How to solve this?

How to solve this?

775 views

answered Feb 4, 2016

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

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...

457 views

asked Feb 3, 2016

8 answers

11

GATE CSE 1999 | Question: 2.21
If $T_1 = O(1)$, give the correct matching for the following pairs: $\begin{array}{l|l}\hline \text{(M) $T_n = T_{n-1} + n$} & \text{(U) $T_n = O(n)$} \\\hline \text{(N) $T_n = T_{n/2} + n$} & \text{(V) $T_n = O(n \log n)$ ... $\text{M-W, N-U, O-X, P-V}$ $\text{M-V, N-W, O-X, P-U}$ $\text{M-W, N-U, O-V, P-X}$

If $T_1 = O(1)$, give the correct matching for the following pairs:$$\begin{array}{l|l}\hline \text{(M) $T_n = T_{n-1} + n$} & \text{(U) $T_n = O(n)$} \\\hline \text{(...

15.1k views

commented Feb 3, 2016

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

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 ...

386 views

answered Feb 3, 2016

3 answers

13

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.1k views

answered Feb 3, 2016

6 answers

14

GATE CSE 2006 | Question: 61
The atomic fetch-and-set $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$ ... a pair of normal load/store can be used The implementation of $V$ is wrong The code does not implement a binary semaphore

The atomic fetch-and-set $x, y$ instruction unconditionally sets the memory location $x$ to $1$ and fetches the old value of $x$ in $y$ without allowing any intervening a...

27.7k views

commented Jan 21, 2016

10 answers

15

GATE CSE 2006 | Question: 54
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}$ ... time in the key comparison mode Takes $\Theta (n)$ time and space Takes $O(\sqrt n)$ time only if the sum of the $2n$ elements is an even number

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...

29.4k views

commented Jan 21, 2016

6 answers

16

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

7 answers

17

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

4 answers

18

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

4 answers

19

GATE CSE 2003 | Question: 54
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 ... $L'$ is recursively enumerable, but $ L$ is not Both $L$ and $L'$ are recursive Neither $L$ nor $L'$ is recursively enumerable

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 o...

24.2k views

commented Jan 20, 2016

2 answers

20

GATE CSE 2003 | Question: 7
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 non-commutative group does not have a right identity element forms a group if the empty string is removed from $\Sigma^*$

Consider the set $\Sigma^*$ of all strings over the alphabet $\Sigma = \{0, 1\}$. $\Sigma^*$ with the concatenation operator for stringsdoes not form a groupforms a non-c...

9.0k views

commented Jan 19, 2016

8 answers

21

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

4 answers

22

GATE CSE 2005 | Question: 35
How many distinct binary search trees can be created out of $4$ distinct keys? $5$ $14$ $24$ $42$

How many distinct binary search trees can be created out of $4$ distinct keys?$5$$14$$24$$42$

24.5k views

commented Jan 17, 2016

5 answers

23

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

5 answers

24

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.1k views

answered Jan 17, 2016

7 answers

25

GATE CSE 2006 | Question: 65
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%}$ ... percentage of time does the CPU remain idle? $\text{0%}$ $\text{10.6%}$ $\text{30.0%}$ $\text{89.4%}$

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 e...

31.6k views

commented Jan 16, 2016

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.

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 w...

1.0k views

commented Jan 12, 2016

5 answers

27

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.8k views

answered Nov 20, 2015

6 answers

28

GATE IT 2005 | Question: 28
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

Which of the following statements is FALSE regarding a bridge?Bridge is a layer $2$ deviceBridge reduces collision domainBridge is used to connect two or more LAN segment...

11.4k views

commented Nov 20, 2015

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 time-wait 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

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 time-wait state lasts for 60 seconds...

1.5k views

answer selected Nov 20, 2015

2 answers

30

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

9.3k views

commented Nov 20, 2015

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