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
Questions by sripo
0
votes
0
answers
31
How much time does it take to solve every problem in the GO Book,all 3 volumes?
What should my strategy be now as I have to cover OS,DLD,Maths,CN and CO along with revision and taking full length tests. I really don’t know what to do about aptitude. Edit 1: Can people share strategies as to how to divide the syllabus and solve the problems.
What should my strategy be now as I have to cover OS,DLD,Maths,CN and CO along with revision and taking full length tests.I really don’t know what to do about aptitude....
1.6k
views
asked
Dec 6, 2018
GATE
syllabus
self-doubt
preparation
usergate2019
+
–
1
votes
1
answer
32
Feeling depressed and stressed out
I am stressed out sitting at home full time to study,I dont know if I am doing the right thing.Need counselling.Need to complete 4 subjects more.I feel like I have wasted alot of time in my bachelors.
I am stressed out sitting at home full time to study,I dont know if I am doing the right thing.Need counselling.Need to complete 4 subjects more.I feel like I have wasted...
974
views
asked
Dec 3, 2018
GATE
stress
counselling
exam-stress
+
–
0
votes
1
answer
33
Is the given schedule Recoverable
S=r1(A),w2(A),r3(A),w1(A),w3(A) Is this Schedule Non Recoverable? As there is a dirty read happening at w2(A)->r3(A)
S=r1(A),w2(A),r3(A),w1(A),w3(A)Is this Schedule Non Recoverable? As there is a dirty read happening at w2(A)->r3(A)
697
views
asked
Nov 25, 2018
Databases
databases
transaction-and-concurrency
dirty
recoverable
read
+
–
0
votes
0
answers
34
Does Dirty Read Imply Non Recoverable Schedule
If I have dirty read which is write-read conflict does it imply that the schedule is non recoverable? Do all anomalies result of conflict result in non recoverable thereby non serializable schedules?
If I have dirty read which is write-read conflict does it imply that the schedule is non recoverable?Do all anomalies result of conflict result in non recoverable thereby...
1.2k
views
asked
Nov 25, 2018
Databases
transaction-and-concurrency
databases
dirty
recoverable
read
+
–
0
votes
1
answer
35
Max heap when stored in an array is always in sorted order
This question is in CLRS,if we have a max heap it is always in sorted order(descending) order.And by extension if we have min heap the array is sorted in ascending order.Is this true? I have a counter example for ... it an heapified representation or not? If we heapify after deletion and store max deleted element then we get sorted array.
This question is in CLRS,if we have a max heap it is always in sorted order(descending) order.And by extension if we have min heap the array is sorted in ascending order....
2.7k
views
asked
Nov 15, 2018
DS
sorting
binary-heap
array
data-structures
algorithms
+
–
1
votes
1
answer
36
What is the value of T(n) for the given recurrence relation
T(n)=T(n/2)+2; T(1)=1 when n is power of 2 the correct expression for T(n) is: a) 2(logn+1) b) 2logn c)logn+1 d)2logn+1
T(n)=T(n/2)+2; T(1)=1when n is power of 2 the correct expression for T(n) is:a) 2(logn+1)b) 2lognc)logn+1d)2logn+1
1.6k
views
asked
Nov 14, 2018
Algorithms
recurrence-relation
algorithms
time-complexity
jest
+
–
0
votes
0
answers
37
Which colleges accept JEST TCS scores other than IMSc
Which programmes can I get into with my JEST score other than IMSc,can I get into CMI Data Science with my JEST TCS score,which exams can I write for CS in JEST?
Which programmes can I get into with my JEST score other than IMSc,can I get into CMI Data Science with my JEST TCS score,which exams can I write for CS in JEST?
1.1k
views
asked
Nov 14, 2018
Other Colleges
non-gate
admission
general
+
–
0
votes
0
answers
38
List of MTech Exams after GATE
This can be a duplicate question please give me a link of the exams along with when in the date of registration so that I don't miss the dates.I am aware that TIFR happens before GATE,but other institute exams after gate.
This can be a duplicate question please give me a link of the exams along with when in the date of registration so that I don't miss the dates.I am aware that TIFR happen...
1.6k
views
asked
Nov 14, 2018
GATE
iit
iisc
gate-preparation
cmi
isi
bits
+
–
2
votes
1
answer
39
If grammar is not LL(1) then it can never be CLR(1) or LALR(1)?
Can you give an example which is not LL(1) but is CLR(1)
Can you give an example which is not LL(1) but is CLR(1)
3.2k
views
asked
Nov 10, 2018
Compiler Design
compiler-design
lr-parser
parsing
grammar
ll-parser
+
–
0
votes
0
answers
40
Solving previous years gate questions multiple times
Is it a good idea to solve previous years gate questions multiple times as with time you get more awareness of certain topics and you can use different approaches to solve the problems.I have only Completed TOC,CD,DAA,DSC till now what should I do?Is there enough time for all this?
Is it a good idea to solve previous years gate questions multiple times as with time you get more awareness of certain topics and you can use different approaches to solv...
414
views
asked
Nov 9, 2018
GATE
gate-preparation
+
–
0
votes
1
answer
41
How to understand difference between n/2 and log(n) when comes to operations on a binary tree
For a heap containing n elements,smallest element can be found in n/2 operations.I always get confused and think as logn operations.Please help me differentiating between these two times.
For a heap containing n elements,smallest element can be found in n/2 operations.I always get confused and think as logn operations.Please help me differentiating between...
668
views
asked
Nov 8, 2018
DS
data-structures
binary-tree
binary-heap
+
–
0
votes
0
answers
42
RE for given FA
The correct regular expression for the below mentioned Finite Automata Do we have to have ca* as C is dead state,does dead state be a part of regular expression? The expression I am gettting is c*a(d*+ba*) as C state is dead state hence no need to consider it.Please Correct me.
The correct regular expression for the below mentioned Finite Automata Do we have to have ca* as C is dead state,does dead state be a part of regular expression?The expre...
535
views
asked
Nov 6, 2018
Theory of Computation
theory-of-computation
finite-automata
regular-expression
regular-language
+
–
1
votes
0
answers
43
Time Complexity for an infinite loop
What is the time complexity for infinite loops Question 1 what is T(n) for this case While(1) { a=a+b; } Question 2 for this case if(1) { for i to n a=a+b } else { for i to n for j to n a=a+b } Edit 2: Compiled the code ... ); return 0; } output I get is 8 6 which means the else case is never executed hence in worst case do we have to consider the else part.
What is the time complexity for infinite loopsQuestion 1 what is T(n) for this caseWhile(1){a=a+b;} Question 2 for this caseif(1){for i to na=a+b}else{for i to nfor j to...
2.0k
views
asked
Nov 6, 2018
Algorithms
algorithms
time-complexity
asymptotic-notation
space-complexity
+
–
0
votes
1
answer
44
Are these two languages equal?
L1=ab* L2=a(aa)*b(bb)* Are the languages equal if not what relation do they satisfy?
L1=ab*L2=a(aa)*b(bb)*Are the languages equal if not what relation do they satisfy?
571
views
asked
Nov 6, 2018
Theory of Computation
theory-of-computation
regular-language
regular-grammar
+
–
1
votes
1
answer
45
What is the minimal DFA for this language (11+111)*, for Σ={0,1}.
What is the number of states for the above DFA,please draw NFA,DFA and minimised DFA for the same.Also won't the language not accept epsilon?
What is the number of states for the above DFA,please draw NFA,DFA and minimised DFA for the same.Also won't the language not accept epsilon?
3.0k
views
asked
Nov 6, 2018
Theory of Computation
theory-of-computation
minimal-state-automata
regular-expression
finite-automata
+
–
0
votes
1
answer
46
Number of sub-strings for a given sub string having repeated symbols
Lets for a a given string aabbbccdd I need to find the number of substrings possible how to go about it? Does the n(n+1)/2 formula work here also?
Lets for a a given string aabbbccddI need to find the number of substrings possible how to go about it? Does the n(n+1)/2 formula work here also?
2.7k
views
asked
Nov 5, 2018
Theory of Computation
combinatory
counting
theory-of-computation
algorithms
finite-automata
+
–
1
votes
1
answer
47
Runtime Environment Heap Allocation
Does Heap Allocation support both recursion and dynamic memory allocation? Because,a stack can be implemented using dynamic memory allocation.Please correct me. Test Series answer shows only dynamic memory allocation
Does Heap Allocation support both recursion and dynamic memory allocation? Because,a stack can be implemented using dynamic memory allocation.Please correct me.Test Serie...
2.1k
views
asked
Nov 3, 2018
Compiler Design
compiler-design
runtime-environment
activation-record
descriptive
+
–
1
votes
1
answer
48
Are right recursive grammars ambiguous?
Are right recursive grammars ambiguous?
Are right recursive grammars ambiguous?
926
views
asked
Nov 2, 2018
Compiler Design
compiler-design
parsing
+
–
0
votes
2
answers
49
Is the given grammar CLR(1) or not please explain me if there is a shift reduce conflict
S→(X S→E] S→E) X→E) X→E] E→ϵ Is this grammar CLR(1)? The answer says it is but I find a shift reduce conflict for E-> epsilon with lookup symbols ),]
S→(XS→E]S→E)X→E)X→E]E→ϵIs this grammar CLR(1)? The answer says it is but I find a shift reduce conflict for E- epsilon with lookup symbols ),]
2.4k
views
asked
Nov 1, 2018
Compiler Design
compiler-design
parsing
lr-parser
descriptive
+
–
0
votes
1
answer
50
Is there shift reduce conflict in this production?
For given production for a LR(1) grammar B->b.C ,$|c here C is non terminal C->c. ,$|c and here c is terminal. $|c are lookup symbols Will there be a shift reduce conflict if a non terminal is visited.Please explain how shift reduce conflict works
For given production for a LR(1) grammarB->b.C ,$|c here C is non terminalC->c. ,$|c and here c is terminal. $|c are lookup symbolsWill there be a shift reduce conflict...
539
views
asked
Nov 1, 2018
Compiler Design
compiler-design
parsing
lr-parser
+
–
Page:
« prev
1
2
3
4
next »
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register