Scribd
Upload
2 views1 page

Assignment 2

This document outlines an assignment for B Tech Semester III students at Ganpat University, focusing on Database Management Systems. It includes a list of questions related to normalization, functional dependencies, query processing, ACID properties, and SQL queries, each mapped to specific course outcomes and Bloom's taxonomy levels. The submission deadline for the assignment is December 16, 2023.

Uploaded by

jay thakor
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
2 views1 page

Assignment 2

This document outlines an assignment for B Tech Semester III students at Ganpat University, focusing on Database Management Systems. It includes a list of questions related to normalization, functional dependencies, query processing, ACID properties, and SQL queries, each mapped to specific course outcomes and Bloom's taxonomy levels. The submission deadline for the assignment is December 16, 2023.

Uploaded by

jay thakor
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/ 1

GANPAT UNIVERSITY

U.V.PATEL COLLEGE OF ENGINEERING


B Tech Semester III CSBS
2CSBS3105: DATABASE MANAGEMENT SYSTEM
Assignment-2
Instructions -
The right-most text indicates the Course Outcomes (CO) Numbers, followed by Bloom’s taxonomy level of the
question, R: Remembering, U: Understanding, A: Applying, N: Analyzing, E: Evaluating, C: Creating.

SR. QUESTIONS Mapped


NO. CO &
Bloom’s
Taxonom
y
1 Define and Illustrate the importance of Normalisation. 4-U
2 Explain Inference Rules for Functional Dependency 4-R
3 Define 1NF, 2NF, 3NF, Partial dependency and Transitivity. 4-U
5 BCNF is a stricter version of 3NF, Discuss with an example. 4-U
6 Explain Multivalued dependency in detail. 4-U
7 Enlist and explain the basic steps in Query Processing. 3-A
8 Discuss Lossy and Lossless decomposition with proper example 4-U
9 Examine the Highest normal form for the given Relation R (A, B, C, D) 4-R
with Functional dependencies {F: A→B, B→C, C→BD}. If the relation
is not in 3NF then use Normalization to bring the relation in 3NF.
10 Consider the relation R = {A, B, C, D, E, F, G, H, I, J} and the set 4-E
of functional dependencies
F={{A, B} → C, A → {D, E}, B → F, F →{G, H}, D →{I, J}}
What is the key for R? Decompose R into 2NF, then 3NF relations.
11 Explain ACID Properties of Transaction. 2-U
12 Consider the following relational schema: 3-A
Student ( Sid, Sname, Marks, City, Department_no)
Department ( Dept_no, Dname)
Address (Sid, State, Pincode)

Write the following queries in SQL.


(a) Find the Student’s Name and Department’s Name for all students of
Mehsana.
(b) Get the average marks of students for every city.
(c) Find the state and postal code information for students with scores
exceeding 90.
(d) Find the highest marks attained by a student whose name
commences with 'A' and concludes with 't'.
(e) Write an SQL query to enhance the grades of students in
Department no. 101 by 5%.
13 Explain: Association, Aggregation, Generalization and Specialization 2U

Submission Deadline: 16-12-2023


Note: No submission will be accepted after the deadline.

You might also like