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 yes
0
votes
1
3nf decomposition
Consider R(ABCDEF) with following fd AB->CDEF C->A D->B C->D E->F B->E Decompose it into 3NF
Consider R(ABCDEF) with following fdAB->CDEFC->AD->BC->DE->FB->EDecompose it into 3NF
889
views
answered
Oct 19, 2015
28
votes
2
TIFR CSE 2011 | Part A | Question: 2
In how many ways can the letters of the word $\text{ABACUS}$ be rearranged such that the vowels always appear together? $\dfrac{(6+3)!}{2!}$ $\dfrac{6!}{2!}$ $\dfrac{3!3!}{2!}$ $\dfrac{4!3!}{2!}$ None of the above
In how many ways can the letters of the word $\text{ABACUS}$ be rearranged such that the vowels always appear together?$\dfrac{(6+3)!}{2!}$ $\dfrac{6!}{2!}$ $\dfrac{3!3!}...
1.5k
views
answered
Oct 15, 2015
Combinatory
tifr2011
combinatory
counting
+
–
1
votes
3
dijkstra's algo
688
views
answered
Oct 13, 2015
Algorithms
graph-algorithms
shortest-path
+
–
8
votes
4
Find number of variables in optimized code
Consider following 3 address code t1 = t+e t2 = g+a t3 = t1*t2 t4 = t2+t2 t5 = t4+t3 The minimum number of temporary variables that can be used in equivalent 3-address code of above code is Approach: t = t+e, g = g+a, t = t*g, g = g+g,t = t+g. Hence 4 temporary variables are needed. Is this right?
Consider following 3 address codet1 = t+et2 = g+at3 = t1*t2t4 = t2+t2t5 = t4+t3The minimum number of temporary variables that can be used in equivalent 3-address code of ...
2.4k
views
answered
Oct 12, 2015
Compiler Design
compiler-design
intermediate-code
three-address-code
+
–
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register