0% found this document useful (0 votes)
11 views4 pages

Dbms QB

The document outlines a comprehensive database fundamentals course, including various units covering topics such as database concepts, relational databases, database design, transaction management, and implementation techniques. Each unit contains both objective questions and descriptive questions aimed at assessing understanding and application of database principles. The course is structured to evaluate knowledge through Bloom's taxonomy levels, with marks allocated for each question.

Uploaded by

astraline843807
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
11 views4 pages

Dbms QB

The document outlines a comprehensive database fundamentals course, including various units covering topics such as database concepts, relational databases, database design, transaction management, and implementation techniques. Each unit contains both objective questions and descriptive questions aimed at assessing understanding and application of database principles. The course is structured to evaluate knowledge through Bloom's taxonomy levels, with marks allocated for each question.

Uploaded by

astraline843807
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 4

UNIT- L- Database Fundamentals

Course Marks
PART A(2 Marks) Bloom's Level
Outcome Allotted

1 What is Database? Give some applications of Database [BL2] [CO1] [2]

2 List the three levels of data abstraction. [BL1] (CO1] (2]


3 What is weak entity set? Give Example [BL2] [CO1] [2]
4 Differentiate Instance and Schema. [BL4] [CO1] [2)

5. Compare the features of file system with database system. [BL4] [CO1] [2]
Descriptive Questions (13 /15/16 Marks)
Explain Basic architecture of DBMS with its neat block diagram. [BL2] [CO1]| (13]
7 Write short notes on [BL1] [C01] [13]
() Purpose of Database systems(5)
(ü) Views of data (4)
() Applications of database systems(4)
8 [BL3] [CO1] (13]
llustrate with an example, Extended E-R Diagram and its notations.
9. lustrate in detail about Relational Data model and ER model for (BL3] [C01] [13]
employee database application.
10. Draw ER Diagram for" Restaurant menu ordering system", which wil [BL6] [CO1] [13]
facilitatethe food items ordering and services within restaurant. The
entire scenario is detailed below. The customer is able to view the food
items menu, call the waiter, place orders and obtain final bill through the
computer kept in their table. The waiters through their wireless tablet PC
are able to initialize atable for customers,control the table functions tol
assis1 Customers orders, send orders to fcod preparation siaff(chef)
and finalize the customers bill. The chef with their touch display interface
to the system, are able to vieW orders sent to the kitchen by waiters.
During preparation they are able to let the waiter know the status of
each item,and can send notifications when items are completed. The
system should have full accountability and logging facilities and should
support supervisor actions to account for exceptional circumstances
Such as meal being refunded or walked out on.

UNIT- II- Relational Database


PART A(2 Marks) Bloom's Level
Course
Outcome
Marks
Allotted
1 List the steps involved in Query Processing [BL2] [CO3] [2]
2 What is primary key and foreign key. Give example for each. [BL2] [CO3] (2]
3 What are aggregate Functions? List the aggregate functions used in [CO2] [2]
SQL.
[BL2]
4. Write SQL query to get the department and department wise total
(sum) [BL3] [CO2] (2]
salary, display it in ascending order according to salary
5. Compare Dynamic SQL and Static SQL. [BL4) [CO2] (2]
Descriptive Questions ( 13 /15/16 Marks)
6. Explain select, project ,Cartesian product operation and Join operation
[BL3]) [CO2] [13]
types in relational algebra.
7 Give syntax and explain DDL, DML, DCL Commands for the given [BL3] (CO2] [13]
student's database which contains student details: name, id, DOB.
branch, DOJ, and course details: Coursename, Course id, Stud ld.
Faculty name, id, marks.
8 Consider the following relational schema: [BL4) [CO2] [13]
la.Book(bookid, title publisher_name)
b. Book_author(bookid, author_name)
c.Book_copies(bookid, branched, No_of_copies). Write the following
queries inSQL.
Retrieve the author name of book having title
Operating System'.
Retrieve the total number of titles of each
publisher.
iii. Retrieve the total number of titles.
iv. Retrieve title, publishername&authorname of the
bookid B101'.
Retrieve the number of copies with bookid='B101' and
branched='BRO01"
9. Develop queries and show how a SQL relation can be defined using [BL4] [CO2] [13]
various constraints and types of keys? Also, Explain dfferent data
definition Language statements in detail.
10. Perform the followingclauses of SQL with example queries. [BL4] (CO2] [13)
i FROM clause
ü. GROUP BY clause
ii. HAVINGclause
iv. ORDER BY clause

UNIT- III- Database Design


Course Marks
PART A(2 Marks) Bloom's Level
Outcome Allotted

1 Define Functional Dependency. [BL1] [CO4) [2)


2. List the Properties of Decomposition. [BL1] [CO4] (2]
3. State Anomalies in NF. [BL1] [Co4] (2]
4. Why 4NF in normal form is more desirable than BCNF? [BL4] [Co4] [2]
5. Suppose youare given a relation Student(Stud no, (BL4] [CO4) (2]
Stud_Name, Stud_phone, Stud_State, Stud_Country, Stud_Age). Find
all Functional Dependencies.
Descriptive Questions (13 /15/16 Marks)
6 Explain the conceptof functional dependencies and its types with [BL2] [Co4) (13]
example
7 State the need for Normalization .Construct 1NF,2NF,3NF with example [BL2] [CO4) [13]
8 List the Properties of Decomposition. Distinguish between lossless [BL4] [Co4] [13]
decomposition and dependency preserving decomposition with
example.
How do youConvert 3NF to BCNF. Explain BCNF, 4NF and 5NF with [BL3] [CO4) [13]
example.
10. ) Consider the given relation R(A,B,C,D) and functional dependency [BL6] [Co4] (13]
FD= (AB’C, C>BC’D).Determines the keys, key of prime or non
prime attributes.
i) Compute the Closure of the following set Fof functional
dependencies for relation R={A,B,C,G,H,i)F={A->B, A->C, CG
>H,CG->l,8->H)

UNIT- IV-Transaction Management


Bloom's Lovol Course Marks
PART A(2 Marks) Outcomo Allottod

1 Write the ACID Properties of Transaction. [BL1] [CO3) [2]


2 Define Deadlock. [BL2] (CO3] (2]

3 Define Strict And Rigorous Two Phase Locking Protocol [BL1) [CO3) (2]
4 Consider the following transaction T consisting of T1 and T2: Transfer of (BL3) (CO3] (2)
100 from account X to account Y.
Before:>X:500 Y:200
Transaction T
T1 T2
Read (X) Read(Y)
S:=x-100 Y:=Y+100
Write(X) Write(Y)
After:X:400 Y:300
If the transaction fails after completion of T1 but before completion of T2.
(say, after write(X) but before write(Y)), then amount has been deducted
from Xbut not added to Y.Which ACID property must be used to avoid
inconsistency?
5 What are the operations in schedule are said to be conflict? [BL4] [CO3] (2]

Descriptive Questions (13 /15/16 Marks)


6. Mhy Concurrency control is needed? State and Explain Three [BL2) (CO3) (13)
Concurrency Problems.
7. State and explain lock based concurrency control and two phase locking [BL2] [CO3] [13]
with suitable example.
8. Explain testing for Serializability with respect to concurrency control [BL3] [CO3] (13]
scheme. How will you determine whether the schedule is serializable or
not?
)What is deadlock and how does it occur? (6) [BL4) [CO3] {13)
(i) Explain the deadlock prevention methods with an example? (7)
10. K) Consider the following two transactions (BL6] (CO3] (13}
T1: READA);
READ(B);
IF A=0 THEN B:=B+1;
WRITE(B)
T2: READ(B);
READ(A).:
IF B=0 THEN A:=A+1;
READA).
WRITEA),
Add lock and unlock instructions to transactions T1 and T2, so that they
observe the two -phase locking protocol. Can the execution of these
transactions result in a deadlock? (6)
isted in the order they are
n) Consider the following, the actions arename.
scheduled and prefixed with the transaction T3:R(Z)
T3.W(X), T1:R(X), T1:W(Y), T2 R(Z), T2.W(Z),

1)What is the precedence graph for the above schedule?


(2)ls the schedule conflict-serializable? If so what are all the conflict
equivalentserial schedules? (7)

UNIT- V Implementation Techniques


and Non-relational Model
Courae Marka
PART A(2Marks) Bloom'a Level Outeome Allotted

[BL2) [COS] (2]


1. What are ordered indices? List the types.
[BL2) [CO5) (2)
2. What is NoSQL database?
[BL2) [CO5] [2)
3. What are the advantages ofB tree over B+ tree?
(BL4) [CO5) (2]
4. Differentiate static hashing and dynamic hashing.
[BL4] [Co6] [2]
5. Differentiate between MangoDB and RDBMS.
Descriptive Questions (13 /15/16 Marks)
[BL2] [CO5] (13]
6. What is RAID? List and Explain Various RAID levels and features in
detail.
7. Howrecords are represented in a file and how to organize them in a [BL4] [CO5] [13]
file? [CO5] [13]
8. How Indexing mechanisms is used for accessing files? Explain the [BL4]
various indexingschemes used in database environment. (13]
9. Why to use MangoDB? Give the key components of
MangoDB [BL3] [CO6]
architecture
10. Construct a B+ tree for the following set of key values: [BL6] [CO5] [13]
2.3.5.7,11, 17.19.23.29.31)
Assume that the tree is initially empty and values are added in
ascending order.
Construct B +trees for the cases where the number of pointers that will
fit in one node is as follows.
a) Four
b) Six
c) Eight

You might also like