0% found this document useful (0 votes)
2 views6 pages

Modulewise Questions DBMS

The document outlines the syllabus for a Database Management System (BCS403) course, covering various modules that include definitions and concepts of databases, DBMS components, data models, relational algebra, SQL queries, normalization, and concurrency control. It also discusses practical applications through ER diagrams, SQL commands, and examples of database operations. The course is structured into five modules, each addressing different aspects of database management and design.

Uploaded by

introvertb46
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)
2 views6 pages

Modulewise Questions DBMS

The document outlines the syllabus for a Database Management System (BCS403) course, covering various modules that include definitions and concepts of databases, DBMS components, data models, relational algebra, SQL queries, normalization, and concurrency control. It also discusses practical applications through ER diagrams, SQL commands, and examples of database operations. The course is structured into five modules, each addressing different aspects of database management and design.

Uploaded by

introvertb46
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/ 6

DataBase Management System (BCS403)

Module-1
1. Define database. Elaborate component modules of DBMS and their interactions.
2. Describe the three-schema architecture. Why do we need mappings among schema levels?
3. Explain the difference between logical and physical data independence.
4. Draw an ER diagram for an COMPANY database with employee, department, project as
strong entities and dependent as weak entity. Specify the constraints, relationships and ratios in
the ER diagram.
5. Define the following terms with example for each using ER notations: Entity, attribute,
composite attribute, multivalued attribute, participation role.
6. What is DBMS? List the characteristics of database approach. Bring out major advantages of
the database approach.
7.Explain data independence, Draw 3 schema architecture and discuss the mapping.
8.Define following: i) Database Administrator ii) Canned transaction iii) Weak entity
iv) Meta data v) Database Instance. vi) Cardinality Ratio vii) Data Dictionary
9.Describe components modules of DBMS and its interaction with neat diagram.
10.Draw ER diagram of library database schema atleast 4 entities. Also specify primary keys,
structural constraints and explain.
11.Briefly discuss different types of end users of Database.
12. Explain the categories of Data Models.
13. Explain the component modules of DBMS & their interactions with diagram.
14. What are the responsibilities of DBA & database designers?

Module-2
1. Discuss the update operations(includes insert,update,delete) and dealing with constraint
violations with suitable examples.

2. Illustrate the relational algebra operators with examples for select and project operation.

3. Discuss the characteristics of relations that make them different from ordinary table and files.

4. Briefly explain different types of update operation on relation database. Show an example of
violation of referential and entity integrity in each of update operation.
5. Describe the steps of ER to- relational mapping with suitable examples and schema for each
step.

6. Explain with example: i) Division operation ii) Full outer join iii) Aggregate function
iv) Project operation v) Cartesian product

7. Explain Unary relational operations with examples.

8. What is an Integrity Constraint? Explain the importance of Referential Integrity Constraint.

9. Explain the following relational algebra operation. JOIN, DIFFERENCE, SELECT, UNION

10. Discuss the E.R to Relational mapping algorithm with example for each step.

11. Explain the relational algebra operation for set theory with examples.

12. Discuss the Equijoin & Natural Join with suitable example.

13. Consider the Sailors-Boats-Reserves DB described


s (sid, sname, rating, age)
b (bid, bname, color)
r (sid, bid, date)
Write each of the following queries in SQL.
1. Find the colors of boats reserved by Alber.
2. Find all sailor ids of sailors who have a rating of at least 8 or reserved boat 103.
3. Find the names of sailors who have not reserved a boat whose name contains the string
“storm”. Order the names in ascending order.
4. Find the sailor ids of sailors with age over 20 who have not reserved a boat whose
name includes the string “thunder”.

14. Perform (i) Student U instructor (ii) Student ∩ Instructor


(iii) Student - Instructor (iv) Instructor - Student on the following tables:
Student Instructor
Fname Lname Fname Lname
Susan Yao John Smith
Ramesh Shah Ricardo Browne
Johnny Kohler Susan Mao
Barbara Jones Francis Johnson
Amy Ford Ramesh Shah
Jimmy Wang
Ernest Gilbert
15. Consider the following relational database schema and write the queries in relational algebra
expressions:
EMP(Eno, Ename, Salary, Address, Phone, DNo)
DEPT (DNO, Dname, DLoc, MgrEno)
DEPENDENT (Eno, Dep_Name, Drelation, Dage)
(i) List all the employees who reside in 'Belagavi'.
(ii) List all the employees who earn salary between 30000 and 40000
(iii)List all the employees who work for the 'Sales' department
(iv) List all the employees who have at least one daughter
(v) List the department names along with the names of the managers

16. Consider the two tables T1 and T2 shown below


T1 T2
P Q R A B C
10 a 5 10 b 6
15 b 8 25 c 3
25 a 6 10 a 5

Show the results of the following operations:

(i) (iii)

(ii)

17. Consider following schema


Suppliers (SID, SName, address)
Parts (PID, PName, Colour)
Catalog (Sid, PID, Price)
Write relational algebra expression for following queries:
i) Find the names of all red parts.
ii) Find all prices for parts that were red or green.
iii) Find the SID's of all suppliers who supply part that is red or green.
iv) Find the SID's of all supplier who supply part that is red and green.

Module-3
1. Illustrate the informal design guidelines for relation schemes with examples.(Important Q)
2. Write syntax with example in SQL for the DDL and DML SQL statements.
3. Consider the schema for college database.
Student (USN, Sname, Address, Phone, Gender)
SemSec (SSID,Sem, Sec)
Class (USN, SSID)
Subject (Subcode, Title, Sem, Credits)
IAmarks (USN, Subcode, SSID, Test1, Test2, Test3, Final IA)
Write SQL Query.
i) List all the students studying in 4th sem 'C' section.
ii) Compute total number of male students in each semester.
iii) List Test1 marks of all students in all subjects.
4. What is the need for normalization? Explain 2nd normal form. Consider the relation
EMP_PROJ= {SSn, Pnumber, Hours, Ename, Pname, Plocation). Assume {SSn,
Pnumber} as a primary key. The dependencies are
 SSn, Pnumber → {Hours}
 SSn → {Ename}
 Pnumber → {Pname, Plocation}
Normalize above relation into 2NF.
5. Write the syntax for INSERT, UPDATE and DELETE statements in SQL and explain
with suitable examples.
6. Discuss insertion, deletion and modification anomalies. Why are they considered bad?
Illustrate with examples.
7. Illustrate the following with suitable examples:
(i) Datatypes in SQL
(ii) Substring Pattern Matching in SQL.
8. Define 1NF, 2NF, and 3NF with examples.
9. What is a Normalization? Explain the 1NF, 2NF & 3NF with examples.
10. Illustrate insert, delete, update, alter & drop commands in SQL.
11. What is Functional dependency? Explain the inference rules for functional dependency
with proof.
12. Consider the following relations:
Student(Snum, Sname, Branch, level, age)
Class(Cname, meet_at, room, fid)
Enrolled(Snum, Cname)
Faculty(fid, fname, deptid)
Write the following queries in SQL. No duplicates should be printed in any of the
answers.
(i)Find the names of all Juniors (level = JR) who are enrolled in a class taught by I. Teach
(ii)Find the names of all classes that either meet in room R128 or have five or more
students enrolled.
(iii) For all levels except JR, print the level and the average age of students for that level.
(iv) For each faculty member that has taught classes only in room R128, print the faculty
member's name and the total number of classes she or he has taught.
(v) Find the names of students not enrolled in any class.

Module 4
1. How are triggers and assertion defined in SQL? Explain with example.
2. Write the syntax and example of view in SQL. Explain efficient view implementation
3. List the problems that occur during concurrency control and also explain them with
supporting transaction diagrams. (Important Q)
OR
Discuss the types of problems that may encounter with transactions that run concurrently.
(Important Q)
4. Explain the various DBMS-Specific Buffer replacement policies.
5. What do understand by correlated Nested Queries in SQL? Explain with suitable example.
6. Discuss the ACID properties of a database transaction. (Important Q)
7. What are the views in SQL? Explain with examples.
8. In SQL, write the GROUP BY and HAVING clauses with suitable examples.

Module 5
1. Demonstrate with example deadlock in transaction. Discuss deadlock prevention
algorithm.
2. What are Binary locks? Explain with Lock and unlock operations with algorithm.
3. Write a short note on :
i) Properties of NOSQL system
ii) The CAP theorem
iii) Document based NO-SQL system
iv) NOSQL Graph database.
4. What is the two phase locking protocol? How does it Guarantee serializability.
5. Describe the wait-die and wound-wait protocols for deadlock prevention.
6. List and explain the four major categories of NOSQL system.
7. What is Multiple Granularity locking? How is it implemented using intension locks?
Explain.
8. Discuss the following MongoDB CRUD operations with their formats:
(i) Insert (ii) Delete (iii) Read
9. Briefly discuss about Neo4j data model.
10. Demonstrate the Two phase locking protocol used for concurrency control.
11. What is NOSQL Graph database? Explain Neo4j.

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy