DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING

RDBMS ASSIGNMENT – 1
RELEASE DATE: October 07, 2024 SUBMISSION DATE: October 18, 2024
SEMESTER – III SESSION: JUL – DEC 2024

1. What is RDBMS? What are the advantages of RDBMS over traditional file
systems?
2. What are various types of data models?
3. What is DBA? List out any four responsibilities of DBA.
4. What is difference between Physical and logical data independence?
5. How RDBMS differs from DBMS?
6. List the advantages and applications of DBMS.
7. What are the disadvantages of file processing system?
8. What is data Abstraction? Give the levels of data abstraction?
9. Explain 3-schema architecture of RDBMS with a block diagram. Explain role of
each layer.
10. What are super key, candidate key, primary key, alternate key and foreign
key? Explain with an example of your own.
11. Find the minimum number of tables required to represent the given ER
diagram in relational model-

12. Construct an ER Diagram for Company having following details:

• Company organized into DEPARTMENT. Each department has unique
name and a particular employee who manages the department. Start
date for the manager is recorded. Department may have several
locations.
 • A department controls a number of PROJECT. Projects have a unique
name, number and a single location.
• Company’s EMPLOYEE name, ssno, address, salary, sex and birth date
are recorded. An employee is assigned to one department but may
work for several projects (not necessarily controlled by her dept).
Number of hours/week an employee works on each project is recorded;
The immediate supervisor for the employee.
• Employee’s DEPENDENT are tracked for health insurance purposes
(dependent name, birthdate, relationship to employee).
13. The relational database schema is given below.
person (driver-id, name, address)
car (license, year, model)
accident (report-number, location, date)
owns (driver-id, license)
employee (person-name, street, city)
works (person-name, company-name, salary)
company (company-name, city)
manages (person-name, manager-name)
participated (report-number, driver-id, license, damage-amount)
Consider the above relational database, where the primary keys are
underlined. Give an expression in the relational algebra to express each of
the following queries:
1. Find the names of all employees who work for First Bank Corporation.
2. Find the names and cities of residence of all employees who work for First
Bank Corporation.
3. Find the names, street address, and cities of residence of all employees who
work for First Bank Corporation and earn more than $10,000 per annum.
4. Find the names of all employees in this database who live in the same city as
the company for which they work.
5. Find the names of all employees who live in the same city and on the same
street as do their managers.
6. Find the names of all employees in this database who do not work for First
Bank Corporation.
 7. Find the names of all employees who earn more than every employee of Small
Bank Corporation.
8. Assume the companies may be located in several cities. Find all companies
located in every city in which Small Bank Corporation is located.
14. Suppose you are given the following requirements for a simple database for
the National Hockey League (NHL):
• the NHL has many teams,
• each team has a name, a city, a coach, a captain, and a set of players,
• each player belongs to only one team,
• each player has a name, a position (such as left wing or goalie), a skill
level, and a set of injury records,
• a team captain is also a player,
• a game is played between two teams (referred to as host_team and
guest_team) and has a date (such as May 11th, 1999) and a score (such as
4 to 2).
Construct a clean and concise ER diagram for the NHL database.

15. University registrar’s office maintains data about the following entities:
• courses, including number, title, credits, syllabus, and prerequisites.
• course offerings, including course number, year, semester, section number,
instructor(s), timings, and classroom.
• students, including student-id, name, and program; 4. instructors, including
identification number, name, department, and title.
Further, the enrollment of students in courses and grades awarded to students in
each course they are enrolled for must be appropriately modelled. Construct an E-
R diagram for the registrar’s office. Document all assumptions that you make about
the mapping constraints.

16. Consider a database used to record the marks that students get in different
exams of different course offerings.
a) Construct an E-R diagram that models exams as entities, and uses a ternary
relationship, for the above database.
 b) Construct an alternative E-R diagram that uses only a binary relationship
between students and course-offerings. Make sure that only one relationship
exists between a particular student and course-offering pair, yet you can
represent the marks that a student gets in different exams of a course
offering.

17. Consider a university database for the scheduling of classrooms for -final exams.
This database could be modeled as the single entity set exam, with attributes
course-name, section_number, room-number, and time. Alternatively, one or
more additional entity sets could be defined, along with relationship sets to
replace some of the attributes of the exam entity set, as
• course with attributes name, department, and c-number
• section with attributes s-number and enrollment, and dependent as a weak
entity set on course
• room with attributes r-number, capacity, and building
Show an E-R diagram illustrating the use of all three additional entity sets listed.

18. R (A, B, C, D, E, F) be the relation. How many super keys will be there if AB
and BC are the candidate keys?
19. Consider Relation R (A, B, C, D, E) with functional dependencies F = {AB->C,
CD->E, C->A,C->D, D->B}. How many candidate keys in above relation?
20. Relation R has eight attributes ABCDEFGH. Fields of R contain only atomic
values. F = {CH -> G, A -> BC, B -> CFH, E -> A, F -> EG} is a set of functional
dependencies (FD) so that F+ is exactly the set of FDs that hold for R. Identify
the candidate keys?
21. Consider schema R (A, B, C, D, E, F) with functional dependencies F= {AD->E,
AB->C, B->D, AC->B, BC-> A, E->F}. The decomposition of R into R1 (ABDE),
R2 (ABC), and R3 (EF) is lossy or lossless dependency preservation?
22. Given the following FDs, How many candidate keys of R? Write the candidate
keys.
R = (A, B, C, D) F = {AB -> C; BC -> D; CD -> A; AD -> B}
23. Consider two relation schema R1 (A, B, C, D, E) and R2 (A, B, C, D, E).
Statement 1 is the functional dependency (FD) of relation R1 and Statement
2 is the functional dependency of relation R2.
1. {A-> B, AB->C, D-> AC, D-> E} 2. {A->BC, D-> AE}
Check FDs of R1 is equivalent to FD of R2 or not?
24. Given relation R = (A, B, C, D, E, G) with FD set F. F = {AC -> B, AB -> C, AD -
> E, B -> D, BC -> A, E -> G}. Given Decomposition R1(AB), R2(BC), R3(ABDE),
R4(EG). Check whether the decomposition is lossless or not?
25. Find the canonical cover of the following set of FDs {A->C, AC->D, E- > AD, E-
> H}.
26. Consider the following set of FDs for relation R.
a. {A->B, B->C, C->D}
b. {A-> BC, C-> D}
Find whether two FD sets are equivalent or not?
27. Consider the relation scheme R = {E, F, G, H, I, J, K, L, M, N} and the set of
functional dependencies {EF -> G, F -> IJ, EH -> KL, K -> M, L -> N} on R. What
is the highest normal form for the given relation?
28. For the relation R = (A, B, C, D) Given the following FDs, find the dependency
violating BCNF.
FD = {AB -> C, C -> D, D -> A}.
Decompose the above relation up to BCNF.