5635132

B.Tech. DEGREE EXAMINATION, NOVEMBER 2015.

Fifth Semester

Computer Science and Engineering

DATABASE MANAGEMENT SYSTEMS

(2013-2014 onwards)

Time: Three hours Maximum: 75 marks

PART A - (10 x 2 = 20 marks)

Answer ALL questions.

All questions carry equal marks.

1. How will you define an entity in ER model?

2. What is a view? Write the system to create a view.

3. Give examples for composite attribute.

4. How primary indices differ from secondary

indices?

5. What is the need for normalization?

6. Define functional dependency.

7. Define a transaction. UNIT III

8. What is serializability? 15. Explain the concept of 1st and 2nd normal forms
with examples. (11)
9. State the uses oflock.
Or
10. What is your understanding about atomicity?
16. Explain the concept of 3rd normal and BCNF with
PART B - (5 x 11 = 55 marks) examples. (11)
Answer ALL questions, ONE from each Unit.
UNIT IV
All questions carry equal marks.
17. Discuss the concept of query processing with an
UNIT I example. (11)
11. Discuss about the database system architecture Or
with a neat diagram. (11)
Or 18. Relate the uses of conflict serializability with
examples. (11)
12. List out the fundamental operations of relational
algebra with suitable examples. (11) UNIT V

UNIT II 19. State and explain the Two-phase locking protocol

with an example. (11)
13. Explain the concept of E-R model schema with
diagram. (11) Or

Or 20. Delineate a log. Discuss the uses of Log-based

recovery s.ystem. (11)
14. Infer the need of dynamic hashing over static
hashing and describe the concept of extendable
hashing. (11)

2 5635132 3 5635132
 4636166

B.Tech. DEGREE EXAMINATION, NOVEMBER 2015.

Sixth Semester

Computer Science and Engineering

DATABASE MANAGEMENT SYSTEMS

(2009-2012 Batches)

Time : Three hours Maximum: 75 marks

PART A - (10 x 2 = 20 marks)
Answer ALL questions.
All questions carry equal marks.

1. What is query language?

2. What is domain relational calculus?

3. .
Define ER diagram.·

4. What is assertion? Mention the forms available.

5. Give the measures of quality of a disk.

6. What is Sparse Index?

7. Define transaction?
8. What is a recovery scheme? UNIT IV

9. What is PostgreSQL. 17. Explain in details about Transactions. (11)

10. List any two examples of Oracle SQL extensions. Or

PART B - (5 x 11 = 55 marks) 18. Describe the Recovery System for .database

management systems. (11)
Answer ALL questions, ONE from each Unit.
'UNITV
All questions carry equalmarks.
19. Explain the Postgre SQL in details. (11)
UNIT I
Or
11. Explain in details about Relational Model (11)
20. Write detail notes on IBM DB2 Universal
Or Database. (11)
12. Elaborate the concept of Advanced SQL. (11)

. UNIT II

13. Explain the Fundamentals of Database Design

and E-R model. . (11)
Or
14. Describe about Relational Database Design. (11)

UNIT III

15. Explain in details about Storage and File

Structure. (11)
Or
16. Explain in details about Query Processing. (11)
2 4636166 3 4636166
 UNIT V 5635132
19. Give a brief note on Timestamp based protocol.
B.Tech. DEGREE EXAMINATION, APRIUMAY 2016.
Or Fifth Semester
Computer Science and Engineering
20. (a) Summarize the various types of storage
devices and compare its advantages and DATABASE MANAGEMENT SYSTEMS
disadvantages.
Time: Threehours Maximum: 75 marks
(b) Explain the difference between a system
PART A-'(10 x 2 = 20 marks)
crash and a disaster. (6)
Answer ALL questions.
All questions carry equal marks.
1. Write the two types of DML.
2. Write the SQL command for creating the table.
3, Define primary key and foreign key.
4. What is dynamic hashing?
5. Expand BCNF and define it.
6. What is functional dependency?
7. Define primary index and secondary index.
8. Expand 'ACID'.
9. 'Define fuzzy checkpoint.
10. Why concurrent access of a Database is necessary?
Give an example situation.

4 5635132

. <
 PART B - (5 x 11 = 55 marks) UNIT III

Answer ONE question from each Unit. 15. Redundancy in a relation introduces anamolies.
What are the possible anamolies due to
All questions carry equal marks.
redundancy and how would you control
UNIT I redundancy.

11. (a) List' the significant differences between a file Or

processing system and a DBMS. (6)
16. (a) Explain the features of good relational
(b) What are the functions of· database
administrator? (5) design. (4)
Or (b) Given a relation 'R', how will you identify
12. Explain the different basic operations in SQL with whether 'R' is in INF or 2NF. Give example.
example.

UNIT IV
UNIT II

13. Draw an ER diagram for the Banking enterprise 17. Explain any three j~int operations in the query
and explain the same. processing with steps.

Or
Or

14. (a) Compare and contrast ordered indexing and

18. (a) Explain briefly about serializability. (6)
hashing. (5) .
(b) Explain the storage and file structure in the (b) What are the different possible states of a db
database design. (6) during a transaction?

2 5635132 3 5635132
 4636166

B.Tech. DEGREE EXAMINATION, APRIUMAY 2016.

Sixth Semester
Computer Science and Engineering
DATABASE MANAGEMENT SYSTEMS

Time: Three hours Maximum: 75 marks

PART A - (10 x 2 = 20 marks)

Answer ALL questions.

All questions carry equal marks.

1. List out any four applications of DBMS.

2. Define instance and schema.

3. What is meant by canonical cover?

4. What do you mean by weak entity set?

5. Which level of RAID is best? Why?

6. Write the form of conjunctive and disjunctive

selection?

7. What are the ACID properties?

8. Differentiate between Shared Mode locks and UNIT III
Exclusive Mode locks.
15. How the files of fixed-length records are easy to
9. Write the various user interfaces in PostgreSQL? implement than files of variable-, length records?
Discuss in detail.
10.. Mention about the types of segment. Or

PART B - (5 x 11 = 55 marks) 16. List the different levels in RAID technology and
explain its features.
Answer ALL questions, ONE from each Unit. UNIT IV
All questions carry equal marks. 17. Discuss the ACID properties of a transaction. Give
relevant example.
UNIT I
Or
11. With a neat diagram, explain the structure of a
DBMS. 18. Describe the concept of serilalizability with
suitable example.
Or
UNIT V
12. With relevant examples discuss the various
operations in Relational Algebra. 19.
- Explain SQL variations and extensions in Oracle.
UNIT II Or

13. Describe the components of Entity-Relationship 20. Write short notes on:
diagram with suitable examples. (6)
(a) PostgreSQL System Architecture.
Or (b) PostgreSQL Type System. (5)
14. (a) What are the symbols used in E-R diagram
and give example. (5)
(b) Write short notes on URL and HTML. (6)
2 4636166 3 4636166
 5635132

B.Tech. DEGREE EXAMINATION,

NOVEMBERIDECEMBER 2016.
Fifth Semester
Computer Science and Engineering
DATABASE MANAGEMENT SYSTEMS
(2013-2014 onwards)
Time: Three hours Maximum: 100 marks
PART A- (fO x 2 = 20 marks)
1. What is a relational database system?

2. Defme 'View' in a database system.

3. What is dynamic hashing?

4. What is the need for using constraints m the

relational database system?

5. When will you say a given relation IS in first

normal form?

6. What is temporal data? Give an example.

7. Define atomicity.

8. What is serializability?
9. Why is concurrency control required in a database 14. (a) Discuss Transaction isolation and
system? transaction isolation levels.

10. What are the types of failures In database Or

systems? (b) Why Query optimization is done in Database
Systems and explain the process using an
PART B - (5 x 16 = 80 marks) example.
11. (a) Briefly explain the relational operations used 15. (a) Explain .how deadlocks are handled in .
in Query processing in relational database Database systems.
systems.
Or
Or (b) How a databas~ is recovered from failures?
(b) Give the syntax of Select, Insert, Delete and
Update SQL queries on a relational database
system.

12. (a) What is the applications of Indexing and

. Hashing in relational dat~base systems?

Or
(b) How Entity-Relationship modeling is done?
What are its notations? Give an example ER
model.

13. (a) How the normalization process decomposes a

relation? Explain using an example.

Or
(b) Set an example relation and explain
normalization upto BCNF using it.
2 5635132 3 5635132
 4636166

B.Tech. DEGREE EXAMINATION,

NOVEMBERIDECEMBER 2016.

Sixth Semester

Computer Science and Engineering

DATABASE MANAGEMENT SYSTEMS

(2009-2012 Batches)

Time : Three hours Maximum :75 marks

PART A - (10 x 2 = 20 marks)

Answer ALL questions. .

All questions carry equal marks.

1. Define Superkey.

2. What is schema diagram?

3. What is the use of entity relationship data

model?

4. Define Generalization.

5. What is static hashing?

6. What is query optimization?

·7. Define concurrency control policies. UNIT III

8. What is locking protocol? 15. Briefly explain RAID.

Or
9. Write any two features ofXML?
16. Discuss about Transformation of Relational
10. What is MQT?
Expression.

PART B - (5 x 11 = 55 marks) UNIT IV

Answer ALL questions, ONE from each Unit. 17. Explain Deadlock prevention and recovery system.

All questions carry equal marks. Or

UNIT I 18. Discuss with Buffer Management.

11. (a) Short notes in Data Definition in SQL. (5) UNIT V

(b) Discuss about set operation in SQL. (6) 19. Briefly explain Storage and Indexing in Oracle.
Or Or
12. (a) Discuss III detail about Function and 20. Explain query Processing and Optimization III
procedures in SQL. (6) SQL server.
(b) Short notes on Triggers in SQL. (5)

UNIT II

13. Discuss in detail about Extended E-R Features.

Or

14. Explain Application Security in SQL.

2 4636166 3 4636166
 4636166
B.Tech. DEGREE EXAMINATION,
APRILIMAY 2017.

Sixth Semester'

Computer Science

DATABASE MANAGEMENT SYSTEM

, (2009-12 batches)

Time: Three'hours Maximum: 75 marks

SECTION A - (10 x 2 = 20 marks)

Answer ALL qu~stion~.

1. What is meta data? '

2. What are the different types of attributes?

3. What is cardinality?

4. What is join dependency?

5. What' is the drawback of cost based

optimization?

6. What is the use of hash join?

..
, 7. What are the SQL statements usedfor transaction 13. (a) Describe the components of ER model.
end? . '
(b) What do you mean by aggregation? Explain.
8. Give any two modes in which a data item may be Or
locked. .
14. Explain the Boyce - Codd normal form.
9. List out the types of segments.
15. Describe the different levels of RAID and list out
10. What is the use of SQL profiler? the factors to be considered when choosing a RAID
, level.
SECTION B - (5 x 11,:= 55 marks)
Or
Answer ALL questions.
16. Explain cost-based optimization and Heuristic
optimiza tion.
11. If x and yare two relations as shown below:
17. Discuss the different forms of schedule
equivalence.

Or
FinD- (a) xuy
18. Explain the methods for dealing with the deadlock
(b) x-y problem.

(~) . xny 19. Explain how the oracle is configured .

(d) x >< y.
Or
Or
20. What are the tools provided by the SQL server to
12. (a) What are the advantages of SQL? help the application development process?

(b) What is view? Explain its uses.

2 4636166 3 4636166

..
, 5635132

B.Tech. DEGRE·E EXAMINATION,

APRILIMA Y 2017.
Fifth Semester
Computer Science and Engineering
DATABASE MANAGEMENT SYSTEMS
(2013-14 onwards)

Time: Three hours Maxim um : 75 marks

PART A - (10).< 2 = 20 marks)

Answer ALL questions.

All questions carry equal marks.

1. What is the difference between a candidate key

and the primary key for a given relatic;m?

l 2. What is a reeordid? given a record's id, how many

IIOs are needed to fetch it into main memory?

3. Distinguish between B-Tree and B+ Tree?

4. Define referential integrity.

5. What is query by example (QBE)?

6. Mention any two applications of triggers m a (a) Find the names of employees who have
borrowed all books published by McGraw-
database application.
Hill
7. Brief Boyce Codd Normal form (BCNF). (b) For each publisher, Find the names of
employees who have borrowed more than
8.' What is the goal of query optimization? Why is it five books of that publisher.
important?
Or
9. Define - Conflict Serialiability.
12. List the three design goals for relational
databases, and explain why each one of these
10: Brief any two deadlock handling mechanisms.
design goals is desirable.

PART B - (5 x 11 = 55 marks) UNIT II

Answer ALL questions, ONE from each Unit. 13. Design and explain an E-R diagram for keeping
track of the performance of your favorite sports
All questions carry equal mark~. team. One must store the matches played, the
scores in each match, the players in each match,
UNIT I and individual player statistics for each match.'
Summary statistics should be modeled as derived
11. Consider the following relational schema: attributes.

Employee (empno, name, office, age):

Or
Books(ISBN, title, authors, publisher)
14. Explain the distinction between open and closed
Loan(empn,o, ISBN, date) hashing. Discuss the relative merits, of each
Write the following queries in relational algebra: technique in database applications.

2 3 5635132
5635132
 UNIT III (3) Book is in 2NF and Collection is in 3NF
(4) Both Book and Collection are in 2NF
15. What are functional dependencies? Explain each only. (5)
of them with a suitable applicative example.
(b) Explain Nested Join, Hash Join and Merge
Join in SQL query plan. (6)
Or

16. Define normalization. Discuss the different normal Or

forms upto BCNF with suitable examples.
18. (a)' What is relational completeness? If a query
UNIT IV language is relationally complete, can you
write any desired query in that language? (6)
17. (a) Consider the following relational schemes for
(b) What is an unsafe query? Give an example
a library database: Book (Title, Author,
and explain why it is important to disallow
Catalog_no, Publisher,' Year, Price), such queries. (5)
Collection (Title, Author, .Catalog_no) With
the following functional dependencies: UNIT V
(i) Title Author -> Catalog_no
19. Discuss the key features of time-stamp locking
.(ii) Catalog_no -> Title Author Publisher protocol and explain the merits and demerits of
Year this concurrency control protocol in comparison
with two-phase locking protocol.
(iii) Publisher Title Year-> Price
Assume {Author, Title} is the key for both
Or
schemes. Which of the following statements
istrU:e? And justify your answer 20. Briefly answer the following questions:
(1) Both Book and Collection are in BCNF (a) How does the recovery. manager ensure-
Both Book and Collection are in 3NF atomicity of transactions? How does it
(2)
ensure durability?
only
4 5635132 5 5635132
(b) What is the difference between a system
crash and a media failure?
(c) Explain the WAL protocol.
(d) Describe the steal and no-force policies.

6 5635132
 4636166
,
B.Tech. DEGREE EXAMINATION, NOVEMBER 2017.

Sixth Semester

Computer Science and Engineering

DATABASE MANAGEMENT SYSTEMS

(2009 - 12 batches)

Time: Three hours Maximum: 75 marks

PART, A- (10 x 2 = 20 marks)

Answer ALL questions.

1. List the different categories of DBMS users.

2. What do you mean by view?

3. What are the two types of entities?

4. What.is full functional dependency?

5. Give the performance measures of disks.

6. What are the reasons for bucket overflow?

7. What is the use of shadow-copy scheme?

8. What are the types of errors that may cause a 13. (a) Describe the different types of index
transaction to fail? structure.

9. What are the types of triggers supported by Or

Oracle? (b) What do you .mean by pipelining? How can
you implement it?
10. List out the modes that are supported by DB2 for
Isolation. 14. (a) Describe the properties of transactions that
should be 'maintained inorder to ensure the
.integrity of the data.
,PART B - (5 x 11 = 55 marks)
•
Or
, Answer ALL questions.
(b) Explain, the architecture of remote backup
11. (a) Compare the three traditional data models. system. Also describe the issues that are
According to you, ~which IS the best model addressed m designing a remote backup
and why? system.

15. (a) .Explain how the oracle supports concurrency

Or
control and recovery techniques .
.(b) What are the different types of SQL
Or '
commands? Explain.
(b) Describe the features provided by IBM DB2
12. (a), With suitable example, explain the different for storing 'and indexing data.
mapping cardinalities.

"

(b) Explain the third normal form with an

example.

2 4636166 3 4636166
 5635132

B.Tech. DEGREE EXAMINATION, NOVEMBER 2017.

Fifth Semester

Computer Science and Engineering

DATABASE MANAGEMENT SYSTEMS

(2013 - 14 Onwards)

Time : Three hours Maximum: 75 marks

PART A - (10 x 2 = 20 marks)

Answer ALL questions.
1. What is data model?
2. Whatis referential integrity?
3. Draw an ER diagram for university database.
4. Define Hashing.
5. What is the need of normalization?
6. Define functional dependencies.
7. Define quer)' optimization.
8. List the steps involved in query processing.
9. What is multiple granularity?

. . 10. Define buffer management .

 PART B .; (5 x 11 = 55 marks) UNIT III .

Answer ALL units, choosing ONE question 15. Explain First and Boyce Coci.dnOl~malforms using
from each unit. functional dependencies. (11)

UNIT I Or

.11. What are the components of database system? 16. Explain decomposition using .multivalued
dependencies. • (11)
Explain in detail with a. neat diagram. (11)
UNIT IV
Or
17. Explain all types of join operations in query
processing. (11)
12. Explain SQL basic operation, set operations and
Or
null values with an example. (11)
18. Explain the components of query optimizer with
UNIT II example. (11)

. . UNIT V
13. Construct ER diagram for company schema, with
all role names included and with structural 19. Explain.the following:
(a) Deadlock handling. (4)
constraints on relationships specified using the
(b) Multiversion schemas. (4)
alternate notation (min, max). (11)
(c) Concurrency control. (3)
Or 'Or

14. Explain the following: 20. Explain the following:

(a) Recovery algorithm. (5)
.(a) Static and dynamic hashing. (5)

(b)
.
Bitmap indices. (6)
(b) Buffer management. (6)

2 5635132 3 5635132
 4636166' ,
1

B.Tech, DEGREE EXAMINATION, MAY 2018.

Sixth Semester

Computer Science and Engineering

DATABASE MANAGEMENT SYSTEMS

(2009-2012 batches)

Time: Three hours Maximum: 75 marks

PART A - (10 x 2 = 20 marks)

Answer ALL questions.

All questions carry equal marks.

, 1. What is RDBMS?Name any two popular RDBMS.

2. What is the aim of normalization?

3. What is composite key? Give example.

'4., What is functional dependency?

5. Define the term 'Entity'.

6. What is sub query? Give example.

7. Define Deadlock.
8. What is the use of commit command? UNIT III

9. State the features of Oracle. 15. Discuss in detail about the various types of data -
storage methods. Also state their advantages and
10. What is backend tool? Give examples. disadvantages.

PART B - (5 x 11 = 55 marks) Or

Answer ALL questions, ONE from each unit. 16. . Briefly explain about indexing and hashing.

All questions carry equal marks. UNIT IV

UNIT I 17.. Explain the various problems encountered during

multiple transactions running at the same time.
1i. Discuss the basic operations of relational algebra Or
with example.
18. Write short notes on Recovery principles.
Or
UNITV·
12. Explain the various DML commands with suitable
examples. 19. State and explain the features ofIBM DB2.

UNIT II Or

13. What are the major components of E-R diagram? 20.. Discuss about the Oracle data types ..
Explain with an example.

Or

14. What are the pitfalls of relational database

design? Explain.

2 4636166 3 4636166
 MT 921 NR
M.Tech. DEGREE EXAMINATION, MAY 2018.

Second Semester

Computer Science and Engineering

ADVANCES IN DATABASE SYSTEMS

Time : Three hours Maxim urn : 60 marks

Answer ALL units choosing set of questions

from each Unit.

All units carry equal marks.

UNIT I

1. Discuss the need of special database management

systems. Discuss these special databases with
advantages and disadvantages of each. (12)

Or

2. Explain role of database connectivity. Compare

JDBC and ODBC with suitable code segments. (12)
 UNIT II UNIT IV

(a) Define two-phase commit protocol. Discuss 7. Give the need for object-oriented DBMS. Discuss
3.
the role played by data object models in data
the properties of a Transaction. (6)
modelling. (12)
(b) Define optimization. Discuss methods of
Or
optimization. (6)
8. (a) Explain storage and access methods used in
Or object-oriented databases. (6)
(b) Discuss with suitable examples the various
4. Explain hashing and indexing in detail. How is it data access interface technologies. (6)
different from dynamic hashing? (12)
UNIT V
UNIT III
9. (a) What IS the significance of temporal
databases, and how are they different from
5. (a) Explain the underlying principles In the
embedded databases? (6) .
design of Distributed Database. (6)
(b) Discuss about parallel database and
(b) Discuss in detail the translation of queries in multimedia database with examples. (6)
Distributed Databases. (6)
Or

Or 10. (a) What is a scripting language? Explain how

PHP and Ruby can be used in database
6. (a) Discuss the management of distributed platforms. (6)
transactions. (6) (b) Differentiate data mining and data
warehousing, (6)
(b) Explain Concurrency Control and Recovery
in Distributed Databases. (6)

2 MT 921 NR 3 MT 921 NR
 UNIT III 5635132
15. .Define Normalization and explain different type~
of normalization with suitable example. B.Tech. DEGREE EXAMINATION, APRILIMAY 2018.

Or Fifth Semester
Computer Science and Engineering
16. List the three' design goals for relational
databases, and explain why each is desirable. DATABASE MANAGEMENT SYSTEMS

UNIT IV (2013-14o'nwards)

Time: Three hours .Maximuin : 75 marks

17., Explain sort-merge algorithm and compute the
cost analysis of the algorithm.
PART A - (10 x 2 = 20 marks)
Or
Answer ALL questions.
18. Explain how the concurrency-control component of All questions carry equal marks.
the database system can ensure serializability.
L List four significant differences between a
UNIT V
file-processing system and a DBMS.
19. Explain two-phase locking protocol and mention
2. Explain set-difference operation.
its pros and cons.
Or 3. List out· the different mappmg cardinalities in
database design.
20. Outline the drawbacks of the no-steal and force
buffer management policies. 4: Describe RAID level-5.

5. Define functional dependency.

6. Explain the rules in Armstrong's axioms.

7, How to measure the cost of query evaluation plan?

4 5635132
8. , Explain ACID properties. (a) Give an expression in relational algebra to
" express the following query. (6)
9. If deadlock is avoided by deadlock-avoidance (i) Find the names of all branches located
schemes, is starvation still possible?' Explain your in "Chicago".
answer. (ii) Find the names 'of all borrowers who
have a loan in branch "Downtown".
10. Define the term checkpoint. (b) (i) What are the appropriate primary
keys? (5)
PART B - (5 x 11 = 55 marks)
(ii) Identify appropriate foreign keys. ,
Answer ALL questions, ONE from each Unit.
UNIT II
,All questions carry equal marks.
13. Design a database for an airline'. The database
UNIT I must keep track of customers and their'
reservations,' flights and their status, seat
11. (a) Draw the database architecture neatly and assignments on individual nights,' and the
explain its components. (6) schedule and routing of future flights. Your design
(b) Draw the schema' diagram of banking should include an E-R diagram, a set of relational
database. (5)
schemas, and, a list of constraints, including
primary-key and foreign-key constraints.
, Or
Or
12.' Construct, a database 14. Construct a B+ -tree for the following set of key
branch (branchname, branchcfty, assets) values: (2, 3, 5, 7, 11, 17, 19, 23, 29, 3~i,
customer (customername, customerstreet, Show the form 'of the tree after each of the
customercity) following series of operations:
loan (loan number, branchname, amount), (a) Insert 9.
borrower (customername, loan number) (b) Insert 10.
(c) Insert 8. '
account (accountnumber, branch name balance)
(d) Delete 23.
depositor (customername, accountnumber)
(e) Delete 19.
and answer the following :
2 5635132 3 5635132
 5635132

B.Tech. DEGREE EXAMINATION,

NOVEMBERIDECEMBER 2018.

Fifth Semester

Computer Science and Engineering

DATABASE MANAGEMENT SYSTEMS

(2013-14 Onwards Batches)

Time : Three hours Maximum: 75 marks

PART A - (10 x 2 = 20 marks)

Answer ALL questions.

All questions carry equal marks.

l. What are Data Models?

2. List the needs of Triggers in SQL.

3. Define Entity and Attribute.

4. Distinguish between static and dynamic hashing.

5. Define relational database.

6. What is meant by temporal data?

7. What is the purpose of Join operation? UNIT III

15. Explain with examples 1NF, 2NF, and 3NF.

8. What is Serializability?
Or
9. What is meant by deadlock?
16. Build the algorithms for decomposition.
10. What is meant by atomicity?
UNIT IV
PART B - (5 x 11 = 55 marks)
17. Explain the query processing measures and
Answer ALL questions, ONE from each unit. operations.

Or
All questions carry equal marks.
18. Explain in brief Query optimization.
UNIT I
UNIT V
11. Demonstrate the 3-tier architecture of Database.
19. Write a detailed note on Concurrency Control.
Or
Or
12. Explain with examples tuple relational calculus
20. Discuss on IBM DB2 universal database and
operations. MySQL.

UNIT II

13. Draw an E-R diagram for Banking System.

Or

14. Explain B+ Tree Index Files.

2 5635132 3 5635132
16. Discuss join Dependencies and Fifth Normal 5635132
Form, and explain why 5NF?

UNIT IV B.Tech. DEGREE EXAMINATION,-MARCH 2021.

. Fifth Semester
17. Diagrammatically illustrate and discuss the steps
involved in processing a query. Computer Science & Engineering
DATABASE MANAGEMENT SYSTEMS
Or
Time : Three hours Maxim um : 75 marks
18. Elaborate on Query evaluations eost and Selection PART A - (10 x 2 = 20 marks)
operation.
Answer All questions
UNIT V
All questions carry equal marks
19. Compare the protocols used for concurrency 1.
control. AS.a Database Administrator, what are the roles
and duties you can do?
Or
2. Consider the following relation EMP
20. Explain about recovery schemes in implementing (ENO, . NAME, DATE_OF_BIRTH, SEX,.
consistency. DATE_OF~JOINING, BASIC_PAY, DEPT)
Develop a SQL query that will find and display
the average BASIC_PAY in each DEPT.

3. List the design challenges of ER modeL

4. How does B-treediffers from a B+ - tree? Why is a

B+ - tree usually preferred as an access structure
to a data file?

5. How do you define irreducible sets of

dependencies?

4 5635132
 I, '
'.

6. Compare 2NF, 3NF AND BCNF with suitable (a) Display the list of all customers by Cust_No
examples. with the city in which each is located. Select
Cust No, city from Customer.
7. What are the measures of query cost?
(b) List the names of the sales persons who have
accounts in Delhi, Select Sales_Person_Name.
8. . List ACID properties. from Sales_Person_Name where (select * from
customer where city. = delhi)
9. Give an example for deadlock handling.
UNIT II
10. How to handle the failures with loss of nonvolatile
storage? 13; Construct an E-R diagram for a
car-insurance company whose .customers own one
PART B - (5 x 11 = 55 marks) or more cars each. Each car has associated with it
zero to any number of recorded accidents. State
Answer ALL question, ONE from each Unit any assumptions you make.

All questions carry equal marks Or

UNIT I 14. What is aggregation in an ER model? Develop an

ER diagram using aggregation that captures the
11. With relevant examples discuss the varIOUS following information : Employees work for
operations in Relational Algebra. projects. An employee working for a particular
project uses various machinery. State any options
Or 'you make, Also discuss -about the ER diagram you
have designed.
12. Consider the database given by the following UNIT III
~schema. Customer (Cust_No, Sales_Person_No,
City) Sales_Person (Sales_Person_No, 15. What are the pitfalls in relational database
Sales_Person_Name, Common_Prec, YearofHire) design? With a suitable example, explain the role
Give an expression in SQL for each of the of functional dependency in the process of
following queries : normalization.

Or

2 5635132 '3 5635132

 UNIT IV
5635132
17. Illustrate the different states of the transaction.
B.Tech. DEGREE EXAMINATION, SEPTEMBER 2021.
Or
Fifth Semester / Third Year
18. Write short notes on:
Computer Science and Engineering
(a) Nested loop join
(b) Block Nested loop join DATABASE MANAGEMENT SYSTEMS
(c) Merge join Time : Three hours Maximum: 75 marks
Cd) Hash join. PART A - (10 x 2 = 20 marks)
UNIT V Answer ALL questions.
19. Outline the deadlock handling mechanisms with All questions carry equal marks.
suitable example.
1. Differentiate between DR and DBMS.
Or·
2. Define DML Give example for the statement
20. Discuss about immediate update "Select * from <TN>". What will be the output
and deferred
update recovery techniques. after executing the same?

3. Define Entity and Attribute.

4. Define Hashing.

5. What is the need for Normalization?

6. List the disadvantages of relational database

system.

7. What is a transaction?

8. When is a transaction rolled back?

4 5635132

/
 /
9. Define Concurrent schedule with an example. UNIT II
10. Recall the concept of shadow paging. 13. Consider a car insurance company whose
customers may own multiple cars and each car
PART.B - (5 x 11 = 55 marks)
may also be associated with one or more number of
Answer ALL questions, ONE from each Unit. recorded accidents. Each insurance policy covers
one or more cars and has more number of
All questions carry equal marks. premium payments associated with it. Also each
payment is for a particular duration and will be
UNIT I having an associated due date and the date of
payment received. Construct an ER-niodel for this
11. Create a table. emp with attributes ename, ecity
scenario with appropriate notations considering all
and salary and table company with attributes
the constraints.
cname, ccity, eid and write queries to execute the
following: .
Or
(a) Create and. insert values in to both tables
(minimum 10 values) 14. Construct B tree to insert the following key values
32, 11, 15, 13, 7, 22, 15, 44, 67, 4, assuming the
(b) Find the names of all employees whose name
begins with either letter 'A' or 'B' order of the tree is three. Explain the various
stages of insertion operation.
(c) Find the names of all employees who live in
'delhi' and whose salary is between 20,000 arid UNIT III
30,000. . .
15. Define Normalization. Illustrate the first three
(d) Find the company names where the company
city is ' delhi' and the number of employees is normal forms with an example.
not between 5000 and 10000; Or
(e) Find the names of all companies that do not
end with letter A. 16. Consider the relation schema R = (ABCD) and the
set of functional dependencies are:
Or
F = {AB~C, B~D, C~A}. Prove that R is not in
12. Explain in brief about Database System BCNF. Suitably decompose R into appropriate
Architecture. relational schemas that are in BCNF.

2 5635132 3 5635132
 cd .9, 5
.: c\.
cl lr 0)
ocs!fo
NE=X
';Loa.S
^)J
fr] u) L-
''i ';i
E hlE E ;
lrl L:^).ai =!=(5
()9?E-Y.=
rn y* 5 ? i q bot
C.=!'GftE.gH-iq-.
ho Fi C <; E € '- Cd .' a\
7 Ari# E
arrr v*=N,, ;( 3 4 PE= 5
F P 5 ? its.-5€=E { ? E a rr
'?l
r1l kE6d;ior,EEpCi=o)
rr)l ;,0 or ('5
= ^3 ^,
x E . a o rrl p. .o a
6,61 2a!<xo.:=ortuIo'qC
Hl *;;E!
il E ?
kti7q]?,ft6H€Netls6
=Er1I I?=i3
E : e € E E A;
E =*:= = i E - + t; : tr i t,.6
a .s s.2 h €
*H
a5 3 ;Y. e'
:A H =.e
S E
A
= ,-c r: :c =
:I .a : '-s
6 I E E FFE B
UCJ
FE =S
trj 5-j6io"j+,c; qoF
l
 b! bo NI
cal
o
0) C) llil
a a o 6al
-l (ol
o a I()l
+J +J
c)
a ao b! a .ia
a ,n
{J fJ
a a tr
'-o36o) 0r o O
Fq o 'o
a/ 1J (J b!
.- .d
a oX
a Fai s +J
a, {J
+J
-x a 0) N a
Ec) a .o d
o a
o.) F vt F C6
- c .b! ()
17 lJr
ctr 6
c z 0)
z oal p a
[nd a
)E Cd OH X
X {Jo a
c) a ouf
a ,dz qId {J
0) o
o ,^H o.: 0)
",^a +i
- l--l +)
Ud 0)
fJ +J c)
CDcg 03.t o .i
-i !P' 0)
-!! n L!U- F!€
a -do5 o.€ !uY a
X X
FZ tr.,l
>99 r5s
-)a)
t- co
Fl t Fl r-l 6I
O>)
A(J CJ +J
c\l
-o e6l
+J .d
..o 0)
nl +J c, 1r)l
+ia c) 661
a A o tJ (ol
b! Iol
c)
o +
.I) 0)
cd
pl
.o f'I o)
(E^a cd
d
!u
lu y S.r ! -
0) cd
b! VRL! (H
d a ior + H
c0 Oli o
a ,_o H N) o a
a iS'-o ia €)
0) tJ
ad 16 a bo i: +i
-'9 C6u a
! :iI H!
a
p. Al!* cd 'i
l=!-r Fr +J
tr -l tr u2^ P. b, b! 6.
vd Fl o X o 0)
o 0) z a a
0)
O.- .cJ +:
i!
H .\ I
c) oJXl o)E o
a)
B
t60dB: x +,
a a-Q b, 6; g
-! t^ fr(.
r) Lu .-a (!a
+J 4t \ Frl C)
d .: 0)
?-4
ULU: 9a 0)
a aaF.i a. ^.: -E
-+J +J +J # a, tr
ia {l
\va_ a
-(! A.
t >tr i-o x t{o
fr] cg frl
-i ci c.j +
i F-l ri F{