You are here: Home > Computer Science CSE
All posts from

CS1301 DataBase Management Systems B.E Question Bank : niceindia.com

Name of the College : Noorul Islam College of Engineering
University : Anna University
Degree : B.E
Department : Computer Science and Engineering
Subject Code/Name : CS 1301 – DataBase Management Systems
Document Type : Question Bank
Website : niceindia.com

Download :https://www.pdfquestion.in/uploads/ni…nt_Systems.pdf

NICE Data Base Management Systems Question Paper

1. What is DBMS and what’s the goal of it? :
DBMS is a collection of interrelated data and a set of programs to access that data. The goal is to provide the environment that is both convenient and efficient to use in retrieving and storing data base information.

Related : Noorul Islam College of Engineering XCS352 Theory of Computation M.Sc Question Bank : www.pdfquestion.in/3142.html 

2. What are the advantages of DBMS? :
** Centralized Control
** Data Independence allows dynamic change and growth potential.
** Data Duplication is eliminated with control Redundancy.
** Data Quality is enhanced.

3. What are the Disadvantages of DBMS? :
** Cost of software, hardware and migration is high.
** Complexity of Backup
** Problem associated with centralization.

4. What are the disadvantages of File Systems? :
** Data Redundancy and Inconsistency.
** Difficulty in accessing data.
** Data Isolation
** Integrity problems
** Security Problems
** Concurrent access anomalies

5. Define Entity, Entity Set, and extensions of entity set. Give one example for each.
** Entity – object or thing in the real world. Egs., each person, book, etc.
** Entity set – set of entities of the same entity that share the same properties or attributes. Eg., Customer, loan, account, etc
** Extensions of entity set – individual entities that constitute a set. Eg., individual bank customers

6. Define and give examples to illustrate the four types of attributes in database.
Simple and Composite attribute :
Simple (address)
Composite (street, city, district)

Single-valued and multi-valued attribute :
Single-valued (roll no)
Multi-valued (colors = {R,B,G})

Null attribute :
No values for attribute

Derived attribute :
Age derived from Birth date

7. Define relationship and participation.
** Relationship is an association among several entities.
** Association between entity sets is referred as participation.

8. Define mapping cardinality or cardinality ratio.
Mapping cardinality or cardinality ratio is the way to express the number of entities to which another entity can be associated through a relationship set. These are most useful in describing binary relationship sets.

9. Explain the four types of mapping cardinality with example.
For a binary relationship set R between entity sets A and B, the mapping cardinality must be one of the following : (Draw the diagrams also)

One-to-one :
An entity in A is associated with at most one entity in B and an entity in B is associated with at most one entity in A. Eg., Roll no entity in Student info entity set and marks details entity set.

One-to-many :
An entity in A is associated with any number of entities in B. But an entity in B is associated with at most one entity in A. Eg., one customer with many loans.

Many-to-one :
An entity in A is associated with at most one entity in B. But an entity in B can be associated with any number of entities in A. Eg., street and city associated to a single person.

Many-to-many
An entity in A is associated with any number of entities in B. But an entity in B can be associated with any number of entities in A. Eg., same loan by several business partners.

10. Differentiate total participation and partial participation. (i.e., write Definition and Example with illustration)
** Total – participation of an entity set, E in relationship, R is total if every entity in E participates in at least one relationship in R. Eg., loan entity set.
** Partial – if only some entities in E participate in R. Eg., payment weak entity set.

11. Define E-R diagram :
Overall structure of a database can be expressed graphically by E-R
diagram for simplicity and clarity.

12. Define weak Entity set. Give an example and explain why it is weak entity set.
** Entity set with no sufficient attributes to form a primary key. Payment entity set is weak since duplication exists

13. Define discriminator or partial key of a weak entity set. Give example.
Set of attributes that allow distinction to be made among all those entities in the entity set that depend on one particular strong entity. Eg., payment_no in payment entity set. It is also called as partial key.

14. Explain Referential Integrity.
Referential Integrity means relationship between tables. Foreign keys are used. Foreign key is the column whose values are derived from the Primary key of the same or some other table.

Format for creating a foreign key is given below :
Syntax : create table <table name>(columnname data type (size) constraint
constraint_name references parent table name);

15. Define Instances and schemas.
Instances :
The collection of information stored in the database at a particular moment is called the instance of the database.

Schemas :
The overall design of the database is called the schema of the database.

Leave a Reply

How to add comment : 1) Type your comment below. 2) Type your name. 3) Post comment.

www.pdfquestion.in © 2021

Contact Us   Privacy Policy   SiteMap