Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Filter
budhu
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Recent activity by budhu
1
answer
1
Cascadeless/ Recoverable
The given schedule: R1 (A) R2 (B) W2 (B) W1(A) W2 (A) Commit2 R1 (C) is revoreable, cascadeless or strict?
The given schedule:R1 (A) R2 (B) W2 (B) W1(A) W2 (A) Commit2 R1 (C)is revoreable, cascadeless or strict?
1.5k
views
reshown
Jan 29, 2018
Databases
databases
transaction-and-concurrency
concurrency
recoverable
dirty
+
–
1
answer
2
DFS- depth first search
698
views
commented
Jan 25, 2018
DS
data-structures
depth-first-search
graph-algorithm
graph-connectivity
+
–
0
answers
3
SQL query
which of the following sets of keywords constitutes a mapping in SQL a) select , from , table b)select , from where c)connect , table , create d)select , table , insert i cant understand what the question is trying to coney and the answer given is B
which of the following sets of keywords constitutes a mapping in SQLa) select , from , tableb)select , from wherec)connect , table , created)select , table , inserti cant...
1.2k
views
commented
Oct 3, 2017
4
answers
4
GATE CSE 2015 Set 1 | Question: 51
Consider the NPDA ... follows: Which one of the following sequences must follow the string $101100$ so that the overall string is accepted by the automaton? $10110$ $10010$ $01010$ $01001$
Consider the NPDA $$ \left \langle Q= \left \{ q_{0}, q_{1}, q_{2} \right \},\Sigma = \left \{ 0, 1 \right \}, \Gamma = \left \{ 0, 1, \perp \right \}, \delta, q_{0}, \p...
23.5k
views
answered
Oct 2, 2017
Theory of Computation
gatecse-2015-set1
theory-of-computation
pushdown-automata
normal
+
–
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register