Regulation: R13 Code No: CS222/1

II B.Tech. II Semester Examinations, May 2015

DATABASE SYSTEMS
Time: 3 hours (CSE/IT) Max. Marks: 60
SECTION – A
Answer all ten questions 10×1M=10M
1. E-R model uses this symbol to represent weak entity set?
a) Dotted rectangle b) Diamond c) Doubly outlined rectangle d) None of these
2. The way a particular application views the data from the database that the application uses is a:
a) Module b) Relational model c) Schema d) Sub schema
3. The row of a table is referred to as
a) tuple b) attribute c) entity d) degree
4. Which of the following operations need the participating relations to be union compatible?
a) UNION b) INTERSECTION c) DIFFERENCE d) All of the above
5. Consider a schema R (A, B, C,D) and functional dependencies A->B and C->D. Then the
decomposition of R into R1(A,B) and R2(C,D) is:
a) Dependency preserving and lossless join. b) Lossless join but not dependency preserving.
c) Dependency preserving but not lossless join. d) Not dependency preserving and not lossless join.
6. The relation EMPDT1 is defined with attributes empcode (unique), name, strret, city, state and
pincode. For any pincode, there is only one city and state. Also, for any given street, city and state,
there is just one pincode. In normalization terms, EMPDT1 is a relation in:
a) 1NF only b) 2NF and hence also in 1NF
c) 3NF and hence also in 2NF and 1 NF d) BCNF and hence also in 3NF, 2NF and 1NF.
7. Transaction processing is associated with everything below except
a) producing detail, summary, or exception reports b) recording a business activity
c) confirming an action or triggering a response. d) maintaining data
8. In which type of problem, one transaction inserts a row in the table while the other transaction is
half way through its browsing of table:
a) Transaction read problem b) One way read problem
c) Serial read problem d) Phantom read problem
9. The physical location of a record is determined by a mathematical formula that transforms a file key
into a record location is:
a) B-Tree File b) Hashed File c) Indexed File d) Sequential File
10. How many children do a B+Tree of order m contains?
a) m b) m+1 c) m-1 d) m/2

SECTION – B
Answer all five questions 5×2M= 10M
11. Explain entity integrity and referential integrity rules in relational model. Show how these are
realized in SQL.
12. Show how each E-R model construct can be mapped to the relational model using suitable example.
13. Explain different languages that are supported to manage the data in a DBMS.
14. Define union compatibility. Explain why INTERSECTION of two relations cannot be performed if
they are not union compatible.
15. Discuss the types of integrity constraints that must be checked for the update operations – Insert and
Delete. Give examples.

1 of 2
 Regulation: R13 Code No: CS222/1
SECTION – C
Answer all four questions 4×5M = 20M
16. Explain the concept of generalization and aggregation in E-R diagrams. Give one example for each
one of them.
(OR)
17. Explain the draw backs of traditional file systems with examples.
18. Consider the following relational schemas:
EMPLOYEE (EMPLOYEE_NAME, STREET, CITY)
WORKS (EMPLOYEE_NAME, COMPANYNAME, SALARY)
COMPANY (COMPANY_NAME, CITY)
Write an expression in SQLfor each of the queries below:
i) Find the name of all employees who work for first Bank Corporation
ii) Find the names and company names of all employees sorted in ascending order of company
name and descending order of employee names of that company.
ii) Change the city of first Bank Corporation to ‘New Delhi’
(OR)
19. Consider the following relational database:
STUDENT (name, student#, class, major)
COURSE (course name, course#, credit hours, department)
SECTION (section identifier, course#, semester, year, instructor)
GRADE_REPORT (student#, section identifier, grade)
PREREQUISITE (course#, presequisite#)
Specify the following queries in SQL on the above database schema.
i) Retrieve the names of all students majoring in ‘CS’ (Computer Science).
ii) Retrieve the names of all courses taught by Professor King in 1998
iii) Delete the record for the student whose name is ‘Smith’ and whose student number is
iv) Insert a new course <’Knowledge Engineering’, ‘CS4390’, 3, ‘CS’>
20. Describe what is meant by full functional dependency and describe how this type of dependency
relates to 2NF. Provide an example to illustrate your answer.
(OR)
21. Describe what is meant by transitive dependency and describe how this type of dependency relates
to 3NF. Provide an example to illustrate your answer.
22. Consider a relation R with five attributes ABCDE with functional dependencies:
𝐴 → 𝐵, 𝐵𝐶 → 𝐸 𝑎𝑛𝑑 𝐸𝐷 − 𝐴,
i) List all keys for R ii) is R in 3NF iii) is R in BCNF
(OR)
23. In the BCNF decomposition algorithm, suppose you use a functional dependency α -> β to
decompose a relation schema r(α, β, γ) into r1(α, β) and r2(α, γ).
i) What primary and foreign key constraint do you expect to hold on the decomposed relations?
ii) Give an example of an inconsistency that can arise due to an erroneous update, if the foreign key
constraint were not enforced on the decomposed relations above.
iii) When a relation is decomposed into 3NF, what primary and foreign key dependencies would
you expect will hold on the decomposed schema?

SECTION – D
Answer all two questions 2×10M= 20M
24. What are the various methods of controlling concurrency?
(OR)
25. Differentiate between the following pairs:
i) Conflict equivalent schedule and conflict serializable schedule
ii) View equivalence and view serializable
26. Write about indexed sequential files. What are differences among primary, secondary and clustering
indices?
(OR)
27. What is Query optimization? Explain various steps in query optimization.

2 of 2