Register
Filter

Answers by Aboveallplayer

0 votes
151
Equivalency of diffetent automata
Write about the equivalency of different automata such as DFA, NFA, DPDA, NPDA, DTM, NTM. Which automata or machine can be converted to other machines and why? For example NFA can be converted to DFA, DPDA, NPDA, DTM, NTM.
Write about the equivalency of different automata such as DFA, NFA, DPDA, NPDA, DTM, NTM. Which automata or machine can be converted to other machines and why? For exampl...
1 votes
152
Subset sum problem
Brute force algorithm time complexity for subset sum problem a) O(N logN) b)O(N^2) c) O(N^2 logN) d) O(2^N)
Brute force algorithm time complexity for subset sum problema) O(N logN) b)O(N^2) c) O(N^2 logN) d) O(2^N)
5 votes
153
#self doubt
LRTF ( LONGEST REMAINING TIME FIRST ALGORITHM ) causes starvation or not. please explain.
LRTF ( LONGEST REMAINING TIME FIRST ALGORITHM ) causes starvation or not. please explain.
1 votes
154
Number of secondary indices that can be constructed
If a file consists of 5 attributes, then the number of secondary indices that can be constructed on that file is ______.
If a file consists of 5 attributes, then the number of secondary indices that can be constructed on that file is ______.
1 votes
156
Process Synchronisation
Does every strict alteration method dissatisfy Progress condition?
Does every strict alteration method dissatisfy Progress condition?
0 votes
158
Solve using Master's theorem
Solve this recurrence equation using Master's theorem T(n) = 64 T(n/8) - n 2 log n
Solve this recurrence equation using Master's theoremT(n) = 64 T(n/8) - n 2 log n
1 votes
159
#Algo
On which of the following recurrence relation Master Theorem cannot be applied? A. T(n)=2T(n/2)+nlogn B. T(n)=T(n/2)+1 C. T(n)=8T(n/2)+logn D. T(n)=7T(n/4)+n2 I think we can apply on all. But plz correct me with reason.Thanks
On which of the following recurrence relation Master Theorem cannot be applied?A. T(n)=2T(n/2)+nlognB. T(n)=T(n/2)+1C. T(n)=8T(n/2)+lognD. T(n)=7T(n/4)+n2I think we can a...
1 votes
161
#algorithm
Can Prim's and Kruskal's algorithm yield different minimum spanning trees? Explain why or why not.
Can Prim's and Kruskal's algorithm yield different minimum spanning trees? Explain why or why not.
0 votes
162
mathematics
0 votes
164
ER-Model
1 votes
165
number of WAR dependencies
Consider the following instructions. $I_1:R_1=100$ $I_2:R_1=R_2+R_4$ $I_3:R_2=R_4+25$ $I_4:R_4=R_1+R_3$ $I_5:R_1=R_1+30$ Calculate sum of ($\text{WAR, RAW and WAW}$) dependencies the above instructions. $10$ $12$ $6$ $8$
Consider the following instructions.$I_1:R_1=100$$I_2:R_1=R_2+R_4$$I_3:R_2=R_4+25$$I_4:R_4=R_1+R_3$$I_5:R_1=R_1+30$Calculate sum of ($\text{WAR, RAW and WAW}$) dependenci...
0 votes
166
vgate
explain
explain
0 votes
167
Memory-Control Unit
If size of MAR &MBR are $32$ bit and $16$ bit respectively then what is the main memory size. if memory is byte addressable .
If size of MAR &MBR are $32$ bit and $16$ bit respectively then what is the main memory size.if memory is byte addressable .
1 votes
168
Doubt
Min number of registers required to evaluate below expression: x = ( a+b) * (c+d) I am getting 2 but answer is 3. Solution: 1) Load r1,a 2) Add r1, b 3) Load r2, c 4) Add r2,d 5) Mul r1,r2 6) store x, r1
Min number of registers required to evaluate below expression:x = ( a+b) * (c+d)I am getting 2 but answer is 3.Solution: 1) Load r1,a2) Add r1, b3) Load r2, c4) Add r2,d5...
0 votes
170
ace/practice
main() { int n=2; int i; for(i=0;i<n;i++) if(fork()==0) printf("hellow"); } how many times is "hellow " printed ?
main(){ int n=2;int i;for(i=0;i<n;i++)if(fork()==0)printf("hellow");}how many times is "hellow " printed ?
1 votes
172
Graph
Is the topic "Planarity" there in GATE 2017 syllabus?
Is the topic "Planarity" there in GATE 2017 syllabus?
1 votes
174
ADA
Arrange them in order of asymptotic growth rate N^2,n!/logn,(1+1/n)^n,(logn)^logn,N^(loglogn),3^log2
Arrange them in order of asymptotic growth rateN^2,n!/logn,(1+1/n)^n,(logn)^logn,N^(loglogn),3^log2
0 votes
175
B tree
What is degree in Btree and how it is diffrent from order of tree
What is degree in Btree and how it is diffrent from order of tree
3 votes
176
#aptitude
foreign bank have stopped ________ in india a. to open b. for opening c. opening d open
foreign bank have stopped ________ in indiaa. to openb. for openingc. openingd open
0 votes
177
#co
plz explain synonyms and homonyms problems in cache addressing and how to solve these problems ?? If possible by numerical example ??
plz explain synonyms and homonyms problems in cache addressing and how to solve these problems ??If possible by numerical example ??
Page: