Escolar Documentos
Profissional Documentos
Cultura Documentos
A University has many departments such as academics, sports, admin etc. Data regarding all their
operations has to be recorded by every department on day to day basis.
Which model is suitable for the above scenario? Justify your answer with pros and cons.
UNIT 2
Map the given ER diagram to a relational model and state the steps in the mapping process.
UNIT 3
Identify which normal form it does not satisfy. Normalise the relation to that normal form.
2. The relation below shows the details of patient surgery appointments with cosmetology doctors.
Answer the questions (i) and (ii) with respect to this relation.
The relation is susceptible to different anomalies. Illustrate them based on the above example.
Determine when a relation will be in 1NF, 2NF, 3NF and derive the Normal forms for the above
relation.
UNIT IV
1. Using the given schema for the relation Employee write corresponding SQL queries.
EMPOLYEE(EMPID,FNAME,LNAME,EMAIL,PHONE,HIRE_DATE,JOB_ID,
SALARY,COMMISSION_PCT,MANAGER_ID,DEPT_ID )
A) The HR department needs to display the last name and salary for any employee whose
salary is not in the range of $5,000 to $12,000.
B) Create a report to display the last name, job ID, and start date for the employees with the last
names of Matos and Taylor. Order the query in ascending order by start date.
2. A professional body conducts sports competitions annually under different categories and award
prizes to the winners. Assume that there are 1000 participants, 20 categories and 10 Gold award
winners out of 100 winners. The database of the professional body consists of the following
relations.
Participants (pno, name, address , telephone, email);
The SQL query to retrieve all Gold award winners with each winners name, category and year is
given below.
(c) Apply heuristic optimization to optimize the query and draw the optimized query tree for the
query.(6)
UNIT V
A Doctor wishes to search the records of patients according to their patient number. Suggest a non-
linear index structure to retrieve a patient record in the shortest possible time.
The index structure for the above problem may store 4 Patient numbers in the leaf node and 2
patient numbers in the other nodes.
Show how the index will be constructed for the following list of patient numbers:-
P005,P001,P006,P100,P099,P098,P099,P050,P055,P054,P053,P003,P002.
Show how the index structure changes when the following patient numbers are deleted from the
above structure that you have got:-