B.E./B.Tech.

DEGREE EXAMINATION, NOVEMBER/DECEMBER 2012

Fourth Semester
Computer Science and Engineering
CS 2255/141405/CS 46/CS 1254/10144 CS 406/080250009 — DATABASE MANAGEMENT
SYSTEMS
(Common to Information Technology)
(Regulation 2008)
(Common to PTCS 2255 – Database Management Systems for B.E. (Part-Time) for Third
Semester – Computer Science and Engineering (Regulation 2009))
Time : Three Hours                                                          Maximum : 100 marks
Answer ALL Questions
PART A – (10 X 2 = 20 marks)

1. Distinguish the terms primary key and super key.

2. Specify the difference between physical and logical data independence.
3. Mention the six fundamental operations of relational algebra and their symbols.
4. List two reasons why null values might be introduced into the database.
5. Define Multivalued dependency.
6. Show that, if a relational database is in BCNF, then it is also in 3NF.
7. Write down the SQL facilities for recovery.
8. State the write-ahead log rule. Why is the rule necessary?
9. What can be done to reduce the occurrence of bucket overflows in a hash file
organization?
10. How might the type of index available influence the choice of a query processing
strategy?

PART B – (5 X 16 = 80 marks)

11. (a) (i) Discuss in detail about the major disadvantages of file-processing system.
(6)
(ii) Explain in detail about different data models with neat diagram.(10)
Or
(b) Draw an E-R diagram for a Life insurance company with almost all components and
explain.(16)
12. (a) Give an introduction to Distributed Database and Client/Server database.(16)
Or
(b) Illustrate the uses of Embedded SQL and Dynamic SQL with suitable examples.(16)
13. (a) Explain in detail about all functional dependencies based normal forms with
suitable examples.(16)
Or
(b) Describe about the Join Dependencies and Fifth normal form with suitable
example.(16)
14. (a) Discuss in detail about transaction concepts and two phase commit protocol.
(16)
Or
(b) Write down in detail about intent locking and isolation levels.(16)
15. (a) Jot down detailed notes on ordered indices and B-Tree index files.(16)
Or
(b) Describe in detail about RAID and Tertiary storage.(16)
 B.E./B.Tech. DEGREE EXAMINATION, APRIL/MAY 2010
Fourth Semester
Computer Science and Engineering
CS2255 — DATABASE MANAGEMENT SYSTEMS
(Common to Information Technology)
(Regulation 2008)
Time: Three hours Maximum: 100 Marks
Answer ALL Questions
PART A — (10 × 2 = 20 Marks)
1. Explain the basic structure of a relational database with an example.
2. What are the functions of a DBA?
3. Give the usage of the rename operation with an example.
4. What do you mean by weak entity set?
5. What is normalization?
6. Write a note on functional dependencies.
7. What do you mean by a transaction?
8. Define the term ACID properties.
9. Describe flash memory.
10. List out the physical storage media.
PART B — (5 × 16 = 80 Marks)
11. (a) (i) Discuss the various disadvantages in the file system and explain
how it can be overcome by the database system. (6)
(ii) What are the different Data models present? Explain in detail. (10)
Or
(b) (i) Explain the Database system structure with a neat diagram. (10)
(ii) Construct an ER diagram for an employee payroll system. (6)
12. (a) (i) Explain the use of trigger with your own example. (8)
(ii) Discuss the terms Distributed databases and client/server
databases. (8)
Or
(b) (i) What is a view? How can it be created? Explain with an example. (7)
(ii) Discuss in detail the operators SELECT, PROJECT, UNION with
suitable examples. (9)
13. (a) Explain 1NF, 2NF and 3NF with an example. (16)
Or
(b) Explain the Boyce-Codd normal form with an example. Also state how it
differs from that of 3NF. (16)
14. (a) (i) How can you implement atomicity in transactions? Explain. (8)
(ii) Describe the concept of serilalizability with suitable example. (8)
Or
(b) How concurrency is performed? Explain the protocol that is used to
maintain the concurrency concept. (16)
15. (a) What is RAID? Explain it in detail. (16)
Or
(b) Mention the purpose of indexing. How this can be done by B+ tree?
Explain. (16)
 B.E./B.Tech. DEGREE EXAMINATION, NOVEMBER/DECEMBER 2011.
Fourth Semester
Computer Science and Engineering
CS 2255 — DATABASE MANAGEMENT SYSTEMS
(Common to Information Technology)
(Regulation 2008)
Time : Three hours                                                             Maximum : 100 marks
Answer ALL questions.
PART A — (10 × 2 = 20 marks)
1. What is a data model?
2. With an example explain what a derived attribute is?
3. Consider the following relation :
EMP (ENO, NAME, DATE_OF_BIRTH, SEX, DATE_OF_JOINING, BASIC_PAY,
DEPT) Develop an SQL query that will find and display the average BASIC_PAY in
each DEPT.
4. List the two types of embedded SQL SELECT statements.
5. Consider the following relation :
R (A, B, C, D, E)
The primary key of the relation is AB. The following functional
dependencies hold :
A →C
B →D
AB →E 
Is the above relation in second normal form?
6. Consider the following relation : R(A, B, C, D)
The primary key of the relation is A. The following functional dependencies
hold :
A →B,C 
B →D 
Is the above relation in third normal form?
7. List the two commonly used Concurrency Control techniques.
8. List the SQL statements used for transaction control.
9. What are ordered indices?
10. Distinguish between sparse index and dense index.
PART B — (5 × 16 = 80 marks)
11. (a) (i) Construct an E-R diagram for a car-insurance company
whose customers own one or more cars each. Each car has associated with it
zero to any number of recorded accidents. State any assumptions you make. (6)
(ii) A university registrar’s office maintains data about the following entities :
(1) Courses, including number, title, credits, syllabus, and prerequisites;
(2) Course offerings, including course number, year,
semester, section number, instructor, timings, and classroom;
(3) Students, including student-id, name, and program; and
(4) Instructors, including identification number, name,
department, and title. Further, the enrollment of students in courses and grades
awarded to students in each course they are enrolled for must be appropriately
modeled. Construct an E-R diagram for the registrar’s office. Document all
assumptions that you make about the mapping constraints. (10)
Or
(b) (i) With a neat sketch discuss the three-schema architecture of a DBMS. (8)
(ii) What is aggregation in an ER model? Develop an ER diagram using
aggregation that captures the following information : 
Employees work for projects. An employee working for a particular project uses
various machinery. Assume necessary attributes. State any assumptions you
make. Also discuss about the ER diagram you have designed. (2 + 6)
12. (a) (i) Explain the distinctions among the terms primary key, candidate key,
and super key. Give relevant examples. (6)
(ii) What is referential integrity? Give relevant example. (4)
(iii) Consider the following six relations for an Order-processing Database
Application in a Company :
CUSTOMER (CUSTNO, CNAME, CITY)
ORDER (ORDERNO, ODATE, CUSTNO, ORD_AMT)
ORDER_ITEM (ORDERNO, ITEMNO, QTY)
ITEM (ITEMNO, ITEM_NAME, UNIT_PRICE)
SHIPMENT (ORDERNO, ITEMNO, WAREHOUSENO,
SHIP_DATE)
WAREHOUSE (WAREHOUSENO, CITY)
Here, ORD_AMT refers to total amount of an order; ODATE is the date the order
was placed; SHIP_DATE is the date an order is shipped from the warehouse.
Assume that an order can be shipped from several warehouses. Specify the
foreign keys for
this schema, stating any assumptions you make. (6)
Or
(b) With relevant examples discuss the various operations in Relational Algebra.
(16)
13. (a) Define a functional dependency. List and discuss the six inference rules
for functional dependencies. Give relevant examples. (16)
Or
(b) (i) Give a set of Functional dependencies for the relation schema R(A,B,C,D,E)
with primary key AB under which R is in 2NF but not in 3NF. (5)
(ii) Prove that any relation schema with two attributes is in BCNF.(5)
(iii) Consider a relation R that has three attributes ABC. It is decomposed into
relations R1 with attributes AB and R2 with attributes BC. State the definition of
lossless-join decomposition with respect to this example. Answer this question
concisely by
writing a relational algebra equation involving R, R1, and R2. (6)
14. (a) (i) Define a transaction. Then discuss the following with
relevant examples : (8)
(1) A read only transaction
(2) A read write transaction
(3) An aborted transaction
(ii) With a neat sketch discuss the states a transaction can be in. (4)
(iii) Explain the distinction between the terms serial schedule and serializable
schedule. Give relevant example. (4)
Or
(b) (i) Discuss the ACID properties of a transaction. Give relevant example. (8)
(ii) Discuss two phase locking protocol. Give relevant example. (8)
15. (a) (i) When is it preferable to use a dense index rather than a sparse index?
Explain your answer. (4)
(ii) Since indices speed query processing, why might they not be kept on several
search keys? List as many reasons as possible.(6)
(iii) Explain the distinction between closed and open hashing. Discuss the relative
merits of each technique in database applications. (6)
Or
(b) Diagrammatically illustrate and discuss the steps involved in processing a
query.(16)

B.E./B.Tech. DEGREE EXAMINATION, NOVEMBER/DECEMBER 2010

Fourth Semester
Computer Science and Engineering
CS 2255 — DATABASE MANAGEMENT SYSTEMS
(Common to Information Technology)
(Regulation 2008)
Time : Three hours Maximum : 100 Marks
Answer ALL questions
PART A — (10 × 2 = 20 Marks)
1. Define the two levels of data independence.
2. Write down any two major responsibilities of a database administrator.
3. List out the various relational algebra operators.
4. What are the four broad categories of constraints?
5. Define irreducible sets of dependencies.
6. Define the third normal form.
7. What are ACID properties?
8. What are the three kinds of intent locks?
9. Which are the factors to be considered for the evaluation of indexing and
hashing techniques?
10. What is the drawback of flash memory?
PART B — (5 × 16 = 80 Marks)
11. (a) Explain the three different groups of data models with examples. (16)
Or
(b) Describe the components of entity-relationship diagram with suitable
examples. (16)
12. (a) Describe the features of Embedded SQL and Dynamic SQL. Give suitable
examples. (16)
Or
(b) Write short notes on the following :
(i) Mandatory access control. (9)
(ii) Missing information. (7)
13. (a) Explain non loss decomposition and functional dependencies with
suitable example. (16)
Or
(b) Discuss Join Dependencies and Fifth Normal Form, and explain why
5NF? (16)
14. (a) (i) State the Two-Phase Commit protocol. Discuss the implications of a
failure of the coordinator and some participants. (10)
(ii) Briefly explain transaction recovery with primitive operations. (6)
Or
(b) (i) State and explain the three concurrency problems. (9)
(ii) What is meant by isolation level and define the five different
isolation levels. (7)
15. (a) (i) Discuss the improvement of reliability and performance of RAID (8)
(ii) Explain the structure of a B+-tree. (8)
Or
(b) Explain the complex selection predicates with example. (16)