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 ronak.ladhar
0
votes
1
Static Single Assignment
Definition of Static Single Assignment Static single-assignment form arranges for every value computed by a program to have a unique assignment (aka, “definition”) but p3 = a - b q4 = p3 * c p4 = u * v q5 = p4 + q4 is an valid example of SSA Now, tell me a,b,c,u,v are not assigned or previously recognized Then how this is a valid example of SSA? for ref see here
Definition of Static Single AssignmentStatic single-assignment form arranges for every value computed by a program to have a unique assignment (aka, “definition”)but ...
566
views
answered
Dec 31, 2020
Compiler Design
compiler-design
static-single-assignment
+
–
0
votes
2
#of variables in SSA
Consider the following code segment: c=b+a e=c-a f=c*e h=c+a i=h+f The minimum number of $\color{blue} {total}$ and $\color{blue} {temporary }$ variable required to convert the above code segment to static single assignment form are ________
Consider the following code segment:c=b+ae=c-af=c*eh=c+ai=h+f The minimum number of $\color{blue} {total}$ and $\color{blue} {temporary }$ variable required to convert t...
1.9k
views
answered
Dec 31, 2020
Compiler Design
compiler-design
static-single-assignment
+
–
0
votes
3
MadeEasy Subject Test: Theory of Computation - Decidability
Consider the following languages : L1 : {< M, q >|M is a Turing Machine that visits state q on some input within 15 steps}. L2 : {< M >|M is a Turing Machine, |M|< 200 where |M|is number of states in machine}. Which of the following is decidable please explain decidability for L1
Consider the following languages :L1 : {< M, q >|M is a Turing Machine that visits state q on some input within 15 steps}.L2 : {< M >|M is a Turing Machine, |M|< 200 wher...
573
views
answered
Nov 4, 2020
Theory of Computation
made-easy-test-series
theory-of-computation
decidability
+
–
0
votes
4
GATE2017 CE-2: GA-3
Four cards lie on table. Each card has a number printed on one side and a colour on the other. The faces visible on the cards are $2,3,$ red, and blue. Proposition: If a card has an even value on one side, then its opposite face is red. The card which MUST be turned over to verify the above proposition are $2,$ red $2,3,$ red $2,$ blue $2,$ red, blue
Four cards lie on table. Each card has a number printed on one side and a colour on the other. The faces visible on the cards are $2,3,$ red, and blue.Proposition: If a c...
3.2k
views
answered
Oct 24, 2020
Analytical Aptitude
gate2017-ce-2
logical-reasoning
propositional-logic
+
–
0
votes
5
Computer Organization
Consider the following program segment used to execute on a hypothetical processor. Consider all the registers are of 16 bit size I1 MOV CX,0005 ; CX ← 0005 I2 MOV BX,OFF7H ; BX ← OFF7H I3 MOV AX,OBCAH ; AX ← OBCAH I4 OR BX,AX ; BX ← ... 4 cycles and transfer of control operations takes 2 cycles to execute. How much time is required to execute the program on a above CPU?
Consider the following program segment used to execute on a hypothetical processor. Consider all the registers are of 16 bit sizeI1 MOV CX,0005 ; CX ← 0005I2 MOV BX,OFF...
2.3k
views
answered
Oct 16, 2020
CO and Architecture
co-and-architecture
machine-instruction
instruction-format
+
–
2
votes
6
NIELIT 2016 MAR Scientist B - Section C: 19
If there is in NP-Complete language L whose complement is in NP, then complement of any language in NP is in P NP both (A) and (B) None of these
If there is in NP-Complete language L whose complement is in NP, then complement of any language in NP is inPNPboth (A) and (B)None of these
1.7k
views
answered
Sep 18, 2020
Theory of Computation
nielit2016mar-scientistb
theory-of-computation
p-np-npc-nph
+
–
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register