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 Ankita87077
0
votes
1
answer
1
Demand Paging
Is this statement correct? " Demad paging can bring entire process into memory at load time" How it is correct? If it is, then anybody can explain it please.
Is this statement correct? " Demad paging can bring entire process into memory at load time"How it is correct? If it is, then anybody can explain it please.
1.2k
views
asked
Dec 6, 2021
Operating System
made-easy-test-series
+
–
2
votes
1
answer
2
Made Easy test series
int a = 50, b = 50; a = a+++++b; b = b+++++a; Value of b after executing these . I think it should be undefined behaviour. But in answer it is given 155. Can anybody verify it please.
int a = 50, b = 50;a = a+++++b;b = b+++++a; Value of b after executing these .I think it should be undefined behaviour. But in answer it is given 155. Can anybody verify ...
585
views
asked
Dec 2, 2021
Programming in C
made-easy-test-series
programming-in-c
bad-question
+
–
0
votes
0
answers
3
DAG ( compiler Design)
How Directed acyclic graph would be constructed for this instruction? b[j] = a ;
How Directed acyclic graph would be constructed for this instruction?b[j] = a ;
594
views
asked
Oct 28, 2021
Compiler Design
compiler-design
directed-acyclic-graph
+
–
1
votes
1
answer
4
Directed acyclic graph
Consider the following three address code: T1= a+b T2= c+d T3=a-b T4= T1+T3 T5= T2+T1 T6 = T5+T4 T7 = c + T6 Number of nodes and edges in DAG of the above code? If we'll do simplification , then T4 would be T4 = a+b+a-b => a+a , after this simplification T3 is not used anywhere in the program, so it can be eliminated or we'll include it in DAG??
Consider the following three address code:T1= a+bT2= c+dT3=a-bT4= T1+T3T5= T2+T1T6 = T5+T4T7 = c + T6Number of nodes and edges in DAG of the above code?If we'll do simpli...
1.1k
views
asked
Oct 27, 2021
Compiler Design
compiler-design
intermediate-code
three-address-code
+
–
1
votes
1
answer
5
Compiler Design (register allocation)
In such questions, In which it is asked " minimum number of registers required for executing this three address code without spilling", can we apply code motion optimization or not? As in a question of made easy test series : T1 = a; ... = R1} So,which one is correct, made easy one or second one applying code motion? Can anybody please clarify this.
In such questions, In which it is asked " minimum number of registers required for executing this three address code without spilling", can we apply code motion optimizat...
551
views
asked
Oct 27, 2021
Compiler Design
compiler-design
intermediate-code
three-address-code
made-easy-test-series
+
–
0
votes
1
answer
6
LR(k) and CFL
I am quite confused in this . I have seen in many answers related to LR(k), that DCFL have one to one correspondence with LR(k) grammars. Means if a language is DCFL then it would definitely have a LR(k) grammar and if there is an LR(k) ... any ncfl. So, how for some unambiguous ncfl there exists an LR(k) grammar??? Please someone can provide a correct argument regarding this.
I am quite confused in this . I have seen in many answers related to LR(k), that DCFL have one to one correspondence with LR(k) grammars. Means if a language is DCFL then...
634
views
asked
Sep 19, 2021
0
votes
1
answer
7
CFL or DCFL?
Is the language L = {a^nb^m : n = m or n = m + 2} deterministic? Please anybody can clarify it.
Is the language L = {a^nb^m: n = m or n = m + 2} deterministic? Please anybody can clarify it.
285
views
asked
Sep 17, 2021
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register
