DBMS Suggestions
DBMS Suggestions
DBMS Suggestions
UNIT-1
1. Give the limitations of file based system. How can they be overcome using
DBMS. (Page no. 6)
2. Discuss the 3-level architecture of DBMS. Explain how it leads to data
independence.(Page no.10)
3. Define Data Independence ? Explain the difference between physical
and logical data independence. (page no. 12)
4. Database Manager(Page no.14)
5. Data Dictionary (Page no.17)
UNIT-2
1. What is Super key, Candidate key, primary key, foreign key with example.(Page no. 26)
2. What are integrity constraints ? Discuss the various types of integrity
constraints.(i.e. Entity integrity constraints and Referential integrity
constraints ) (Page no. 28)
3. Key Constraint (Page no. 28)
4. Relational Algebra
Example question:
Consider the Relational Database Schema given below :
Employee (empcode, empname, empaddress, salary)
Department (deptcode, deptname, deptlocation)
Perform the following queries using Relational Algebra :
(i) Find details of the departments located in Delhi.
(ii) Find the names of employees whose salary is more than 4 lakhs per annum.
(page no. 34)
5. RELATIONAL ALGEBRA( union, intersection, set difference, Cartesian product)
(page no.32) Example question:
6. Prepare ER Diagram for your exam. (Kuch ERD ka sample questions de raha hoon.
Ye 10 marks ka aata hai exam me.)
Draw an ER diagram for the following situation :
"An academic institution is affiliated to a University. The institution possesses
several departments, each department offers several courses. Each department
has its own infrastructure, where several teachers teach several students."
Transform your ER diagram into Relational Database.
Example questions:
Question 1:
Consider the following relation for published books :
Book (Book_title, Author_name, Book_type, Listprice, Author_affil, Publisher)
Author_affil refers to the affiliation of the author. Suppose the following
dependencies exist :
Book_title —> Publisher, Book_type
Book_type —> Listprice
Author_name --> Author_affil
(i) What Normal Form is the above relation in ? Justify.
(ii) Normalize the above relation till 3NF.
Questions 2:
Perform the following tasks for the relation R(A, B, C, D, E) whose functional
dependency set (FD) is given below :
FD: {AB —> C, C —> D, D —> A, BD —> E)
(i) Identify the candidate keys for the relation (R).
(ii) Identify the highest normal form possessed by the relation (R). Justify
your answer.
(iii) Normalize the relation (R).
Questions 3:
“Any relation in BCNF is in 3NF, but the converse is not true."
Justify the statement.
Questions 4:
"BCNF is stronger than 3NF" explain with the help of an example.
UNIT-4
1. Compare sequential file organisation with Heap files organisation. Discuss
the advantages and disadvantages of sequential file organisation.
(page no. 84)
2. Indexed Sequential File Organisation.
3. Secondary index, primary index, multi-level index.(page no. 87)
4. Difference between spare and dense index.
5. Write in detail about B-Tree structure for indexes with a neat diagram.
(page no. 97)
Block 2
UNIT-1
1. Learn Sql Queries
example question
Question 1:
Consider the following tables :
WORKS(Pname, Cname, Salary)
LIVES(Pname, Street, City)
LOCATED(Cname, City)
MANAGER(Pname, Mname)
Write a query in SQL for the following :
(i) List the names of the people who work for the company Wipro' along with the cities
they live in.
(ii) Find the people who work for the company `Infosys' having salary greater than 50,000.
(iii) List the names of the people, along with the street and city addresses.
(iv) Find the persons whose salaries are more than that of all of the 'Oracle‘ employees.
(v) Find the names of the persons who do not work in `Infosys'.
Question 2:
Consider the following relation EMP. Create queries for it :
3. With the help of an example, explain client server databases. How are they different
from distributed databases ? (Page no. 87)