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.
Questions 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
0
votes
1
answer
1
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
+3
votes
1
answer
2
Digital ECE Gate 2017 Set 1
asked
Feb 9
in
Digital Logic

226
views
digitallogic
+1
vote
2
answers
3
Gate ECE GA 2017
asked
Feb 8
in
Numerical Ability

720
views
aptitude
speeddistance
0
votes
1
answer
4
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
asked
Feb 4
in
Set Theory & Algebra

48
views
discretemathematics
graphconnectivity
+1
vote
2
answers
5
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?
asked
Feb 4
in
Set Theory & Algebra

118
views
discretemathematics
groups
+1
vote
2
answers
6
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?
asked
Feb 3
in
Mathematical Logic

136
views
combinatory
permutation
+1
vote
0
answers
7
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
0
votes
0
answers
8
[Computer Network] Sliding window General doubt Tanenbaum p333
asked
Jan 26
in
Computer Networks

44
views
computernetworks
slidingwindow
+1
vote
3
answers
9
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?
asked
Jan 26
in
Probability

135
views
probability
engineeringmathematics
0
votes
0
answers
10
[Computer Networks] Slow and start Throughput
asked
Jan 23
in
Computer Networks

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

23
views
computernetworks
network
+1
vote
1
answer
12
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
0
votes
1
answer
13
Simultaneous vs hierarchical Memory
asked
Jan 21
in
CO & Architecture

86
views
co&architecture
#computerorganisationandarchitecture
+2
votes
1
answer
14
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}$
asked
Jan 21
in
Verbal Ability

112
views
aptitude
numericalability
+1
vote
1
answer
15
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
0
votes
0
answers
16
Computer Networks Supernetting
Like in subnetting we subtract 2 from number of hosts because these ae reserved for DBA/Network id. Now when we do supernetting,we dont subtract 2,Like if i say i have supernet which is been made of 4 smaller networks each ... does this happens as we dont have separate DBA id and small super net id? Am i missing somewhere,please explain
asked
Jan 20
in
Computer Networks

43
views
computernetworks
network
0
votes
0
answers
17
General Aptitude ME Test Series
asked
Jan 20
in
Verbal Ability

25
views
madeeasy_testseries
0
votes
0
answers
18
Numerical Aptitude ME TestSeries
asked
Jan 19
in
Verbal Ability

105
views
madeeasy_testseries
numericalability
+1
vote
1
answer
19
ME Test Series SQL
Can anyone tell why 1st is not correct? My approach:When we will join drinker and bar,we will get tuples of the drinker and the bar corresponding to his/her city.One tuple per drinker will come.Then we will join this with frequent ,the ... have one tuple,so that will be matched at max. one tuple only.And we project drinker's name. What did i miss?
asked
Jan 16
in
Databases

66
views
madeeasy_testseries
databases
sql
0
votes
0
answers
20
Equivalence and Emptiness problems in RE
asked
Jan 15
in
Theory of Computation

19
views
theoryofcomputation
0
votes
2
answers
21
Doubt in GateCse Decidability Blog
asked
Jan 15
in
Theory of Computation

78
views
decidability
theoryofcomputation
recursiverecursivelyenumerable
turingmachine
0
votes
1
answer
22
TOC Decidability
Are the following problems decidable? 1.{⟨M⟩∣M is a TM and there exist an input whose length is less than 100, on which M halts} I think we can simulate all the combinations of strings whose length is less than 100,and if the machine ... are not accepted by machine,Can it hang the machine?Is it also RE but NOT REC Please correct if I am going wrong
asked
Jan 14
in
Theory of Computation

61
views
decidability
theoryofcomputation
ric
0
votes
0
answers
23
TOC Rank of non terminal
S > aA A>BC B>bAd Answer given is 2.Do I need to remove useless production also for finding rank?I know we need to convert to CNF,but CNF requires to remove null production and unit production and then conver to A>BCa form.But what about useless production,if I take this production then answer is 3 else 2. Please help
asked
Jan 13
in
Theory of Computation

33
views
contextfree
rankofnonterminal
0
votes
1
answer
24
Pumping lemma for regular grammer
asked
Jan 13
in
Theory of Computation

48
views
theoryofcomputation
lemma
pumping
pumpinglemma
+1
vote
0
answers
25
Rice theorem Clarification
I need to understand when to apply RICE's theorem and when to not. Questions like: Turing machine makes at least five moves,It accepts a string input of length atleast five ,TM halts for every input on length <50 are all ... will say yes and some will say NO.Then why can't we use same concept on above metioned questions? Please help
asked
Jan 13
in
Theory of Computation

66
views
theoryofcomputation
ricetheorem
decidability
+2
votes
0
answers
26
[TOC] Reduction theorem
If P1<=P2 means P1 is reducible to p2,then which is true? 1, If P1 is RE But Not REC,P2 is also RE but not REC? 2. If P2 is RE But Not REC,P1 is also RE but not REC? As per my ... Please help Edit: As a part of this solution please tell me,whether undecidable includes semidecidable also?And whether semidecidable includes decidable also?
asked
Jan 13
in
Theory of Computation

36
views
theoryofcomputation
decidability
0
votes
0
answers
27
[TOC] CNF Tree Depth
1. Assume that we have CNF tree of depth of h(Assume root at height 0).What is the maximum yeild possible in terms of h? 2. Assume that we have a string of length n,what is the min and max height of parse tree possible in CNF. Please explain
asked
Jan 12
in
Theory of Computation

37
views
theoryofcomputation
contextfree
cnf
derivationtree
0
votes
0
answers
28
Decidability in CFG
As we know that equivalence in CSL is undecidable,so if i want to look for Nonequivalence,then will it be complement of this and answer will be NOT RE or will it be RE BUT NOT REC. Similarly for disjointness test,if i say i want to see if some string is common in two CFG,will it be RE BUT NOT REC or NOT RE
asked
Jan 12
in
Theory of Computation

66
views
theoryofcomputation
decidability
0
votes
1
answer
29
DCFl Decidability
Under what operations DCFL is Not decidable?I
asked
Jan 12
in
Theory of Computation

59
views
decidability
+1
vote
1
answer
30
[TOC] Finite automata Infinite language
asked
Jan 12
in
Theory of Computation

55
views
theoryofcomputation
finiteautomata
dfa
Page:
1
2
3
4
next »
21,545
questions
26,881
answers
61,232
comments
23,243
users