0% found this document useful (0 votes)
22 views4 pages

Question Bank DBMS

The document is a question bank for a DBMS course at the Institute of Management Studies, covering various topics such as Data Manipulation Language, database management systems, relational algebra operations, normal forms, and SQL queries. It includes theoretical questions, practical examples, and relational algebra exercises. The questions aim to assess understanding of database concepts, integrity rules, and transaction properties.

Uploaded by

neutral1608
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
0% found this document useful (0 votes)
22 views4 pages

Question Bank DBMS

The document is a question bank for a DBMS course at the Institute of Management Studies, covering various topics such as Data Manipulation Language, database management systems, relational algebra operations, normal forms, and SQL queries. It includes theoretical questions, practical examples, and relational algebra exercises. The questions aim to assess understanding of database concepts, integrity rules, and transaction properties.

Uploaded by

neutral1608
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/ 4

Institute of Management Studies, Ghaziabad

(University Courses Campus)


Question - Bank
DBMS (BCA-501)

Q1. i) What is DML (Data Manipulation Language?


ii) Define Data independence and DDL.
iii)What is E-R model?
iv)Difference between weak entity set and strong entity set?
v)Difference between procedural and non procedural language.
vi)How does Tuple-oriented relational calculus differ from domain-oriented relational
calculus.
vii) What is Functional Dependency, fully functional dependency and Multivalued
Dependency?
viii)What is 1NF and 2NF (normal forms)
ix) Define serializability ?
x) What is serial and concurrent schedule?

Q2. What do you mean by database management system? Explain its advantages and
disadvantages over file system.

Q3. Discuss the differences between the candidate keys, primary key and super key of a relation.
Give example to illustrate your answer.

Q4. Explain with the help of example following operations (in Relational Algebra) :
join, union, minus, cartesian product, natural join

Q5. employee (emp_id, emp_name, emp_street, emp_city)


works (emp_id, company_id, salary)
located_in ( company_code, company_name, company_city)
Write queries in relational algebra:
i) Find the names of all employees who work for a company located in “Ghaziabad”
ii) Find the names of the employees who work for the company located in city in which they
live.
iii) Find the names of the employee who work in the company “Infosys”

Q6. What do you mean by a schedule? Explain the difference between conflict serializable
schedule and view serializable schedule with suitable examples. Check whether given schedule
is conflict serializable or non conflict serializable.( By drawing precedence graph)
T1 T2 T3
R1(X)
R3(X)
W1(X)
R2(X)
W3(X)

Q7. What is the difference between BCNF and Third Normal form ? List all the functional
dependencies satisfied by relation shown below:

A B C
A1 B1 C1
A1 B1 C2
A2 B1 C1
A2 B1 C3

Q8. Draw E-R diagram for Library Management System. Assume entity sets, attributes &
relationship by yourself.

Q9. Let the following relation schemes be given


R = (A,B,C)
S = (D,E,F)
Let relations r(R) and s (R) be given. Given an expression SQL that is equivalent to each of the
following:
i) ΠA (r)
ii) r × s
iii) ΠA,F ( σ C = D (r × s))

Q10. Let R= (A,B,C) and let r1 and r2 both be relations on schema R. Give an expression in the
SQL that is equivalent to each of the following:
i) ∏ B (r2)
ii) σ A=20 (r2)
iii) r1 U r2
iv) r1 – r2

Q11. Define and explain 4th and 5th normal forms with the help of examples.
Q12. What are the ACID properties of a transaction? How are these useful?

Q13. Expalin various integrity rules in relational model.

Q14. What are different aggregate functions used in SQL. Explain at least two with the help of
examples.

Q15. State the condition when two schedules are considered as View Equivalent. State, whether
the following schedule is view serializable. Justify your answer.
T1 T2 T3
Read(A)
Write(A)
Write(A)
Write(A)

Q16. What is logical data independence and why is it important? Explain.

Q17. Consider the following relations


RENTER(rno, fname, lname, address, tel_no, pref_type, max_rent)
VIEWING(rno, pno, date, comment)
PROPERTY_FOR_RENT( pno, street, area ,city, pcode, type, rooms, rent)
Express the following queries in relational algebra.

(i) List the name and comments of all renters who have viewed a property.
(ii) Identify all renters who have viewed all properties with three rooms.

Q18. What is DBMS? How many types of users works on database?

Q19. Describes the various relationship constraints by giving suitable example.

Q20. Explain the SQL operators BETWEEN-AND, IN, LIKE and IS_NULL by taking suitable
examples.

Q21. Consider the following relations:


BRANCH( bno, street, area, city, pcode, Tel_no, Fax_no)
STAFF( Sno, Fname, Lname, address, position , salary, bno)
Express the following queries in SQL:
(i) List the staff who work in the branch at ‘163 main street’
(ii) Find staff whose salary is larger than the salary of every member of
staff at branch B3.

Q22. Consider the relations

City (city_name, state)


Hotel (name, address)
City_hotel (hotel_name, city_name, owner)

Answer the following queries in relational algebra


i) Find the names and address of hotels in Agra.
ii) List the names of cities which have no hotel.
iii) List the names of the hotels owned by ‘Taj Group’.

Q23. Consider the relations given below

Borrower (id-no, name)


Book (accno., title, author, borrower-idno)

(a) Define the above relations as tables in SQL making real world assumptions about the type of
the fields. Define the primary keys and the foreign keys.
(b) For the above relations answer the following queries in SQL
i) What are the titles of the books borrowed by the borrower whose id-no in 365.
ii) Find the numbers and names of borrowers who have borrowed books on DBMS in
ascending order in id-no.
iii) List the names of borrowers who have borrowed at least two books.

You might also like