Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Filter
tarunmaganti
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Questions by tarunmaganti
1
votes
2
answers
1
Tuple Relational Calculus - What is the difference between these two types of bounded variables in the expressions?
If there are three tables to choose from -Sailors(sid,sname); Reserves(sid,bid); Boats(bid,color)Question is to choose a sailor who reserved a red boat.My question is wha...
750
views
asked
Apr 15, 2018
Databases
tuple-relational-calculus
databases
relational-calculus
+
–
2
votes
1
answer
2
MadeEasy Test Series 2018: Databases - Er Diagram
$E_{11}\left (\underline AB \right )$ and $E_{12}\left (\underline {AC} \right )$ is obvious separation but can we not merge like this to satisfy 2NF $E_{11}R\left (\underline ABD \right )$ As $A$ is a primary key, apart from $A\rightarrow B$, $A\rightarrow D$ also satisfies because of full participation. What are the actual tables?
$E_{11}\left (\underline AB \right )$ and $E_{12}\left (\underline {AC} \right )$ is obvious separation but can we not merge like this to satisfy 2NF $E_{11}R\left (\unde...
597
views
asked
Jan 28, 2018
Databases
databases
er-
er-diagram
made-easy-test-series
+
–
1
votes
0
answers
3
What does h(L) = HALT mean or siginify?
While trying to understand homomorphism for recursive proof I came across the following link - https://courses.engr.illinois.edu/cs373/sp2013/Lectures/lec26.pdf Look for proposition 4. In the last point of the proof it is written that h(L) = HALT. What does it mean? ------------ ... $h(L) = HALT$ which is undecidable.
While trying to understand homomorphism for recursive proof I came across the following link - https://courses.engr.illinois.edu/cs373/sp2013/Lectures/lec26.pdfLook for p...
328
views
asked
Jan 23, 2018
Theory of Computation
homomorphism
turing-machine
+
–
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register