Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Filter
Profile
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Answers by Sasta_yoda
2
votes
1
#TOC #RegularLanguages
Are regular languages closed under intersection?
Are regular languages closed under intersection?
449
views
answered
Jan 29, 2019
Theory of Computation
theory-of-computation
+
–
1
votes
2
#ReferenceBook #FutureProspect
Which reference book you guys use for Compiler Design? What are the research prospect in this domain?
Which reference book you guys use for Compiler Design?What are the research prospect in this domain?
284
views
answered
Jan 28, 2019
Compiler Design
compiler-design
reference-book
+
–
0
votes
3
General doubt
i wanted to ask that i have all the material for gate. But the question bank which i have(apart from the previous years) does not have answer key. Is it okay to solve questions without an answer key with your college faculty's help? Or should i purchase a fresh postal material?
i wanted to ask that i have all the material for gate. But the question bank which i have(apart from the previous years) does not have answer key. Is it okay to solve que...
347
views
answered
Jan 28, 2019
0
votes
4
Find the language
Regural CFL CSL Recursive
ReguralCFLCSLRecursive
314
views
answered
Jan 28, 2019
0
votes
5
Doubt
What is the exact definition of full and complete binary tree? And what is the relation between them.
What is the exact definition of full and complete binary tree? And what is the relation between them.
251
views
answered
Jan 27, 2019
0
votes
6
aptitude questions resource
where can i get the collection of previous year aptitude questions of all branches to practice? is there any resource available?
where can i get the collection of previous year aptitude questions of all branches to practice?is there any resource available?
419
views
answered
Jan 24, 2019
Quantitative Aptitude
general-aptitude
+
–
1
votes
7
Class of language
Please suggest me in briefly for revision . How to we test regular,dcfl,cfl,recursive and recursive enumeranle. Eg say if we can find the pattern it's regular. Please help
Please suggest me in briefly for revision .How to we test regular,dcfl,cfl,recursive and recursive enumeranle.Eg say if we can find the pattern it's regular.Please help...
307
views
answered
Jan 24, 2019
Theory of Computation
theory-of-computation
identify-class-language
+
–
0
votes
8
Admit eligibility
Hey.. I am B.E CSE passed out student 2018 from University of Pune ..I have aggregate 54.60 %.. Should I prepare for gate 2020 or not? In this percentage , should I get iit,iisc or not? Any guidance please
Hey..I am B.E CSE passed out student 2018 from University of Pune ..I have aggregate 54.60 %.. Should I prepare for gate 2020 or not?In this percentage , should I get iit...
242
views
answered
Jan 23, 2019
1
votes
9
turing machine
can we have a turing machine which has only one state ? or the minimum number of state for a turing machine is 2?
can we have a turing machine which has only one state ?orthe minimum number of state for a turing machine is 2?
2.2k
views
answered
Jan 23, 2019
0
votes
10
ME T1
Let S be a binary semaphore variable and value of S = 0 what will be the value of S when following operations are executed on semaphore S ________. 2P, 4V, 5P, 2P, 8V, 3P, 2V (Here P and V are usual semaphore operations)
Let S be a binary semaphore variable and value of S = 0 what will be the value of S when followingoperations are executed on semaphore S ________. ...
854
views
answered
Jan 23, 2019
1
votes
11
Context Free Languages
What is the difference between regular intersection and intersection? (I found out that CFL is closed under regular intersection but not under intersection) Thanks!
What is the difference between regular intersection and intersection?(I found out that CFL is closed under regular intersection but not under intersection)Thanks!
359
views
answered
Jan 22, 2019
Theory of Computation
context-free-language
theory-of-computation
+
–
0
votes
12
Cfg to and from pda
Do i have to study the conversation of pda to Cfg or cfg to pda? Is this an important concept with relevance to gate? I know how to individually make them though.
Do i have to study the conversation of pda to Cfg or cfg to pda? Is this an important concept with relevance to gate? I know how to individually make them though.
936
views
answered
Jan 21, 2019
Theory of Computation
context-free-language
pushdown-automata
+
–
1
votes
13
compiler phase error
int main(){ int a = 10; fun(a); } void fun(int a){ printf(“%d”,a); } Which phase of the compiler will raise an error? Lexical syntax semantics none of the above
int main(){int a = 10;fun(a);}void fun(int a){printf(“%d”,a);}Which phase of the compiler will raise an error?Lexical syntaxsemanticsnone of the above
1.0k
views
answered
Jan 21, 2019
Compiler Design
compiler-design
programming-in-c
+
–
2
votes
14
SelfDoubt
True/False SJF and SRTF both suffer from Convoy effect. please tell reason.
True/FalseSJF and SRTF both suffer from Convoy effect.please tell reason.
577
views
answered
Jan 21, 2019
0
votes
15
Self doubt
How many tokens in this a>>=1; and a! , Will >>= and a! be treated as a single token ?
How many tokens in thisa>>=1;and a! , Will >>= and a! be treated as a single token ?
1.8k
views
answered
Jan 21, 2019
Compiler Design
compiler-design
lexical-analysis
+
–
1
votes
16
made easy mock 2
consider the language L= {$x^{l}y^{m}z^{n}$|(l+m+n) is divisible by 5} which of the following is correct? L is recursive CSL CFL regular
consider the language L= {$x^{l}y^{m}z^{n}$|(l+m+n) is divisible by 5}which of the following is correct?L is recursiveCSLCFLregular
541
views
answered
Jan 21, 2019
1
votes
17
Gateforum Test Series: Set Theory & Algebra - Sets
444
views
answered
Jan 13, 2019
Set Theory & Algebra
gateforum-test-series
set-theory&algebra
set-theory
+
–
0
votes
18
Gateforum Test Series: Operating System - Virtual Memory
In a demand paging system page fault rate 0.60 and page fault service time 8 milliseconds, memory access time 200 nano seconds. Find out effective access time in nano seconds.
In a demand paging system page fault rate 0.60 and page fault service time 8 milliseconds, memory access time 200 nano seconds. Find out effective access time in nano sec...
501
views
answered
Jan 13, 2019
Operating System
gateforum-test-series
operating-system
virtual-memory
+
–
0
votes
19
ALGORITHMS
Is straight merge sort in gate syllabus?? If yes, where to study from?
Is straight merge sort in gate syllabus?? If yes, where to study from?
273
views
answered
Sep 16, 2018
Algorithms
sorting
merge-sort
syllabus
+
–
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register