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
+1
vote
0
answers
1
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
16 hours
ago
in
Databases

12
views
madeeasy_testseries
databases
sql
0
votes
0
answers
2
Equivalence and Emptiness problems in RE
asked
1 day
ago
in
Theory of Computation

9
views
theoryofcomputation
0
votes
1
answer
3
Doubt in GateCse Decidability Blog
asked
1 day
ago
in
Theory of Computation

23
views
decidability
theoryofcomputation
recursiverecursivelyenumerable
turingmachine
0
votes
1
answer
4
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
2 days
ago
in
Theory of Computation

23
views
decidability
theoryofcomputation
ric
0
votes
0
answers
5
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
3 days
ago
in
Theory of Computation

11
views
contextfree
rankofnonterminal
0
votes
1
answer
6
Pumping lemma for regular grammer
asked
3 days
ago
in
Theory of Computation

23
views
theoryofcomputation
lemma
pumping
pumpinglemma
+1
vote
0
answers
7
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
3 days
ago
in
Theory of Computation

25
views
theoryofcomputation
ricetheorem
decidability
+2
votes
0
answers
8
[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
3 days
ago
in
Theory of Computation

20
views
theoryofcomputation
decidability
0
votes
0
answers
9
[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
4 days
ago
in
Theory of Computation

8
views
theoryofcomputation
contextfree
cnf
derivationtree
0
votes
0
answers
10
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
4 days
ago
in
Theory of Computation

18
views
theoryofcomputation
decidability
0
votes
1
answer
11
DCFl Decidability
Under what operations DCFL is Not decidable?I
asked
4 days
ago
in
Theory of Computation

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

30
views
theoryofcomputation
finiteautomata
dfa
0
votes
1
answer
13
TOC Finite automata
If n state finite automata accespts infinite language then what is the length of min, and max. cycle?
asked
5 days
ago
in
Theory of Computation

49
views
theoryofcomputation
finiteautomata
dfa
0
votes
0
answers
14
TOC Pumping Lemma
In pumping lemma it says if there is a string whose length is >=N,where N is number of states in dfa,then language of machine is infinite,but there is one upper constraing also. 2N1>=W>=N Can anyone tell me about the use of 2N1 here ?
asked
5 days
ago
in
Theory of Computation

19
views
theoryofcomputation
pumpinglemma
pumping
lemma
0
votes
0
answers
15
TOC Grammers equivalence
Are the following two grammers equivalent? G1 :S> aS  e G2: S> aaS  e I was reading this question somewhere and it was written that second one is sentential form of first and they are equal,but i dont think so.Second one will generate only even a's but first one is generating every combination of a.Please help
asked
5 days
ago
in
Theory of Computation

18
views
theoryofcomputation
0
votes
0
answers
16
[DBMS]ME Test Series Schedule Classification
asked
6 days
ago
in
Databases

13
views
madeeasy_testseries
databases
0
votes
0
answers
17
Made Easy Test Series DBMS[SQL]
asked
Jan 9
in
Databases

52
views
databases
madeeasy_testseries
+1
vote
0
answers
18
DBMS Number of Serializable schedules
asked
Jan 8
in
Databases

27
views
databases
conflict_serializable
view_serializable
0
votes
1
answer
19
BCNF Decomposition
asked
Jan 8
in
Databases

45
views
databasenormalization
databases
functionaldependencies
bcnfdecomposition
+1
vote
1
answer
20
[DBMS] Time stamp Ordering Protocol
asked
Jan 8
in
Databases

69
views
databases
0
votes
2
answers
21
[DBMS Schedules] Lost update vs ww conflict
asked
Jan 7
in
Databases

47
views
databases
transactions
conflict_serializable
0
votes
1
answer
22
Avl vs btree
I know advantages of btree. But after reading that I want to ask in what aspect Avl trees are useful over b tree? Give some example please.
asked
Jan 7
in
Databases

29
views
databases
btree
+1
vote
1
answer
23
[DBMS] Position of Nulls using order by clause
asked
Jan 6
in
Databases

43
views
sql
databases
0
votes
1
answer
24
Natural vs conditional join dbms
asked
Jan 5
in
Databases

27
views
naturaljoin
databases
relationalalgebra
0
votes
1
answer
25
Dbms Joins
Joins and Cross products are associative or commutative?
asked
Jan 5
in
Databases

21
views
databases
dbms
+1
vote
2
answers
26
Primary keys Dbms
Is it possible for table to have more than one primary key? If no then why?
asked
Jan 4
in
Databases

37
views
databases
dbms
0
votes
1
answer
27
Computer Organization Floating Point representation
asked
Jan 4
in
CO & Architecture

30
views
floatingpointrepresentation
ieeerepresentation
digitallogic
co&architecture
0
votes
0
answers
28
[Doubt] William Stallings Computer Organization Chapter 6,P187,External Memory
asked
Jan 3
in
CO & Architecture

9
views
co&architecture
+2
votes
0
answers
29
Simultaneous vs Hierarchical Memory Access using Write back and Write through policy
asked
Jan 3
in
Study Resources

30
views
cachememory
#computerorganisationandarchitecture
co&architecture
+1
vote
1
answer
30
CO Cache Memory Access
In a certain system the main memory access time is 100 ns. The cache is 10 time faster than the main memory and uses the write though protocol. If the hit ratio for read request is 0.92 and 85% of the memory requests generated by the ... the average time consideration both read and write requests is a) 28.95ns b) 348.47ns c) 29.62ns d) 296.2ns
asked
Jan 3
in
CO & Architecture

52
views
cachememory
co&architecture
#computerorganisationandarchitecture
Page:
1
2
3
4
next »
18,813
questions
23,785
answers
51,449
comments
20,130
users