Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Filter
Deepthi_ts
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Questions by Deepthi_ts
9
votes
2
answers
1
# DBMS #Normalization
IF a relation R(A,B,C,D,E) where AB is the key and ADE->C so is this in 2NF or not? Do Partial dependency exist??? because C is derived from ADE (A is part of key AB)
IF a relation R(A,B,C,D,E) whereAB is the key andADE->Cso is this in 2NF or not?Do Partial dependency exist??? because C is derived from ADE (A is part of key AB)
575
views
asked
Apr 26, 2017
Databases
databases
database-normalization
+
–
0
votes
0
answers
2
#isro 2007 Q32 # Logic
224
views
asked
Apr 25, 2017
3
votes
1
answer
3
#theory of computation #DFA #NFA
Consider regular expression r, where r = (11 + 111)* over Ʃ = {0, 1}. Number of states in minimal NFA and DFA respectively are: A NFA – 3, DFA – 4 B NFA – 3, DFA – 3 C NFA – 3, DFA – 3 D NFA – 4, DFA – 4
Consider regular expression r, where r = (11 + 111)* over Ʃ = {0, 1}. Number of states in minimal NFA and DFA respectively are:ANFA – 3, DFA – 4BNFA – 3, DFA – 3...
4.1k
views
asked
Apr 17, 2017
Theory of Computation
theory-of-computation
number-of-dfa
finite-automata
+
–
1
votes
2
answers
4
#theory of computation # turing machine
Suppose M1 and M2 are two TM’s such that L(M1) = L(M2). Then A On every input on which M1 doesn’t halt, M2 doesn’t halt too. B On every i/p on which M1 halts, M2 halts too. C On every i/p which M1 accepts, M2 halts. D None of above
Suppose M1 and M2 are two TM’s such that L(M1) = L(M2). ThenAOn every input on which M1 doesn’t halt, M2 doesn’t halt too.BOn every i/p on which M1 halts, M2 halts ...
3.0k
views
asked
Apr 17, 2017
Theory of Computation
theory-of-computation
turing-machine
+
–
1
votes
2
answers
5
#ugc-2016 #question 56
Let L = {0n1n | n≥0} be a context free language. Which of the following is correct? (A) L' is context free and Lk is not context free for any k≥1 (B) L' is not context free and Lk is context free for any k≥1 (C) Both L' and Lk is for any k≥1 are ... free. (D) Both L' and Lk is for any k≥1 are not context free. Official answer given by UGC is C . according to me answer is B
Let L = {0n1n | n≥0} be a context free language.Which of the following is correct?(A) L’ is context free and Lk is not context free for any k≥1(B) L’ is not conte...
4.5k
views
asked
Apr 12, 2017
Theory of Computation
theory-of-computation
ugcnetjul2016iii
+
–
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register