Scribd
Upload
11 views3 pages

16CS52

This document outlines the examination structure for the V Semester B.E. in Computer Science and Engineering at RV College of Engineering for the Database Design course. It includes instructions for candidates, details on Part A and Part B questions, and various topics related to database concepts, relational algebra, normalization, and MongoDB queries. The exam is scheduled for March/April 2023 and has a maximum score of 100 marks.

Uploaded by

dummyrvce
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
11 views3 pages

16CS52

This document outlines the examination structure for the V Semester B.E. in Computer Science and Engineering at RV College of Engineering for the Database Design course. It includes instructions for candidates, details on Part A and Part B questions, and various topics related to database concepts, relational algebra, normalization, and MongoDB queries. The exam is scheduled for March/April 2023 and has a maximum score of 100 marks.

Uploaded by

dummyrvce
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 3

16CS52

USN
RV COLLEGE OF ENGINEERING®
(An Autonomous Institution affiliated to VTU)
V Semester B. E. Examinations March / April-2023
Computer Science and Engineering
DATABASE DESIGN
Time: 03 Hours Maximum Marks: 100
Instructions to candidates:
1. Answer all questions from Part A. Part A questions should be answered
in first three pages of the answer book only.
2. Answer FIVE full questions from Part B. In Part B question number 2, 7
and 8 are compulsory. Answer any one full question from 3 and 4 & one
full question from 5 and 6

PART-A

1 1.1 Define Primary key. 01


1.2 Define database snapshot. 01
1.3 Define Minimum cardinality constraint. 01
1.4 Define Data. 01
1.5 What is prime attribute? 01
1.6 What is recursive Relationship? 01
1.7 What are System Logs? 01
1.8 What do you mean by Relationship among entities? 01
1.9 Define multi-valued dependency. 02
1.10 Define Virtual table. 01
1.11 What is Identifying Relationship? Give example. 01
1.12 What is null attribute? 01
1.13 What is check point? 01
1.14 What is Schema less database? 01
1.15 Find for the following given.
. 02
1.16 What is cautious waiting? 01
1.17 Displayed schema is called as __________. 02

PART-B

2 a Explain Component modules of with a neat diagram 08


b Draw an -diagram for a database system. Assume your
own entities (maximum of entities), also identify Weak entity,
cardinality ratios and participation constraints. 08

3 a
For Above given database, write Relational algebra queries for the
following:
i) Find the Name of sailors who sails boat id .
ii) Find the Name of sailors who has reserved red boats.
iii) Find the Name of sailors who has reserved Red or Green boats.
iv) Find the Name of sailors who has reserved Red and as well as
Green boats.
v) Find the id of sailors who has not reserved Red boats and age is
greater than . 10
b Discuss and anomalies with an example for each. 06

OR

4 a Explain the following with example with respect to relational algebra


with example:
i) operation
ii) can be expressed as 08
b Explain the following operations with an example:
i)
ii)
iii)
iv) 08

5 a What is the need for normalization? Explain and with


examples. 10
b Discuss in detail the inference rules for functional dependencies. 06
OR

6 a For below database keeps track of auto sales in car dealership,Solve


these queries using .

i) Retrieve all employees whose address is in „tumkur‟.


ii) (Show the resulting salaries if every employee working on the
„aaa‟ project is given a percent raise.
iii) Display dnum, name of an emp, and pno for all the employees
who work on projects which belongs to their department.
iv) Display all the employees who have or more dependents 10
b Explain aggregate operations in with examples. 06

7 a Solve following queries in MongoDB for Employee collection.


i) Create a collection by name “Employee”.
ii) Insert two records at once with the following fields:
and .
iii) Find a student record with .
iv) Remove a employee record by name “Sangam”.
v) Update the employee record with Age value set to . 10
b Discuss the following with respect to Elasticsearch:
i) Elements of Metadata.
ii) Using own ID in indexing a document with example. 06

8 a Draw a neat diagram and discuss the typical states that a transaction
goes through during execution. 08
b Differentiate the following:
i) Timestamp Ordering and Thomas Write Rule in concurrency
control.
ii) Steal/No steal and Force/no force approaches in recovery. 08

You might also like