lOMoARcPSD|54516663
Week 11 - DBMS
dbms (Anna University)
Scan to open on Studocu
Studocu is not sponsored or endorsed by any college or university
Downloaded by Bubu Maity (
[email protected])
lOMoARcPSD|54516663
Answer Submitted.
X
(https://swayam.gov.in) (https://swayam.gov.in/nc_details/NPTEL)
[email protected]
NPTEL (https://swayam.gov.in/explorer?ncCode=NPTEL) » Introduction to Database
Systems (course)
Course
outline Week 11: Assignment 11
Introduction
(Non Graded)
to Assignment not submitted
Database
Note : This assignment is only for practice purpose and it will not be
Systems ()
counted towards the Final score
Week 0 () 1) Consider the following two relations that store the details of the 1 point
employees, their departments and managers of the departments
Week 1 () working in an organization, where managerId is a foreign key that refers to
empId of Employee relation.
Week 2 ()
Employee( empId, deptId) Department( deptId , deptName,
Week 3 () managerId)
Week 4 () Consider a join operation between the above two relations based on the join
condition Employee.empId = Department.managerId .
Week 5 () Assume that indexes are available on both the relations on the fields used in
the join condition. Suppose that the single loop join technique
Week 6 () is chosen to perform the operation. Identify the correct option for the following
statements:
Week 7 ()
S1. For the given join condition, the join selection factor of Department
Week 8 () relation is more than the join selection factor of Employee relation
S2. For achieving better performance, the single loop join algorithm loops
Week 9 () over the Employee records
lOMoARcPSD|54516663
Week 10 () Both S1 and S2 are False
S1 is False, S2 is True
Week 11 () S1 is True, S2 is False
Both S1 and S2 are True
Join
operator Yes, the answer is correct.
processing Score: 1
algorithms Accepted Answers:
(unit? S1 is True, S2 is False
unit=91&lesson=92)
2) For the information given in Question 2, assume that each of the 1 point
Query partitions in R and S is stored in 10000 and 1000 blocks, respectively.
optimization To compute the join result of a particular partition file of R, the number of
(unit? blocks of S that need to be accessed in the probe phase is
unit=91&lesson=93)
(Ignore the time taken to write the result)
ACID
properties
1000
and 11000
operations
1000 * b2
in
transactions 2000 * b2
(unit? No, the answer is incorrect.
unit=91&lesson=94) Score: 0
Accepted Answers:
Schdeules
1000
(unit?
unit=91&lesson=95)
3) Which of the following SQL operators isn’t commutative? 1 point
Lecture
Slides (unit? INNER JOIN
unit=91&lesson=96)
FULL OUTER JOIN
Practice: LEFT OUTER JOIN
Week 11:
INTERSECT
Assignment
11 (Non No, the answer is incorrect.
Graded) Score: 0
(assessment? Accepted Answers:
name=123) LEFT OUTER JOIN
Quiz: Week
4) Consider the following schedule S. 1 point
11:
Assignment
11 S: R1 (X); R2 (Z); R1 (Z); R3 (X); R3 (Y); W1 (X); W3 (Y); R2 (Y); W2 (Z);
(assessment?
name=141) In the precedence graph of S, the number of edges (both incoming and
outgoing) of
Week 11
nodes T1 and T2, respectively are
Feedback
form :
1, 1
Introduction
to 1, 2
Database 2, 1
Systems
Downloaded by Bubu Maity ([email protected])
lOMoARcPSD|54516663
(unit? 2, 2
unit=91&lesson=97)
No, the answer is incorrect.
Week 12 () Score: 0
Accepted Answers:
2, 2
Download
Videos () 5) Consider the following schedules. 1 point
Lecture S1: R1 (X) R1 (Y) R2 (X) R2 (Y) W2 (Y) W1 (X)
Notes () S2: R1 (X) R2 (X) R2 (Y) W2 (Y) R1 (Y) W1 (X)
Live Which of the above schedules are conflict-serializable?
Sessions
() Only S1
Only S2
Problem
BOTH
Solving
Session () NONE
Yes, the answer is correct.
Score: 1
Accepted Answers:
Only S2
Check Answers and Submit
Your score is: 2/5
