Login
Register
@
Dark Mode
Profile
Edit my Profile
Messages
My favorites
Register
Activity
Q&A
Questions
Unanswered
Tags
Subjects
Users
Ask
Previous Years
Blogs
New Blog
Exams
Dark Mode
Made easy CBT2
[closed]
Chaitrasj
asked
in
Databases
Jan 26, 2019
closed
Jan 26, 2019
by
srestha
160
views
0
votes
0
votes
closed as a duplicate of:
MadeEasy Test Series 2019: Databases - Transaction And Concurrency
$R_2(A)$$W_1(B)$$W_1(C)$$R_3(B)$$R_2(B)$$R_1(A)$$C_1$$R_2(C)$$C_2$$W_3(A)$$C_3$
Is this schedule allowed under 2PL?
Chaitrasj
asked
in
Databases
Jan 26, 2019
closed
Jan 26, 2019
by
srestha
by
Chaitrasj
160
views
comment
Follow
share this
share
1 comment
by
Chaitrasj
commented
Jan 26, 2019
reply
Follow
share this
Just saw that a thread is already open for this question. But unable to mark it as duplicate
0
0
Please
log in
or
register
to add a comment.
0
Answers
← Previous
Next →
← Previous in category
Next in category →
Related questions
0
votes
0
votes
0
answers
1
Gate Fever
asked
in
Databases
Jan 28, 2019
337
views
made easy cbt2
consider the following relational schema R(A,B,C,D,E,F,G) AB->C,BC->A,AC->B,B->D,D->E how many minimum relations required to decompose R into BCNF which satisfy lossless and FDP decomposition? initially i got 4 relation as R1(A,B,C) R2(D,E) R3(B,D) R4(A,B,F,G) but in R1 and R2 there is no common attribute, hence it will not be lossless??am i correct
Gate Fever
asked
in
Databases
Jan 28, 2019
by
Gate Fever
337
views
0
votes
0
votes
0
answers
2
Deepanshu
asked
in
Algorithms
Jan 23, 2019
187
views
MADE EASY CBT2
Consider a binary tree where for every node ⏐P - Q⏐ ≤ 2. P represents number of nodes in left sub tree for node S and Q represents the number of nodes in right sub tree for node S for h > 0. The minimum number of nodes present in such binary ... NEED THAT NODE AT RIGHT SUBTREE DIDNT GET THAT ( 3RD NODE AT 2ND LEVEL WHY IS THAT THERE I THINK WITHOUT IT WE ARE SATISYING CONDITIONS
Deepanshu
asked
in
Algorithms
Jan 23, 2019
by
Deepanshu
187
views
0
votes
0
votes
0
answers
3
Vasu_gate2017
asked
in
Databases
Jan 30, 2017
127
views
MadeEasy CBT2 q37
Correct Answer
Vasu_gate2017
asked
in
Databases
Jan 30, 2017
by
Vasu_gate2017
127
views
0
votes
0
votes
2
answers
4
Souvik33
asked
in
Databases
Jan 14
86
views
Made Easy Test Series | 3NF | True/False
A relation is in 3NF if every non-prime attribute of R is fully functionally reliant on every key of R TRUE FALSE
Souvik33
asked
in
Databases
Jan 14
by
Souvik33
86
views
made-easy-test-series
databases
true-false
Subscribe to GATE CSE 2023 Test Series
Subscribe to GO Classes for GATE CSE 2023
Quick search syntax
tags
tag:apple
author
user:martin
title
title:apple
content
content:apple
exclude
-tag:apple
force match
+apple
views
views:100
score
score:10
answers
answers:2
is accepted
isaccepted:true
is closed
isclosed:true
Recent Posts
GATE CSE 2023 Paper & Analysis - Memory Based
From GATE to Australia
DRDO Previous Year Papers
From Rank 4200 to 64: My Journey to Success in GATE CSE Exam
What are the key things to focus on during the final 10-15 days before the GATE exam to improve performance?
Subjects
All categories
General Aptitude
(2.5k)
Engineering Mathematics
(9.3k)
Digital Logic
(3.3k)
Programming and DS
(5.9k)
Algorithms
(4.6k)
Theory of Computation
(6.7k)
Compiler Design
(2.3k)
Operating System
(5.0k)
Databases
(4.6k)
CO and Architecture
(3.8k)
Computer Networks
(4.6k)
Non GATE
(1.3k)
Others
(2.4k)
Admissions
(649)
Exam Queries
(842)
Tier 1 Placement Questions
(17)
Job Queries
(75)
Projects
(9)
Unknown Category
(853)
Recent Blog Comments
@Aakash_Bhardwaj all the best bro . For your...
What's the answer for keystroke question
Same,easy to moderate
I felt paper was very much like AIMT 3!!
very easy paper, I don't want to discuss paper...
Twitter
WhatsApp
Facebook
Reddit
LinkedIn
Email
Link Copied!
Copy
