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
Recent activity by tarunmaganti
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...
778
views
answer selected
Apr 11, 2019
Databases
tuple-relational-calculus
databases
relational-calculus
+
–
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...
635
views
answer selected
Mar 28, 2018
Databases
databases
er-
er-diagram
made-easy-test-series
+
–
2
answers
3
How many states in finite automata for the expression L={a^n, where n is a finite number}.
I know that for L={a^n, n>=0}, there would be 2 states in DFA because there is no restriction on the value of n. However, what would be the no of states when n is restricted to a finite value, such as 1000 or 10000? And how feasible would it be to construct such a DFA?
I know that for L={a^n, n>=0}, there would be 2 states in DFA because there is no restriction on the value of n. However, what would be the no of states when n is restric...
1.6k
views
commented
Jan 28, 2018
Theory of Computation
finite-automata
minimal-state-automata
theory-of-computation
+
–
2
answers
4
Concatenation: REG / REC / DCFL / CFL?
Let A is the language where no of 'a' is greater than no of 'b' and B is the language where no of 'b' is greater than no of ‘a’ the language A.B is ______________ a. Regular b. DCFL but not Regular c. CFL but not DCFL d. REC but not DCFL
Let A is the language where no of 'a' is greater than no of 'b' and B is the language where no of 'b' is greater than no of ‘a’ the language A.B is ______________a. R...
1.2k
views
commented
Jan 28, 2018
Theory of Computation
theory-of-computation
regular-expression
dcfl
context-free-language
+
–
1
answer
5
Doubt Threads Scheduling
How are user level threads scheduled?
How are user level threads scheduled?
654
views
answered
Jan 28, 2018
Operating System
operating-system
threads
process-scheduling
+
–
0
answers
6
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...
336
views
asked
Jan 23, 2018
Theory of Computation
homomorphism
turing-machine
+
–
2
answers
7
Does Deadlock imply no Bounded waiting Or no Progress or BOTH of These?
Does Deadlock imply no Bounded waiting Or no Progress or BOTH of These?Also provide explanation in support
Does Deadlock imply no Bounded waiting Or no Progress or BOTH of These?Also provide explanation in support
6.8k
views
commented
Jan 20, 2018
Operating System
deadlock-prevention-avoidance-detection
process-synchronization
+
–
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register