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 sidsunny
0
votes
1
MadeEasy Subject Test: Databases - Transactions
Here T1 T2 T4 T5 will come in this order only and for T3 we have 5 positions So number of schedules will be 5 which are view eq to given schedule. But ans given is 10
Here T1 T2 T4 T5 will come in this order only and for T3 we have 5 positionsSo number of schedules will be 5 which are view eq to given schedule.But ans given is 10
230
views
answered
Jan 31, 2017
Databases
made-easy-test-series
databases
transaction-and-concurrency
+
–
0
votes
2
what is the complexity
443
views
answered
Jan 19, 2017
Algorithms
algorithms
time-complexity
test-series
+
–
1
votes
3
sockets
Why we not apply bind() at the client side?
Why we not apply bind() at the client side?
852
views
answered
Dec 6, 2016
Computer Networks
computer-networks
+
–
0
votes
4
MadeEasy Test Series: Compiler Design - Syntax Directed Translation
992
views
answered
Nov 23, 2016
Compiler Design
made-easy-test-series
compiler-design
syntax-directed-translation
+
–
0
votes
5
mathematical logic
(pr)(st) p t 1. (pr)(st) Premise 2. p Premise 3. pr 2, Addition 4. st 1, 3 Modus Ponens 5. t 4, Simplification I am not getting two rules 1. addition (p→(pr)) 2. Simplification ((st)→t) How and where we can apply?
(pr)(st)p t1. (pr)(st)Premise2. pPremise3. pr2, Addition4. st1, 3 Modus Ponens5. t4, SimplificationI am not getting two rules 1. addition (p→(pr)) ...
302
views
answered
Nov 16, 2016
Mathematical Logic
mathematical-logic
propositional-logic
+
–
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register