0% found this document useful (0 votes)
14 views

DBMS question bank (1)

The document is a question bank for the Guru Nanak Institutions Technical Campus, specifically for the School of Engineering & Technology. It includes questions categorized by Bloom's Taxonomy levels across various units related to database management systems (DBMS), relational algebra, SQL, normalization, transactions, and file organization methods. Each question is associated with a specific course outcome and is designed to assess students' understanding and application of key concepts in database systems.
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)
14 views

DBMS question bank (1)

The document is a question bank for the Guru Nanak Institutions Technical Campus, specifically for the School of Engineering & Technology. It includes questions categorized by Bloom's Taxonomy levels across various units related to database management systems (DBMS), relational algebra, SQL, normalization, transactions, and file organization methods. Each question is associated with a specific course outcome and is designed to assess students' understanding and application of key concepts in database systems.
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/ 6

GURU NANAK INSTITUTIONS TECHNICAL CAMPUS (AUTONOMOUS)

SCHOOL OF ENGINEERING & TECHNOLOGY

QUESTION BANK
BTL- Blooms Taxonomy Level
Level 1 - Remembering
Level 2 - Understanding
Level 3 - Applying
Level 4 - Analyzing
Level 5 - Evaluating
Level 6 - Creating
MID-1
Q. No. Question BTL Course
Outcome
Unit – I Part - A (2 Marks)
1 How did the development of DBMSs address the limitations of earlier file systems L1 CO1
Name two key differences between file systems and a Database Management System
2 L1 CO1
(DBMS).
3 Define a data model in the context of a DBMS. L1 CO1
4 List the three levels of abstraction in a DBMS. L1 CO1
5 What is data independence in a DBMS? L1 CO1
6 Outline the properties of ER diagram. L2 CO1
7 Explain the three levels of abstraction. L2 CO1
Why is a DBMS generally preferred over a traditional file system for large-scale data
8 L1 CO1
management?
Part - B (5 Marks)
1 Summarize the evolution of data management from file systems to DBMS. Highlight their L2 CO1
impact on the development of modern database systems.
2 Analyze the challenges faced by early file systems that led to the development of L4 CO1
DBMS also explain the means by which DBMS resolve these issues?

3 Explain the three levels of abstraction in a DBMS (physical, logical, and view levels) and L2 CO1
by what means do these levels contribute to data independence and system efficiency?
4 Demonstrate how ER diagrams are used in the database design process also mention the L2 CO1
key components of an ER diagram, and their role in real-world data?
5 Illustrate the architecture of a DBMS, highlighting the roles of its main components such L2 CO1
as the storage manager, query processor, and transaction manager.
6 Identify the various types of relationships (one-to-one, one-to-many, many-to-many) in a L3 CO1
database design. How do these relationships impact the structure and integrity of the
database?
7 Define entities, attributes, and entity sets in the context of an ER model. Mention how L1 CO1
these components interact to form the foundation of a database design?
8 Outline the significance of cardinality and participation constraints in an ER model and L2 CO1
their key role in the design and implementation of a database?
Unit - II
Part - A (2 Marks)
1 List the properties of relational algebra. L1 CO2
2 Differentiate the cardinality and arity of a relation. L2 CO2
3 How to rename a relational algebra expression? L1 CO2
GURU NANAK INSTITUTIONS TECHNICAL CAMPUS (AUTONOMOUS)
SCHOOL OF ENGINEERING & TECHNOLOGY

4 What is a super key? L1 CO2


5 Name two SQL commands commonly used to query relational data. L1 CO2
6 Discover the difference between union and set-difference operation. L1 CO2
7 Write short notes on Cartesian product operation. L1 CO2
8 Explain how a DBMS enforce integrity constraints when data is inserted into a table? L1 CO2
Part - B (5 Marks)
1 Compare tuple relational calculus and Domain relational calculus. L2 CO2
2 Illustrate the fundamental operations in relational algebra with examples. L2 CO2
3 Analyze the role of integrity constraints in maintaining the accuracy and consistency of L4 CO2
data in a relational database. Point out the different types of integrity constraints with
examples.
4 What are views in a relational database, and how do they differ from tables? Discuss the L1 CO2
advantages of using views, including how they can enhance security and simplify complex
queries..
5 Explain the process of querying relational data using SQL. How do SELECT statements, L2 CO2
combined with WHERE clauses and JOIN operations, allow users to retrieve specific data
from multiple related tables?
6 How the database can be modified using relational algebra? L1 CO2
7 Describe the process of creating and managing views in a relational database. How can L2 CO2
views be used to present data in different formats without altering the underlying tables?
8 Discuss how a DBMS enforces integrity constraints during data manipulation operations L2 CO2
such as INSERT, UPDATE, and DELETE. How does the enforcement of these constraints
affect database integrity?
Unit - III
Part - A (2 Marks)
1 State the main function of a SQL SELECT statement. L1 CO3
2 Explain the function of the UNION operator in SQL. L2 CO3
3 Define a subquery (nested query) in SQL. L1 CO3
4 Illustrate the significance of a NULL value in SQL. L2 CO3
5 Analyze the purpose of the GROUP BY clause in conjunction with aggregation operators? L4 CO3
6 Discuss the treatment of comparisons with NULL values in SQL. L2 CO3
7 Describe a complex integrity constraint in SQL. L2 CO3
8 What is a trigger in SQL, and when is it typically used? L1 CO3
Part - B (5 Marks)
1 Compare the UNION, INTERSECT, and EXCEPT operators in SQL. Provide examples to L4 CO3
illustrate the differences in their functionality and discuss scenarios where each operator
would be most appropriate.
2 Demonstrate the structure of a basic SQL query. Discuss the role of key clauses such as L2 CO3
SELECT, FROM, WHERE, and ORDER BY, providing examples of how they are used to
retrieve and filter data.
3 Interpret the importance of group by and having clauses in SQL with an example L2 CO3
4 Describe the process of constructing a SQL query to retrieve data from multiple tables L2 CO3
using JOIN operations. Include examples of INNER JOIN, LEFT JOIN, and RIGHT JOIN.
5 Discuss the impact of using UNION, INTERSECT, and EXCEPT on query performance. L2 CO3
How does SQL handle duplicates in the results when using these operators? Write the
statements in SQL for the following.
6 List out the function of aggregation operators such as COUNT, SUM, AVG, MIN, and L1 CO3
GURU NANAK INSTITUTIONS TECHNICAL CAMPUS (AUTONOMOUS)
SCHOOL OF ENGINEERING & TECHNOLOGY

MAX in SQL. Provide examples of queries that use these operators along with GROUP
BY to summarize data.
7 Explain the concept of NULL values in SQL and their implications for database operations. L2 CO3
How do NULL values affect the results of SQL queries, especially when using functions
like COUNT, SUM, and AVG?
8 What are the challenges associated with handling NULL values in SQL, particularly in L1 CO3
conditional statements and JOIN operations? Provide examples to illustrate these
challenges.
GURU NANAK INSTITUTIONS TECHNICAL CAMPUS (AUTONOMOUS)
SCHOOL OF ENGINEERING & TECHNOLOGY

MID-2

Unit - III
Part - A (2 Marks)
1 What issues can arise from data redundancy in a relational database? L1 CO3
2 How does data redundancy affect the consistency and integrity of a database? L1 CO3
3 Explain the concept of decomposition in database schema refinement. L2 CO3
4 Why is decomposing a relation into smaller relations often necessary in database design? L1 CO3
5 Discuss the potential problems that can occur with decomposition in database design? L2 CO3
6 Define functional dependency in relational database theory? L1 CO3
7 How does understanding functional dependencies help in the normalization process? L1 CO3
8 State the additional condition required for a table to be in Second Normal Form (2NF) L1 CO3
beyond being in First Normal Form (1NF)
Part - B (5 Marks)
1 What is the impact of redundancy on relational databases? Include how redundancy leads L1 CO3
to data integrity issues and update anomalies, and provide illustrative examples.
2 Outline the process and advantages of decomposing a relation into smaller relations during L2 CO3
schema refinement. Explain how this method resolves redundancy and data anomalies.
3 Identify potential problems associated with decomposing relations in a database schema. L3 CO3
Suggest methods to address issues like information loss or anomalies, and include
examples.
4 Describe how functional dependencies contribute to the normalization process. Illustrate L2 CO3
their role in determining the normal form of a relation with examples.
5 Define the criteria for a relation to be in First Normal Form (1NF). Discuss how converting L3 CO3
a relation to 1NF reduces redundancy and provide an example of a table that requires
transformation to achieve 1NF.
6 Detail the requirements for a relation to be in Second Normal Form (2NF) beyond First L3 CO3
Normal Form (1NF). Explain how 2NF tackles partial dependencies and enhances database
design, with an example.
7 Clarify the requirements for a relation to achieve Third Normal Form (3NF). Discuss how L2 CO3
3NF differs from Second Normal Form (2NF) in handling transitive dependencies, and
provide an example of a 2NF relation needing refinement to reach 3NF.
8 Discuss the concept of lossless join decomposition in database normalization. Explain its L3 CO3
significance in ensuring that decompositions allow for the original relation to be
reconstructed without information loss, using an example.
Unit - IV
Part - A (2 Marks)
1 In a database system, what constitutes a transaction? L1 CO4
2 Explain the main function of transactions within a database management system (DBMS). L2 CO4
3 List the different states a transaction can be in within a DBMS. L1 CO4
4 Analyze the significance of a transaction being in the "committed" state? L4 CO4
5 What is meant by atomicity in the context of database transactions? L1 CO4
6 Describe the methods used to guarantee durability in a database after a transaction is L2 CO4
committed.
7 Discuss the significance of concurrency control in environments with multiple users L3 CO4
accessing the database.
8 Why ensuring recoverability is crucial for a database management system (DBMS). L1 CO4
GURU NANAK INSTITUTIONS TECHNICAL CAMPUS (AUTONOMOUS)
SCHOOL OF ENGINEERING & TECHNOLOGY

Part - B (5 Marks)
Discuss the concept of a transaction in a database system. Explain its key properties and
why they are important for maintaining data integrity. Provide examples to illustrate how
1 L3 CO4
transactions ensure the consistency of a database.

Describe how atomicity and durability are implemented in a database system. Discuss CO4
techniques such as transaction logs, checkpoints, and recovery procedures that help achieve
2 these properties. Provide examples of how these techniques ensure that transactions are L2
processed reliably and completely.

Frame the principles of timestamp-based protocols for concurrency control. Explain how CO4
timestamps are used to order transactions and ensure serializability. Provide examples of
3 timestamp-based protocols, such as the Thomas Write Rule, and discuss their advantages L2
and limitations.

How isolation is implemented in transaction processing. Describe various isolation levels, CO4
such as Read Uncommitted, Read Committed, Repeatable Read, and Serializable, and
4 discuss their impact on concurrent transactions. Provide examples to illustrate the trade- L1
offs between different isolation levels.

Explain the concept of recoverability in database systems. Explain the importance of CO4
ensuring that a database can be restored to a consistent state after a failure, and describe
5 strategies used to achieve recoverability, such as logging and backup techniques. Provide L2
examples of how these strategies are applied in practice.

What is the concept of serializability in the context of transaction management? Describe CO4
different methods to achieve serializability, such as locking protocols and timestamp
6 ordering. Provide examples to demonstrate how these methods ensure that the outcome of L1
concurrent transactions is equivalent to some serial execution.

Analyze the challenges of concurrent execution of transactions in a database system. CO4


Discuss the techniques used to manage concurrency, such as locking and timestamp
7 ordering, and how these techniques help in maintaining data consistency and isolation L3
between transactions.

List the various states a transaction can be in within a database management system. CO4
Describe the transitions between these states and the significance of each state in ensuring
8 L1
the proper execution and management of transactions.

Unit - V
Part - A (2 Marks)
1 What is meant by external storage in the context of data management? L1 CO5
2 List the operations performed in file organization. L1 CO5
3 Why is external storage important for handling large datasets in database systems? L1 CO5
4 Write short notes on ISAM. L6 CO5
5 Define B+ tree. L1 CO5
GURU NANAK INSTITUTIONS TECHNICAL CAMPUS (AUTONOMOUS)
SCHOOL OF ENGINEERING & TECHNOLOGY

6 How does a cluster index improve query performance in a database? L1 CO5


7 Illustrate the allocation of pages in ISAM. L2 CO5
8 Differentiate between a primary index and a secondary index. L2 CO5
Part - B (5 Marks)
1 Discuss in detail about file organization methods. L2 CO5
2 Construct a B+ tree for the following set of values: (2,3,5,7,11,17,19,23,29,31) L3 CO5
Assume that the tree is empty initially and values are added in ascending order. Construct a
B+ tree for the cases where number of pointers that will fit in one node is as follows:
a) Four b) Eight
3 Describe the insertion and deletion operation in B+ trees. L2 CO5
4 Analyze various index data structures used in databases, such as B-trees and hash indexes. L3 CO5
Discuss the advantages and disadvantages of each data structure in terms of efficiency,
query performance, and use cases. Provide examples of situations where each index
structure would be most appropriate
5 Explain how insert and delete operations are handled in static hash index. L2 CO5
6 Compare different file organization methods, such as sequential, heap, and clustered file L2 CO5
organizations. Discuss how each method affects data retrieval efficiency, update
operations, and overall database performance. Provide examples to illustrate the scenarios
where each file organization method is best suited.
7 How to organize data entries using indexing? Discuss. L2 CO5

You might also like