Special DBMS CIA-1 SOLUTION by Prince Verma 209910030073

Download as docx, pdf, or txt
Download as docx, pdf, or txt
You are on page 1of 3

Roll No.

JSS MAHAVIDYAPEETHA
JSS ACADEMY OF TECHNICAL EDUCATION, NOIDA
DEPARTMENT OF INFORMATION TECHNOLOGY

AY 2022-23 (Odd Semester)


Special CIA-1
Course : B.Tech Date : 22/12/2022
Semester : V Subject Code : KCS-501
Subject : Database Management System Max. Marks : 50
Time : 1 ½ hrs=90 min

COURSE OUTCOMES
CO1 Describe the features of a database system and its application and compare various types of data models.
CO2 Construct an ER Model for a given problem and transform it into a relational database schema.
CO3 Formulate solutions to a query problem using SQL Commands, relational algebra, tuple calculus, and domain calculus.
CO4 Explain the need of normalization and normalize a given relation to the desired normal form.
CO5 Explain different approaches of transaction processing and concurrency control.

Section-A
Attempt all the questions of this section (2X10=20)
BL/
Q. No. Question Marks CO
KC*
1. a Explain different Features of SQL. 2 CO1 BL1
SQL was firstly developed by IBM for querying and altering relational databases, using
declarative statements.SQL became a standard of the American National Standards
Institute (ANSI) in 1986, and of the International Organization for Standardization (ISO)
in 1987. Although it is often called a “query language”,  SQL is much more than that. SQL
can define data structure, modify data in a database, specify security constraints, and can
perform many more tasks such as
 SQL can retrieve data from a database
 SQL can insert records in a database
 SQL can update records in a database 
 SQL can delete records from a database
 SQL can create new databases 
 SQL can create new tables in a database 
 SQL can create stored procedures in a database 
 SQL can create views in a database 
 SQL can set permissions on tables, procedures, and views
 SQL can execute queries against a database

b Differentiate between aggregation and generalization 2 CO1 BL2


The main difference between Aggregation and Generalization in UML is that Aggregation
is an association of two objects that are connected with the “has a” relationship while
Generalization is the process of forming a general class from multiple classes.

It is not possible to develop complex software at once. Therefore, it is necessary to


understand what the software should perform before implementing them. Unified
Modelling Language (UML) is a visual diagramming language that helps to model
software. It is different and easier than programming languages such as Java and C++. As
it provides a pictorial representation, even a non-technical person can learn and understand
UML. Class and object diagram are two types of UML diagrams. Moreover, they describe
the static view of the system. Aggregation and generalization are related to these
diagrams.
c List any four anomalies associated with RDBMS. 2 CO1 BL1
A database anomaly is an inconsistency in the data resulting from an operation like an
update, insertion, or deletion. There can be inconsistencies when a record is held in
multiple places and not all of the copies are updated.

Anomalies occur when the data present in the database has too much redundancy and if the
tables making up the database are poorly constructed
Roll No.
JSS MAHAVIDYAPEETHA
JSS ACADEMY OF TECHNICAL EDUCATION, NOIDA
DEPARTMENT OF INFORMATION TECHNOLOGY

d Distinguish between Schema and Instance. 2 CO1 BL2


e Explain the purpose of foreign key. 2 cCO1 BL1
f Define logical data independence. 2 cCO2 BL1
g Let a Relation R have attributes {a1, a2, a3, a4…. an} and the candidate key is “a1a2 and CO2 BL2
2
c

a1a3” then the possible number of super keys?


h Write Advantages of Database over File system 2 cCO2 BL1
i Give example of the Primary Key, Super Key, Foreign Key and Candidate key with CO2 BL1
2
c

example.
j Explain Referential Integrity Constraint. 2 cCO2 BL2
Section-B
Attempt all the questions of this Section (5X4=20)
When is the concept of weak entity used in data modelling? Define the terms owner entity,
weak entity, identifying relationship, partial key.
OR BL2
Explain the overall structure of DBMS with suitable example.

2 5

cCO1
Explain different levels of data abstraction. Distinguish between Physical Data
C

Independence and Logical Data Independence. BL2


OR

5
3

CO1
Explain the concepts Domain Constraint, Key Constraint and Entity Integrity Constraint
with example.
Specify the following queries in relational algebra:
Supplier (sid, sname, address)
Part (sid, pname, color)
Catalog (sid, pid, cost)
(i) Find names of supplier who supply some red or green part.
(ii) Find the sids of suppliers who supply every part.
4 (iii) Find sids of supplier who supply some red or green parts. 5 CO2 BL3

OR
Let the following relation schemes be given: R= (A, B, C, D); S= (D, E, F) let relations
r(R) and s(S) be given. Given an expression in SQL that is equivalent to each of the
following:
ΠA(r) (ii) σB=17 (r) (iii) r x s
Roll No.
JSS MAHAVIDYAPEETHA
JSS ACADEMY OF TECHNICAL EDUCATION, NOIDA
DEPARTMENT OF INFORMATION TECHNOLOGY

Draw an ER diagram of Hospital or Bank with showing the Specialization, Aggregation,


Generalization.
OR
5 5 CO2 BL2
Draw an E-R diagram for a small marketing company database, assuming your own data
requirement with explanation.

Section-C
Attempt all the questions of this Section (10X1=10)
Compute the closure of the following set F of functional dependencies for relation schema
R=(A, B, C, D, E)
ABC, CDE, BD, EA
6 OR 10 CO3 BL3
Consider a relation scheme R = (A, B, C, D, E, H) on which the following functional
dependencies hold: {AB, BCD, EC, DA}. Find out the candidate keys of schema
R with explanation.

You might also like