A7-R4/B2.

2-R4 : INTRODUCTION TO DATABASE MANAGEMENT

SYSTEMS

•flÁœ — 03 ÉÊ¥≈U •Áœ∑§Ã◊ •¥∑§ — 100

DURATION : 03 Hours MAXIMUM MARKS : 100

•Ê∞◊•Ê⁄U ‡ÊË≈U ‚¥. —

OMR Sheet No. :
⁄UÊ‹ Ÿ¥. — ©ûÊ⁄U-¬ÈÁSÃ∑§ÊU ‚¥. —
Roll No. : Answer Sheet No. :
¬⁄UˡÊÊÕ˸ ∑§Ê ŸÊ◊ — ¬⁄UˡÊÊÕ˸ ∑§ „SÃÊˇÊ⁄U —
Name of Candidate : ____________________________________________;Signature of Candidate : __________________

¬⁄UˡÊÊÁÕ¸ÿÊ¥ ∑§ Á‹∞ ÁŸŒ¸‡Ê — Instructions for Candidate :

∑Χ¬ÿÊ ¬˝‡Ÿ-¬ÈÁSÃ∑§Ê, •Ê∞◊•Ê⁄U ‡ÊË≈U ∞fl¥ ©ûÊ⁄U-¬ÈÁSÃ∑§Ê ◊¥ ÁŒÿ ª∞ Carefully read the instructions given on Question Paper,
ÁŸŒ¸‡ÊÊ¥ ∑§Ê äÿÊŸ¬Ífl¸∑§ ¬…∏¥– OMR Sheet and Answer Sheet.

¬˝‡Ÿ-¬ÈÁSÃ∑§Ê ∑§Ë ÷Ê·Ê •¥ª˝¡Ë „Ò– ¬⁄UˡÊÊÕ˸ ∑§fl‹ •¥ª˝¡Ë ÷Ê·Ê ◊¥ „Ë Question Paper is in English language. Candidate can
©ûÊ⁄U Œ ‚∑§ÃÊ „Ò– answer in English language only.

ß‚ ◊ÊÚ«˜UÿÍ‹/¬¬⁄U ∑§ ŒÊ ÷ʪ „Ò¥– ÷ʪ ∞∑§ ◊¥ øÊ⁄U ¬˝‡Ÿ •ÊÒ⁄U ÷ʪ There are TWO PARTS in this Module/Paper. PART ONE
ŒÊ ◊¥ ¬Ê°ø ¬˝‡Ÿ „Ò¥– contains FOUR questions and PART TWO contains FIVE
questions.

÷ʪ ∞∑§ ““flÒ∑§ÁÀ¬∑§”” ¬˝∑§Ê⁄U ∑§Ê „Ò Á¡‚∑§ ∑ȧ‹ •¥∑§ 40 „Ò ÃÕÊ PART ONE is Objective type and carries 40 Marks.
÷ʪ ŒÊ ““√ÿÁÄì⁄U∑§”” ¬˝∑§Ê⁄U ∑§Ê „Ò •ÊÒ⁄U ß‚∑§ ∑ȧ‹ •¥∑§ 60 „Ò– PART TWO is Subjective type and carries 60 Marks.

÷ʪ ∞∑§ ∑§ ©ûÊ⁄U, •Ê∞◊•Ê⁄U ©ûÊ⁄-¬ÈÁSÃ∑§Ê ¬⁄U „Ë ÁŒÿ ¡ÊŸ „Ò¥– PART ONE is to be answered in the OMR ANSWER
÷ʪ ŒÊ ∑§Ë ©ûÊ⁄U-¬ÈÁSÃ∑§Ê ◊¥ ÷ʪ ∞∑§ ∑§ ©ûÊ⁄U Ÿ„Ë¥ ÁŒÿ ¡ÊŸ øÊÁ„∞– SHEET only. PART ONE is NOT to be answered in the
answer book for PART TWO.

÷ʪ ∞∑§ ∑§ Á‹∞ •Áœ∑§Ã◊ ‚◊ÿ ‚Ë◊Ê ∞∑§ ÉÊá≈UÊ ÁŸœÊ¸Á⁄Uà ∑§Ë ªß¸ Maximum time allotted for PART ONE is ONE HOUR.
„Ò– ÷ʪ ŒÊ ∑§Ë ©ûÊ⁄U-¬ÈÁSÃ∑§Ê, ÷ʪ ∞∑§ ∑§Ë ©ûÊ⁄U-¬ÈÁSÃ∑§Ê ¡◊Ê Answer book for PART TWO will be supplied at the table
∑§⁄UÊŸ ∑§ ¬‡øÊØ ŒË ¡Ê∞ªË– ÃÕÊÁ¬, ÁŸœÊ¸Á⁄Uà ∞∑§ ÉÊ¥≈U ‚ ¬„‹ when the Answer Sheet for PART ONE is returned.
÷ʪ ∞∑§ ¬Í⁄UÊ ∑§⁄UŸ flÊ‹ ¬⁄UˡÊÊÕ˸ ÷ʪ ∞∑§ ∑§Ë ©ûÊ⁄U-¬ÈÁSÃ∑§Ê ÁŸ⁄UˡÊ∑§ However, Candidates who complete PART ONE earlier
∑§Ê ‚ÊÒ¥¬Ÿ ∑§ ÃÈ⁄¥Uà ’ÊŒ, ÷ʪ ŒÊ ∑§Ë ©ûÊ⁄U-¬ÈÁSÃ∑§Ê ‹ ‚∑§Ã „Ò¥– than one hour, can collect the answer book for PART TWO
immediately after handing over the Answer Sheet for
PART ONE to the Invigilator.

¬⁄UˡÊÊÕ˸, ©¬ÁSÕÁÃ-¬ÁòÊ∑§Ê ¬⁄U „SÃÊˇÊ⁄U Á∑§∞ Á’ŸÊ •ÊÒ⁄U •¬ŸË Candidate cannot leave the examination hall/room
©ûÊ⁄U-¬ÈÁSÃ∑§Ê, ÁŸ⁄UˡÊ∑§ ∑§Ê ‚ÊÒ¬¥  Á’ŸÊ, ¬⁄UˡÊÊ „ÊÚ‹/∑§◊⁄UÊ Ÿ„Ë¥ ¿UÊ« ∏ without signing on the attendance sheet and handing over
‚∑§Ã „Ò–¥ ∞‚Ê Ÿ„Ë¥ ∑§⁄UŸ ¬⁄U, ¬⁄UˡÊÊÕ˸ ∑§Ê ß‚ ◊ÊÚ«U˜ ÿ‹Í /¬¬⁄U ◊¥ his/her Answer Sheet to the invigilator. Failing in doing
so, will amount to disqualification of Candidate in this
•ÿÊÇÿ ÉÊÊÁ·Ã ∑§⁄U ÁŒÿÊ ¡Ê∞ªÊ–
Module/Paper.

¬˝‡Ÿ-¬ÈÁSÃ∑§Ê ∑§Ê πÊ‹Ÿ ∑§ ÁŸŒ¸‡Ê Á◊‹Ÿ ∑§ ¬‡øÊØ ∞fl¥ ©ûÊ⁄U Á‹πŸÊ After receiving the instruction to open the booklet and
•Ê⁄Uê÷ ∑§⁄UŸ ‚ ¬„‹ ©ê◊ËŒflÊ⁄U ¡Ê°ø ∑§⁄U ÿ„ ‚ÈÁŸÁ‡øà ∑§⁄U ‹¥ Á∑§ before starting to answer the questions, the candidate should
¬˝‡Ÿ-¬ÈÁSÃ∑§Ê ¬˝àÿ∑§ ŒÎÁc≈U ‚ ‚¥¬Íáʸ „Ò– ensure that the Question Booklet is complete in all respect.

¡’ Ã∑§ •Ê¬‚ ∑§„Ê Ÿ ¡Ê∞, Ã’ Ã∑§ ¬˝‡Ÿ-¬ÈÁSÃ∑§Ê Ÿ πÊ‹ ¥–

DO NOT OPEN THE QUESTION BOOKLET UNTIL YOU ARE TOLD TO DO SO.
 PART ONE 1.4 Which of the following are the properties
of entities ?
(Answer all the questions)
(A) Groups
1. Each question below gives a multiple
choice of answers. Choose the most (B) Tables
appropriate one and enter in the “OMR”
(C) Attributes
answer sheet attached to the question
paper, following instructions therein. (D) Switchboards
(1x10)

1.1 The candidate key is that you choose to 1.5 Which of the following is not a binary
identify each row uniquely is called operator in relational algebra ?
__________.
(A) Join
(A) Alternate Key
(B) Semi-join
(B) Primary Key
(C) Assignment
(C) Foreign Key
(D) project
(D) None of the above

1.6 Which of the following is/are the DDL

1.2 __________ is the process of organizing statements ?
data into related tables.
(A) Create
(A) Normalization
(B) Drop
(B) Generalization
(C) Alter
(C) Specialization
(D) All of the above
(D) None of the above

1.7 Which of the following operation is used

1.3 __________ is the complex search criteria to update the structure of the database
in the where clause. table ?
(A) Substring (A) Alter
(B) Drop Table (B) Update
(C) Predict (C) Change
(D) Predicate (D) None of the above

Page 2 SPACE FOR ROUGH WORK A7-R4/B2.2-R4-09-21

1.8 The RDBMS terminology for a row is : 2. Each statement below is either TRUE or
FALSE. Choose the most appropriate one
(A) Tuple and ENTER in the “OMR” answer sheet
attached to the question paper, following
(B) Relation instructions therein.
(1x10)
(C) Attribute
2.1 De-Morgans's law is used to simplify
(D) Degree complex constraints.

2.2 If table is in 1NF and does not have a

composite key, then it is in 2NF.
1.9 A primary key if combined with a foreign
key creates :
2.3 A primary key does not necessarily have
(A) Parent-Child relationship between to be unique for a given table.
the tables that connect them
2.4 Multiple constraints can be included in the
(B) Many to many relationship between single query.
the tables that connect them

(C) Network model between the tables 2.5 Data and metadata are the same.
that connect them
2.6 In a growing phase, a transaction acquires
(D) None of the above all the required locks.

2.7 Rollback is the preferred way to recover a

1.10 In an ER diagram, __________ is described database after a system failure.
in the database by storing its data.
2.8 It is easy to grant and manage common
(A) Attribute privileges needed by different groups of
database users using the roles.
(B) Entity

(C) Relationship 2.9 The SQL is strongly typed.

(D) Notation 2.10 A key is a group of one or more attributes

that uniquely identifies a row.

Page 3 SPACE FOR ROUGH WORK A7-R4/B2.2-R4-09-21

3. Match words and phrases in column X with the closest related meaning/word(s)/phrase(s)
in column Y. Enter your selection in the “OMR” answer sheet attached to the question
paper, following instructions therein. (1x10)

X Y

3.1 WFF stands for A. Domain

3.2 UML stands for B. Network model

__________is a meaning of D in
3.3 C. Dashed ellipse
ACID properties of transactions.
A set of possible data values is
3.4 D. Triangle
called

3.5 Another name for weak entity E. Self join

3.6 Record based logical model F. Well-formed formulae

In ER Diagram derived attributes

3.7 G. Durability
are represented by

The method of access which uses Unified modeling

3.8 H.
key transformation is known as language

3.9 A table joined with itself is called I. Distance

3.10 Normalization J. Child

K. Hash

L. External model

Reduces data redundancy in

M.
a database

Page 4 SPACE FOR ROUGH WORK A7-R4/B2.2-R4-09-21

4. Each statement below has a blank space to fit one of the word(s) or phrase(s) in the list
below. Enter your choice in the “OMR” answer sheet attached to the question paper,
following instructions therein. (1x10)

A. Set-difference B. Model of relation C. Derived

D. MOD E. IN F. Single valued

G. SELECT H. Role I. Committed

J. Thing in real world K. Alter L. Atomicity

M. Delete

4.1 Querying database tables is done by using the __________ statement of SQL.

4.2 The __________ operator is used to compare a value to a list of literals values that have
been specified.

4.3 __________ function divides one numeric expression by another and returns the
Remainder.

4.4 __________ statement in SQL which allows to change the definition of a table.

4.5 The __________ operation, denoted by – allows us to find tuples that are in one relation
but are not in another.

4.6 Entity is a __________.

4.7 The function that an entity plays in a relationship is called that entity's __________.

4.8 The attribute AGE is calculated from DATE_OF_BIRTH. The attribute AGE is
__________.

4.9 In order to maintain the consistency during transactions, database provides __________.

4.10 A transaction completes its execution is said to be __________.

Page 5 SPACE FOR ROUGH WORK A7-R4/B2.2-R4-09-21

 PART TWO 8. (a) What is a referential integrity
constraint ? Why do we need it ?
(Answer any FOUR questions) Explain with the help of suitable
example.

(b) Differentiate between GRANT and

5. (a) Explain database system along with REVOKE command.
its benefits. (c) Consider the following tables :
Employee (Emp_no, Name,
(b) What is data dependence ? Explain
Emp_city) Company (Emp_no,
physical data dependence and
Company_name, Salary)
logical data dependence.
(i) Write a SQL query to display
(c) What is Normalization ? Employee name and Company
Differentiate between 3NF and name.
BCNF. (5+5+5)
(ii) Write a SQL query to display
employee name, employee city,
company name and salary of
6. (a) Why keys are important in relational all the employees whose
model ? Write about candidate keys, salary > 10000.
primary keys, alternate key and (iii) Write a query to display all the
foreign key. employees working in "XYZ"
company. (5+4+6)
(b) Explain the role of DBA.

(c) Explain the purpose of the check 9. (a) Explain the concept of Deadlock
point mechanism. How often should avoidance and prevention in detail.
checkpoints be performed ?
(5+5+5) (b) Explain functional dependency
concepts.

(c) Draw ER diagram for Student

7. (a) Explain in detail about two-phase
Management System. (5+5+5)
commit protocol.

(b) What is Trigger in SQL ? Give an -o0o-

example to define a trigger.

(c) Briefly explain the various types of

joins. (5+5+5)

Page 6 SPACE FOR ROUGH WORK A7-R4/B2.2-R4-09-21

 SPACE FOR ROUGH WORK

Page 7 SPACE FOR ROUGH WORK A7-R4/B2.2-R4-09-21

 SPACE FOR ROUGH WORK

Page 8 SPACE FOR ROUGH WORK A7-R4/B2.2-R4-09-21