This document contains 3 assignments for a database management systems course. It includes questions about database concepts like data models, entity-relationship diagrams, functional dependencies, normalization, transactions, and SQL queries. The assignments cover relational algebra, database design principles, transaction processing, and the SQL language. Students are asked to explain concepts, provide examples, draw diagrams, write SQL statements, and prove or disprove functional dependencies. The faculty name and signature are requested at the end of each assignment.

1. Assignment no.01
Submission on: 14/02/2015
1. Explain Advantages of a DBMS over file processing system.
2. What do you mean by data model? Explain the various types of data models.
3. Explain the difference between a weak and strong entity set with an example.
4. Construct E-R diagram for registrar office of university which stores the data
about:
i.Student(sid,name,program)
ii. Courseoffering(time,secno,room,year,semester)
iii. Instructor (iid,name,dept,title)
iv. Course(syllabus,credits,courseno,title)
Each courses offering provides the grades to the student who are enrolled with
that course. Give the appropriate mapping constraints.
5. With neat sketch discuss the overall structure of DBMS.
6. What are attributes? What are different types of attributes you have studied?
Explain each with suitable example.
7. Explain types of database Users.
8. What are the functions of DBA? Explain in detail.
9. Explain the concept of EER model with suitable example.
10. What is data abstraction and data independence? Explain their types.
11. Draw scheme for university databases.
Name and Signature of Faculty

2. Assignment no.02
Submission on: 02/03/2015
1. What is join? Enlist and explain the different types of join.
2. Explain the various types of data models used in DBMS.
3. Explain the fundamental operation in relational algebra.
4. What is an attribute? What are the various types of attribute.
5. Consider the following relation:
Emp(ename,company_name,salary)
Write SQL Queries:
i.Find the total salary of each company.
ii. Find the company name whose salary is less than lowest average salary.
iii. Find the employee name whose salary is higer than highest average salary
of TCS’s.
6. Consider the following structure for employee.
Emp(empno,ename,job,mgr,joindate,sal,comm,deptno)
Write SQL Queries for the following:
i.Change the average salaries for each dept.
ii. Change the name of emp ‘AMAN’ to ‘ABHIJEET’.
iii. Display emp details whose name start with ‘A’.
iv. Display the list of emp excluding job title as ‘Salesman’.
v. Dispaly annual salary of all emp.
vi. Display name and salary for all emp. Whose sal is not in the range of

3. Rs.5000 and 10000.
vii. Delete all tuples in the emp relation for emp of dept_no=’200’.
7. Describe different clause in SQL with example.
8. What are aggregate functions in SQL? Explain it.
9. Describe string function and numeric function with example.
10. Explain ‘Group by’ and ‘having clause’ in SQL with example.
11. Explain set operators in SQL with example.
12. What are different alter commands in SQL? Explain with example.
13. With example explain select and where clauses.
14. What are views and Trigger? Explain with suitable example.
15. Find all courses taught in both the summer 2009 sem and in the winter 2010
sem.Write the SQL Query.
Name and Signature of Faculty

4. Assignment no.03
Submission on: 23/03/2015
1. Explain Functional dependencies with an example.
2. Explain 1NF,2NF and3NF in detail.
3. Write short note on:
i. Nested Subqueries
ii. Multivalued dependency
iii. Join dependency
iv. Trigger
v. View
vi. Transaction
4. Explain states of transaction with suitable diagram also explain ACID properties.
5. Explain serializability and shadow paging with example.
6. Explain Time stamp protocols:
i.Time stamp ordering
ii.Validation based protocol
7. Inference rules based functional dependency questions.
i.Let set of FD’s are given
F={A->B,C->X,BX->Z}
prove or disprove that ac->Z.
ii.Let F={A->B,C->D,C C B}
prove or disprove that A->C
iii.Let F={A->B,BC->D}
prove or disprove the following FD’s
a.AC->D b. B->D c. AD->B
iv.Let F={XY->W,Y->Z,WZ->P,WP->QR,Q->X}
show that XY->P.
8. Explain the following terms:
i.Lossy join
ii.Lossless Join Decomposition
iii.Lock based protocols

5. 9. Consider the following relation schemes:
R=(A,B,C,) and S=(D,E,F)
Let realtion r(R) ,s(S) he given .Give an expression in SQL that is equivalent to each
of following.
i. Π A(r)
ii. σB=17(r)
iii. r×s
iv. πA,F (σC=D(r×s))
10. Explain scedules ,types of schedule and the testing of serializability.
11. Consider the following schedule and draw the P(S) also check for conflict
serializable.
i. r1(x), w2(x),r1(x)
ii. r1(x),r3(x),w1(x),r2(x),w3(x)
iii. r1(x),r3(x),w3(x),w1(x),r2(x)
Name and Signature of Faculty