GATE CSE
For all GATE CSE Questions
Toggle navigation
GATE Overflow
Facebook Login
Google Login
or
Email or Username
Password
Remember
Login
Register

I forgot my password
All Activity
Questions
Unanswered
Tags
Subjects
Users
Ask
Previous
Blogs
New Blog
Exams
First time here? Checkout the
FAQ
!
x
×
Close
Use the google search bar on side panel. It searches through all previous GATE/other questions.
Recent activity by rahul sharma 5
User rahul sharma 5
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
User rahul sharma 5
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
1
answer
1
AlGO: Madeeasy:TS Greedy Method How to approach
commented
Feb 28
in
Algorithms

162
views
algorithms
greedyalgorithm
madeeasy_testseries
5
answers
2
GATE2008IT63
Consider the following three schedules of transactions T1, T2 and T3. [Notation: In the following NYO represents the action Y (R for read, W for write) performed by transaction N on object O.] (S1) 2RA 2WA 3RC 2WB 3WA 3WC 1RA 1RB 1WA ... to each other S2 is conflict equivalent to S3, but not to S1 S1 is conflict equivalent to S2, but not to S3
commented
Feb 9
in
Databases

646
views
gate2008it
databases
transactions
normal
3
answers
3
Gate ECE 2017 Eigen Value
commented
Feb 9
in
Linear Algebra

316
views
matrix
eigenvalue
eigenvector
1
answer
4
DBMS Normalization
If a relation is in 3nf and atmost one compound key then? 1. Relation is in BCNF 2. Relation is not in BCNF. 3. Relation may be in BCNF I was thinking like if i have a relation where R(ABCDE),where ABC is the candidate key(only one ... is not superkey so it cant be the BCNF,but answer given was that it will always be BCNF.Please tell what did i miss?
asked
Feb 9
in
Databases

84
views
databasenormalization
1
answer
5
Digital ECE Gate 2017 Set 1
commented
Feb 9
in
Digital Logic

226
views
digitallogic
1
answer
6
turing machine
commented
Feb 9
in
Theory of Computation

277
views
theoryofcomputation
turingmachine
1
answer
7
turning machine
TM 'M1' accepts atmost 2 distinct input . TM 'M2' accept more than 2 distinct input . Which of the machine is Turning recognizable ?
commented
Feb 9
in
Theory of Computation

198
views
theoryofcomputation
turingmachine
testseries
2
answers
8
Gate ECE GA 2017
commented
Feb 8
in
Numerical Ability

720
views
aptitude
speeddistance
1
answer
9
Addressing Mode
commented
Feb 8
in
CO & Architecture

51
views
2
answers
10
GATE 2016244
Consider the following languages. $L_{1} = \left\{\left\langle M \right\rangle \mid M \text{ takes at least 2016 steps on some input} \right\}$, $L_{2} = \left\{\left\langle M \right\rangle \mid M \text { takes at least 2016 steps on all inputs ... not recursive $L_{1}, L_{2}$ are recursive and $L_{3}$ is not recursive $L_{1}, L_{2}, L_{3}$ are recursive
comment edited
Feb 7
in
Theory of Computation

2.9k
views
gate20162
theoryofcomputation
recursiverecursivelyenumerable
normal
turingmachine
2
answers
11
GATE2017 EC Digital
commented
Feb 7
in
Digital Logic

519
views
digitallogic
3
answers
12
GATE200372
The following resolution rule is used in logic programming. Derive clause (P ∨ Q) from clauses (P ∨ R), (Q ∨ ¬R) Which of the following statements related to this rule is FALSE? ((P ∨ R) ∧ (Q ∨ ¬R)) ⇒ (P ∨ Q) is logically valid (P ∨ Q) ⇒ ((P ... if and only if (P ∨ R) ∧ (Q ∨ ¬R) is satisfiable (P ∨ Q) ⇒ FALSE if and only if both P and Q are unsatisfiable
commented
Feb 4
in
Mathematical Logic

763
views
gate2003
mathematicallogic
normal
1
answer
13
Graph Theory Me workbook
How S2 is correct ,I can have more than nk edges like if n=7 and k=3 ,then K1(abcde) k2(f() k2(g).K1,k2,k3 are different compoinents i assumes,Now in K1 i can add one more edge between a to c or a to d and still it will be simple graph and it will have 3 components?Please help
commented
Feb 4
in
Set Theory & Algebra

48
views
discretemathematics
graphconnectivity
2
answers
14
Group Theory discrete maths
A={1,2,3,4,5,6} Given that set A is a group with respect to multiplication mod 7.Is A a cyclic group?If yes,identify the generators. Is there any theorem that i cana pply here to solve without building operation table?
commented
Feb 4
in
Set Theory & Algebra

118
views
discretemathematics
groups
2
answers
15
Combinations
How many number of 5 letter words that use letters from the 3 letter set {a,b,c} in which each letter occur atleast once?
commented
Feb 3
in
Mathematical Logic

136
views
combinatory
permutation
0
answers
16
Discrete maths penreposition
Can anyone tell me why the scope of NOT operator is limited to the first operand of OR only,While working with quantifiers generally not will go alway till end,so why is it limited to only first oeprand of OR and not second
asked
Feb 3
in
Mathematical Logic

29
views
discretemathematics
mathematicallogic
3
answers
17
Probability
A fair coin is tossed ten times in succession. If the first toss produces a head, then the probability of getting exactly three heads in ten tosses is I am doing like : $\frac{1}{2}*n(9,2)*\frac{1}{2}^2\frac{1}{2}^7$ I am using ... ? After that i will find 2 success if of 9 trials. Please help,that inital (1/2) term above is correct ir should it be 1?
commented
Jan 27
in
Probability

135
views
probability
engineeringmathematics
0
answers
18
[Computer Network] Sliding window General doubt Tanenbaum p333
closed
Jan 26
in
Computer Networks

44
views
computernetworks
slidingwindow
3
answers
19
madeeasy mock test2
Which of the following statement is true related to synchronization mechanism? a) If any solution is satisfying the progress condition, then it will not have any deadlock. b) Race condition occur if mutual exclusion is satisfied. c) Bounded waiting is always satisfied if there are only two processes. d) None.
commented
Jan 25
in
Operating System

136
views
processsynchronization
deadlock
3
answers
20
GATE2007IT16
The minimum positive integer p such that 3p modulo 17 = 1 is 5 8 12 16
commented
Jan 24
in
Set Theory & Algebra

478
views
gate2007it
settheory&algebra
normal
8
answers
21
GATE 2016154
For a host machine that uses the token bucket algorithm for congestion control, the token bucket has a capacity of 1 mega byte and the maximum output rate is 20 mega bytes per second. Tokens arrive at a rate to sustain output at a ... the machine needs to send 12 mega bytes of data. The minimum time required to transmit the data is _____________ seconds.
commented
Jan 24
in
Computer Networks

3.9k
views
gate20161
computernetworks
tokenbucket
normal
numericalanswers
4
answers
22
GATE2012_45
Consider an instance of TCP’s Additive Increase Multiplicative Decrease (AIMD) algorithm where the window size at the start of the slow start phase is 2 MSS and the threshold at the start of the first transmission is 8 MSS. Assume that a timeout occurs during ... size at the end of the tenth transmission. (A) 8 MSS (B) 14 MSS (C) 7 MSS (D) 12 MSS
commented
Jan 24
in
Computer Networks

2.4k
views
gate2012
computernetworks
congestioncontrol
normal
2
answers
23
GATE2008IT68
Which of the following statements are TRUE? S1: TCP handles both congestion and flow control S2: UDP handles congestion but not flow control S3: Fast retransmit deals with congestion but not flow control S4: Slow start mechanism deals with both congestion and flow control S1, S2 and S3 only S1 and S3 only S3 and S4 only S1, S3 and S4 only
commented
Jan 24
in
Computer Networks

784
views
gate2008it
computernetworks
networkprotocols
normal
1
answer
24
GATE2006IT67
A link of capacity 100 Mbps is carrying traffic from a number of sources. Each source generates an onoff traffic stream; when the source is on, the rate of traffic is 10 Mbps, and when the source is off, the rate of traffic is zero. The duty cycle ... loss occurs is S2. The values of S1 and S2 are, respectively, 10 and 30 12 and 25 5 and 33 15 and 22
commented
Jan 24
in
Computer Networks

708
views
gate2006it
computernetworks
networkflow
normal
2
answers
25
GATE200456
Consider three IP networks $A, B$ and $C$. Host $H_A$ in network $A$ sends messages each containing 180 bytes of application data to a host $H_C$ in network $C$. The TCP layer prefixes 20 byte header to the message. This passes through ... IP layer at the destination for one application message, in the best case? Consider only data packets. 200 220 240 260
commented
Jan 24
in
Computer Networks

2.1k
views
gate2004
computernetworks
ipv4
tcp
normal
4
answers
26
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
Jan 24
in
Computer Networks

648
views
gate2005it
computernetworks
lantechnologies
normal
1
answer
27
DBMS Question
Is Nested loop join a part of GATE SYLLABUS this year
commented
Jan 24
in
Databases

43
views
0
answers
28
type of relation
how is it not transitive?? i mean take any time instant.ie x= 4:00 and y=4:20,z= 4:40..they are transitive..right??
commented
Jan 23
in
Set Theory & Algebra

38
views
relations
engineeringmathematics
0
answers
29
madeeasytestseries#ds
Consider a complete Binary Tree ‘T’ with key of root node be ‘P’. It is given that the left and right subtree of ‘P’ satisfies minheap property. What is the time taken to convert the given tree ‘T’ to a max heap ? a. Ο(log n) b. Ο(n) c. Ο(n log n) d. Ο(n2)
commented
Jan 23
in
Programming

44
views
1
answer
30
Ace Test Series
Explain...?
commented
Jan 23
in
Theory of Computation

42
views
acetestseries
toc
1
answer
31
ME Full Syllabsu Test 1
consider a hash table with 8 slots that uses chaining for collision resolution.The table is initially empty. What is the probability that after 4 keys are inserted, atleast a chain of size 3 is created?(assume simple uniform hashing is used) a. 29*83 b.84 c 83 d 3*81
commented
Jan 23
in
Algorithms

55
views
1
answer
32
Ace Test Series
Answer given as Option (A)...., Choose correct answer and Explain....!!!??
commented
Jan 23
in
Theory of Computation

65
views
acetestseries
toc
identifyclasslanguage
1
answer
33
ACE test series
____________ uses entire capacity of link. (a)circuit switching (b)packet switching (c)both (d)none
commented
Jan 23
in
Computer Networks

58
views
acetestseries
computernetworks
0
answers
34
linked list
how much time take, if Insert/delete at end in linked list? a) when last element is unknown. b) when last element is known
commented
Jan 23
in
DS

41
views
0
answers
35
[Computer Networks] Slow and start Throughput
asked
Jan 23
in
Computer Networks

43
views
congestioncontrol
computernetworks
0
answers
36
[Computer Networks] Protocols classification
asked
Jan 23
in
Computer Networks

23
views
computernetworks
network
1
answer
37
General Doubt In rice theorem
If we are not able to apply nonmonote property ,then is it always true that it is RE but not REC,are there any scenarios where we can't apply nonmonotone property but still language is NOT RE. Say,L={TM L(TM) has atleast one ... not REC. P.S: By (i) and (ii) ,i mean the definitions mentioned here.(http://gatecse.in/ricestheorem/)
asked
Jan 22
in
Theory of Computation

65
views
theoryofcomputation
ricetheorem
decidability
1
answer
38
Simultaneous vs hierarchical Memory
comment edited
Jan 21
in
CO & Architecture

86
views
co&architecture
#computerorganisationandarchitecture
1
answer
39
Quantative Aptitude
$1+2*\frac{1}{2}+3*\frac{1}{2}^{2}+4*\frac{1}{2}^{3}+5*\frac{1}{2}^{4}$............ Please explain how is this equals to $(1\frac{1}{2})^{2}$
edited
Jan 21
in
Verbal Ability

112
views
aptitude
numericalability
1
answer
40
Floating Point Representation
Are the following statements true? 1. If Biased Exponent > Bias ,then Actual exponent is +ve. 2. If Biased Exponent < Bias ,then Actual exponent is ve. Please tell reason also,as per me both should be false as Biased is ... something to it will cause overflow.So 1st should be ve and second should be +ve,Please correct if I am wrong
asked
Jan 21
in
CO & Architecture

71
views
floatingpointrepresentation
ieeerepresentation
co&architecture
21,545
questions
26,881
answers
61,232
comments
23,243
users