Professional Documents
Culture Documents
Q. o
Questions
Course
Taxonomy Outcome
Level
NIT I
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
JNTU
1
2
Knowledge
Knowledge
Knowledge
Understand
Understand
Knowledge
Understand
Understand
Understand
Knowledge
Knowledge
Understand
Understand
Understand
Understand
Understand
Knowledge
Understand
1
2
2
2
2
2
2
2
2
3
3
9
9
9
2
9
3
9
Knowledge
Knowledge
8
8
3
4
5
6
7
8
9
10
11
12
13
1
2
3
4
5
6
7
8
9
10
11
12
1
2
3
4
5
6
7
8
9
10
11
12
13
1
2
3
4
5
6
7
8
9
9
10
Knowledge
Knowledge
Understand
Apply
Understand
Knowledge
Knowledge
Knowle ge
Knowle ge
Un erstand
App y
8
10
8
8
9
10
8
10
6
10
10
Know e ge
Know e ge
Un e stand
App y
App y
Apply
Unde stand
Kn wledge
Kn wledge
Kn wledge
Kn wledge
Kn wledge
5
5
5
5
5
5
5
5
5
5
5
5
Knowledge
Understand
Understand
Understand
Knowledge
Apply
Understand
Understand
Understand
Knowledge
Understand
Apply
Understand
7
7
7
7
7
7
7
7
7
7
7
7
7
Understand
Understand
Understand
Knowledge
Understand
Understand
Knowledge
Understand
Understand
Understand
Understand
Understand
2
11
11
11
11
11
11
11
11
11
11
11
Q. No
Questions
Blooms
Course
Taxonomy Outcome
Level
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
1
2
3
4
5
6
7
8
10
1
2
3
4
5
6
7
8
9
10
1
2
UNIT I
Compare and Contrast file Systems with database systems?
Define Data Abstraction and discuss levels of Abstraction?
Discuss about different types of Data models?
Describe the Structure of DBMS?
Discuss additional features of the ER-Models.
Discuss about the Concept Design with the ER Model?
Write about views and updates on views?
Explain different types of database users and write the functions of DBA?
Explain about different types of integrity constraints?
Discuss about the logical database Design?
Distinguish strong entity set with weak entity set? Draw an ER diag am to
illustrate weak entity set?
Differentiate relation schema and relational instance? Define the te ms a ity and
degree of s relation? What are domain constraints?
Illustrate outer joins with example?
Describe logical connectives of SQL?
Discuss about active databases?
UNIT II
Illustrate different set operations in Relational algebra with an example?
Define Join? Explain different types of joins?
Discuss about Domain Relational calculus in detail?
Define trigger and explain its three parts? Differentiate row level and statement
level triggers?
Illustrate Group by and Having clauses with examples?
Discuss about Complex integrity constraints in SQL?
Discuss different types of aggregate operators with examples in SQL?
a. Define a nested query?
b. Write a nested query to find the names of sailors who have reserved both a
red and green boat?
c. Write a nested query to find the names of sailors who have reserved all
boats?
a. Discuss correlated nested queries?
b. Write a query to find the names of sailors who have reserved a red boat?
c. Write a query to find the names of sailors who have not reserved a red boat?
a. Explain Relational calculus?
b. Write a RC query to find the names of sailors who have reserved boat 103?
c. Write a DRC query to find the names of sailors who have reserved boat 103?
UNIT III
Illustrate redundancy and the problems that it can cause?
Define decomposition and how does it address redundancy? Discuss the problem
s that may be caused by the use of decompositions?
Define functional dependencies.How are primary keys related to FDs?
Define normalization? Explain 1NF, 2NF, 3NF Normal forms?
Compare and contrast BCNF with 3NF?
Describe properties of decompositions?
Explain about Schema refinement in Database design?
Illustrate Multivalued dependencies and Fourth normal form with example?
Discuss about Join dependencies and Fifth normal form?
Illustrate Inclusion dependencies with example?
UNIT IV
Explain ACID properties and Illustrate them through examples?
Discuss How do you implement Atomicity and Durability?
Apply
Knowle ge
Un erstand
Un erstand
Un erstand
Un erstand
Know e ge
Un e stand
Un e stand
Unde stand
App y
Unde stand
1
2
2
2
3
4
10
2
6
4
3
2
Apply
Understand
Understand
10
10
10
Apply
Knowledge
Understand
Knowledge
8
10
8
Apply
Understand
Understand
Knowledge
10
6
10
10
10
Understand
10
Understand
10
Apply
Knowledge
Knowledge
Knowledge
Apply
Understand
Understand
Apply
Understand
Apply
5
5
5
5
5
5
5
5
Understand
Understand
7
7
3
4
5
6
7
8
9
10
11
12
13
14
1
2
3
4
5
6
7
8
9
10
11
Apply
Understand
Understand
Understand
Understand
Understand
Understand
Un erstand
Un erstand
Un erstand
Un erstand
App y
7
7
7
7
7
7
7
7
7
7
7
7
App y
Un e stand
Unde stand
Unde stand
Unde stand
Apply
Apply
Apply
Understand
Understand
Apply
11
11
11
11
11
11
11
11
11
11
11
Q. No
Questions
Course
Taxonomy Outcome
Level
NIT I
1
Apply
3
4
10
3
10
McGraw-Hill?
Find the names of employees who have borrowed more than five
different books published by McGraw-Hill?
d. For each publisher, find the names of employees who have borrowed?
Given the Students relation as shown below
c.
4
1
Apply
10
For (Student Name, Student Age) to be the key for this instance, analyze and find
value of X not be equal to?
Given the relations
employee(name,salary,deptno)
department (deptno, deptname, address)
Solve which query cannot be expressed using the basic relati nal a geb a
operations (U, -, x,
, p)?
Write SQL Query to find second highest salary of Empl yee f m Empl yee
table?
App y
10
Apply
10
UNIT III
Consider a relation scheme R = (A, B, C, D, E, H) n which the f ll wing
functional dependencies hold: {A>B, BC> D, E>C, D>A}. Write the
candidate keys of R?
Consider the following relational schemes for a library database:
Apply
Apply
Apply
Apply
Apply
Apply
Apply
S1: r1(X);r3(Y);r3(X);r2(Y);r2(Z);
w3(Y);w2(Z);r1(Z);w1(X);w1(Z)
S2: r1(X); r3(Y); r2(Y); r3(X); r1(Z);
r2(Z); w3(Y); w1(X); w2(Z); w1(Z)
Analyze which one of the schedules is conflict-serializable?
Suppose that there is a database system that never fails. Analyze whether a
recovery manager required for this system?
UNIT - V
Consider a B+-tree in which the maximum number of keys in a node is 5.
Calculate the minimum number of keys in any non-root node?
In the index allocation scheme of blocks to a file, Calculate n what maximum
possible size of the file depends?
A clustering index is defined on the fields of which type? Analyze them.
Calculate the minimum space utilization for a B+ tree index?
Consider the B+ tree index of order d = 2 shown in Figure
Apply
Apply
11
App y
11
App y
App y
11
11
Apply
11
World
1
2
3
4
5
a. Show the tree that would result from inserting a data entry with key 9
into this tree.
b. Show the B+ tree that would result from deleting the data entry with key
8 from the original
tree, assuming that the left sibling is checked for
possible redistribution