Questions by ♥_Less / GATE Overflow for GATE CSE

2 votes

2 answers

1

MadeEasy Test Series: Theory Of Computation
(a^n)^m b^n where n>=0 and m>1 is a) regular b) cfl c) csl d) none

(a^n)^m b^n where n>=0 and m>1 isa) regularb) cflc) csld) none

626 views

asked Jan 29, 2018

2 votes

0 answers

2

Relational algebra
I have two doubts: 1) A natural join B What will be the result when B don't have any tuple in it. Like in B their is relational algebra expression which is selecting Cars of green color but their is no green color car in table. What will be the ... B In above divison if B is a relational algebra expression returning nothing ( like the B in case 1). What will be the result ?

I have two doubts:1) A natural join B What will be the result when B don't have any tuple in it. Like in B their is relational algebra expression which is selecting Cars ...

439 views

asked Jan 14, 2018

1 votes

2 answers

3

Ace Test series: Operating System - Fork
What is the number of child process created ? Answer given was 63, BUT i am getting 9 !

What is the number of child process created ?Answer given was 63, BUT i am getting 9 !

1.8k views

asked Jan 12, 2018

2 votes

1 answer

4

implication VS conjunction
When should we use implication and when conjunction? For example in this question: https://gateoverflow.in/989/gate2006-26?show=188041#c188041 What is the difference in options B and D?

When should we use implication and when conjunction? For example in this question:https://gateoverflow.in/989/gate2006-26?show=188041#c188041What is the difference in opt...

1.0k views

asked Dec 31, 2017

1 votes

1 answer

5

Time complexity
Worst case time complexity of following code? Please explain in detail. void function(int n) { int count = 0; for (int i=0; i<n; i++) for (int j=i; j< i*i; j++) if (j%i == 0) { for (int k=0; k<j; k++) printf("*"); } }

Worst case time complexity of following code? Please explain in detail.void function(int n) { int count = 0; for (int i=0; i<n; i++) for (int j=i; j< i*i; j++) if (j%i ==...

4.5k views

asked Dec 4, 2017

4 votes

1 answer

6

MadeEasy Subject Test: Theory of Computation - Decidability
1) L is undecidable 2) L is decidable 3) L is regular 4) none Answer given: 1) undecidable My solution: Since L(M) is reducible to a CFL language and since all CFL are recursive that means language accepted by M is ... halts on all inputs so this language will too and answer should be decidable. How to approach this type of question ?

1) L is undecidable2) L is decidable3) L is regular4) none Answer given: 1) undecidableMy solution: Since L(M) is reducible to a CFL language and since all CFL are recurs...

748 views

asked Nov 30, 2017

1 votes

1 answer

7

Self doubt in terminologies and turing machine
1) I know that turing decidable means recursive language. But does is also means its decidable? So basically i want to know if REC imples decidability and RE implies undecidability or not. I got confused with word decidable in " ... same expressive power why can't we use DTM in NP decision problems? Thanks for being patient and reading doubt.

1) I know that turing decidable means recursive language. But does is also means its decidable? So basically i want to know if REC imples decidability and RE implies unde...

1.2k views

asked Nov 29, 2017

2 votes

0 answers

8

MadeEasy Subject Test: Theory of Computation - Pushdown Automata
The language {w| the length of w is odd and it's middle symbol is 0, Wε(0+1)*} Why do we need a PDA for above language. I don't think we need a PDA for this language. I wrote the following RE. Tell me whats ... ]+ + (other small left over strings like 0,101,100,001,000..... which are not covered in first part of expression)

The language {w| the length of w is odd and it's middle symbol is 0, Wε(0+1)*}Why do we need a PDA for above language. I don't think we need a PDA for this language. I w...

418 views

asked Nov 29, 2017

1 votes

0 answers

9

Data structure and algorithms by Weiss Mark Allen
Suppose T1(N) = O(f(N)) and T2(N) =O(f(N)). Which of the following are true? a) T1(N) + T2(N) = O(f(N)) b) T1(N) - T2(N) = o(f(N)) c) T1(N)/T2(N) = O(1) d) T1(N) = O(T2(N)) My solution: a) true. let f1=n^2 and f2= ... and f2 same as before. Then f1/f2=n ==> O(n). d) false. take f1 and f2 same as before. Then T1(n) = ω(T2(n)) Am i doing it right ?

Suppose T1(N) = O(f(N)) and T2(N) =O(f(N)). Which of the following are true?a) T1(N) + T2(N) = O(f(N))b) T1(N) - T2(N) = o(f(N))c) T1(N)/T2(N) = O(1)d) T1(N) = O(T2(N))My...

336 views

asked Nov 20, 2017

2 votes

1 answer

10

general conceptual question
Can split horizon alone prevent count to infinity problem or we must use poison reverse with split horizon ?

Can split horizon alone prevent count to infinity problem or we must use poison reverse with split horizon ?

844 views

asked Oct 8, 2017

1 votes

0 answers

11

gatequestions
How to solve turing machine decidable/undecidable questions ? Do I need to mug them up ?

How to solve turing machine decidable/undecidable questions ? Do I need to mug them up ?

338 views

asked Oct 6, 2017

0 votes

0 answers

12

made-easy
I tried to traverse from left to right depth first and evaluating semantic rules, but getting stuck when i reach " T'---> empty " As its semantic rule can't be evaluated at that point because T'.i value is still left to calculate. I think the question is wrong ? What you think ?

I tried to traverse from left to right depth first and evaluating semantic rules, but getting stuck when i reach " T' - empty " As its semantic rule can't be evaluated at...

480 views

asked Oct 3, 2017

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