Semester : SEMESTER 4
Subject : Principles of Database Design
Year : 2019
Term : DECEMBER
Branch : COMPUTER SCIENCE AND ENGINEERING
Scheme : 2015 Full Time
Course Code : CS 208
Page:3
17
18
19
20
a)
b)
0)
ಬ
0)
0)
a)
a)
b)
D192078 Pages:4
Assume that the tree is initially empty and values are added in ascending order.
Construct B+-trees for the case where the number of pointers that will fit in one node
is four.
What is Big Data?
What is the significance of Big Data in current data management scenarios?
How is Big Data different from traditional data sources?
What are the different types of locks used in concurrency control?
How conversions of locks are achieved in concurrency control?
Explain how we can guarantee serializability by two phase locking protocol.
Consider the following relations:
Instructor(IID, Iname,lage,Idept,Isalary)
Teaches(IID,CID, semester)
Course(CID,Ctitle,credit)
The foreign keys in Teaches are same as the primary key names. Perform heuristics-
based query optimization on the following SQL query.
SELECT IID
FROM Instructor, Teaches, Course
WHERE Instructor.IID = Teacher.IID AND Course.CID = Teaches.CID AND
Teaches.semester = “Even” AND Course.title = “DBMS”;
Explain the components of GIS systems.
What are the characteristics of data in GIS.
بد بد oi
Page 3 of 3
(3)
(3)
(4)
(2)
(3)
(5)
(10)
(4)
(6)