SECTION “A”

1. Level of abstraction describes what data are stored in the database and
what relationship exists among those data.
[ ] Physical [ ] Logical [ ] External [ ] None

2. The implementation of the simple structure at the logical level may involve complex
physical level structure, the user of the logical level does not need to be aware of this
complexity this is called as
[ ] Physical data independence [ ] Logical data independence.[
] Conceptual data independence [ ] View data independence

3. Which language is used to enables the user to access data as organized by the appropriate
data model?
[ ] Data Definition Language [ ] Data Manipulation Language
[ ] transaction Control Language [ ] Data Control language

4. user form their requests either using a database query language or by

using tools such as data analysis software.
[ ] Novice User [ ] Sofisticated User
[ ] Specialised User [ ] Database Administrator

5. In which index, the index record contain search key value and pointer to the first data
record with that search key value?
[ ] Sparse [ ] Dense [ ] cluster [ ] Primary

6. To avoid the problem raised by concurrency, Lock is used by the

Transaction Manager for read Operation.
[ ] Exclusive [ ] Shared [ ] Spin [ ] None

7. A transaction may obtain locks but may not release any lock is known as .
[ ] Shrinking [ ] growing [ ] Strict two phase [ ] Rigorous

8. Table is synonymous with the term:

[ ] record. [ ] relation. [ ] column. [ ] field.

9. Which of the following command is used to remove all rows from the table?
[ ] DELETE [ ] TRUNCATE [ ] REMOVE [ ] All of the above
10. For a union operation to be valid between two schema R and S one of the following
condition is not necessary.
[ ] The relations R and S must be of the same arity.
[ ] The relation R and S must always be the database relation not the temporary relation
that has been resulted from relational algebra expression.
[ ] The domains of the ith attribute of R and the ith attribute of the S must be the same ,
for all i.
[ ] None of the above

11. E-R model uses this symbol to represent weak entity set ?
[ ] Dotted rectangle. [ ] Diamond
[ ] Doubly outlined rectangle [ ] Doubly outlined Diamond

12. An instance of relational schema R (A, B, C) has distinct values of A including NULL
values. Which one of the following is true?
[ ] A is a candidate key [ ] A is not a candidate key
[ ] A is a primary Key [ ] A is super Key

13. Consider the join of a relation R with relation S. If R has a tuples and S has b tuples, then
the maximum size of join is:
[ ] ab [ ] a+b [ ] (a+b)/2 [ ] 2(a+b)

14. Which of the following statements contains an error?

[ ] select * from EMP where EMPID = 493945;
[ ] select EMPID from EMP where EMPID = 493945;
[ ] select EMPID from EMP;
[ ] select EMPID where EMPID = 56949 and LASTNAME = ’SMITH’;

15. To delete a particular column in a relationthe command used is:

[ ] UPDATE [ ] ALTER [ ] DROP [ ] DELETE

16. Cross Product is a

[ ] Unary Operator [ ] Binary Operator
[ ] Tertiary Operator [ ] Not an Operator

17. Which of the line will produce error in the following query?
Line1: Create Table students
Line2: { roll_noint not Null,
Line3: std_namevarchar2(20) unique,
Line4: std_dob date,
Line5: Primary key (roll_no)
Line6: );
[ ] Line 2 [ ] Line 3 [ ] Line 4 [ ] Line5

18. Date is the type of attribute:

[ ] Simple [ ] Composite [ ] Single values [ ] Multi valued

Consider the following schema:(for question NO:19 and 20)

Suppliers(sid: integer, sname: string, address: string)
Parts(pid: integer, pname: string, color: string)
Catalog(sid: integer, pid: integer, cost: real)
19. To find the names of suppliers who supply some red part we express the following as:
[ ] πsname(πsid((πpidσcolor=_red_Parts) ⋈ Catalog) ⋈ Suppliers)
[ ] πsname(πsid(πpidσcolor=_red_Parts) ⋈ Catalog)
[ ] πsname(πsid(πpidσcolor=_red_Catalog) ⋈Suppliers)
[ ] πsname(πpidσcolor=_red_Parts)⋈ Suppliers)

20. To find the sids of suppliers who supply some red or green part.
[ ] πsid(πpid(σcolor=_red_∨color=_green_Parts) ⋈ catalog)
[ ] πsid(πpid(σcolor=_red_∨color=_green)⋈ catalog)
[ ] πsid(πpid(σcolor=_red_∨color=_green_Parts)
[ ] πsid((σcolor=_red_∨color=_green_Parts) ⋈catalog)
Attempt ANY TWO questions.

1. Given the relational schema below and the dependencies, Normalize the schema up to
BCNF in all possible ways. Do not forget to write the theory for each of the Normal
forms and explain in what way theyreduce redundancy.
Student(StdNo, StdName, appointNo,timing,advisor)
StdNo ->StdName
StdNo,appointNo ->Timing,advisor
Timing ->appointNo

2. Explain the different components that should be considered while designing ER Diagram.
Figure out the problem that is raised while designing the ER diagram as in figure1. Also
suggest the solution.

Fig1:

3. Based upon the database schema described below, express the following queries in
different form as indicated.
Branch(branch_name,branch_city,assets)
Loan(loan_number,branch_name,amount)
Borrower(cust_name,loan_number)
Depositor(cust_name,account number)

a. Express the name of the customer who has either an account or a loan or both in
relational algebraic form.
b. Express the largest bank account balance in the bank in relational algebraic form.
c. List all the customer who have a loan at the Peryridge branch in alphabetical order
using SQL.
d. List the Branch that has the highest average balance using SQL.

SECTION “C”

Attempt ANY SIX questions.

4. A weak entity set can always be made into a strong entity set by adding to its attributes
the primary-key attributes of its identifying entity set. Outline with examples, what sort
of redundancy will result if we do so?
5. How do you identify the keys in RDBMS? How referential integrity is maintained
through the implementation of foreign key?

6. Explain in detail how the transaction properties atomicity and isolation ensure the data
integrity.

7. Explain the concept behind the implementation of Indices in database system.

8. There are several advantages of using database system yet there are some of the major
disadvantages. Explain the major disadvantages of using database system.

9. What do you mean by serial schedule? Explain the concept of Conflict Serializability.

10. Suppose that we have decompose the schema R=(A,B,C,D) into

(A,B,C)
(A,D,E).
Show that this decomposition is a lossless decomposition if the following set F of
functional dependencies holds:
A→BC
CD→E
B→D
E→A