JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY HYDERABAD
JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY HYDERABAD B.Tech IV DATABASE MANAGEMENT SYSTEMS Previous Question Paper (July/August - 2022 - R18)
Answer any five questions
All questions carry equal marks
Main
What is data independence? Discuss its types.
Answer
Data independence is the capacity to change the schema definition in one level of a database system without requiring a change in the schema definition at the next higher level. It is a critical property that separates the physical storage of data from the conceptual and external views, ensuring that application programs remain unaffected by changes in data organization.
There are two types of data independence:
- Logical Data Independence: The ability to change the conceptual schema without having to change the external schemas or application programs. This allows for modifications such as adding new entities, attributes, or relationships to the database without breaking existing user views.
- Physical Data Independence: The ability to change the physical schema (internal level) without having to change the conceptual schema. This includes changes to storage structures, file organizations, or indexing strategies to improve performance, which remain transparent to the conceptual model and the users.
With a neat diagram describe the overall system structure of database system.
Answer
The overall structure of a database management system is designed to manage the interaction between users and the stored data. The architecture is typically divided into several key components:
- Query Processor: This component parses, optimizes, and executes user queries. It includes the DDL interpreter, DML compiler, and the query evaluation engine which determines the most efficient way to access data.
- Storage Manager: This is the interface between the low-level data stored in the database and the queries submitted to the system. It consists of the Authorization and Integrity Manager, Transaction Manager, File Manager, and Buffer Manager.
- Disk Storage: This represents the physical layer where the actual data, indices, and metadata (data dictionary) are stored.
The system structure functions by receiving a user request, which is processed by the Query Processor. The Query Processor then interacts with the Storage Manager to retrieve or update the necessary data from the physical storage. The Buffer Manager ensures efficient data transfer between disk and main memory, while the Transaction Manager guarantees ACID properties during concurrent operations.
Give examples for the following: Determinant, descriptive attribute, derived attribute, aggregation, partial participation.
Answer
Sign in to view the complete answer paper.
Construct an ER diagram for school admission system.
Answer
Sign in to view the complete answer paper.
Compare super key, candidate key, primary key, foreign key.
Answer
Sign in to view the complete answer paper.
Explain the steps in logical database design phase.
Answer
Sign in to view the complete answer paper.
Illustrate the ten operators used in Relational Algebra.
Answer
Sign in to view the complete answer paper.
What is an unsafe query in relational calculus? Give an example.
Answer
Sign in to view the complete answer paper.
Consider the following schema to write queries in SQL:
Parts( Pid, Pname, Description)
Supplier(Sno, Sname, Scity)
Supply(Pid, Sno, Price)
Find the names of the parts supplied by Hyderabad based suppliers.
Answer
Sign in to view the complete answer paper.
Find the names of the parts supplied only by Chennai based suppliers.
Answer
Sign in to view the complete answer paper.
Find the supplier for i7 systems at the least price.
Answer
Sign in to view the complete answer paper.
What is the need of schema refinement? Explain with an example.
Answer
Sign in to view the complete answer paper.
Contrast Boyce Codd normal form with fourth normal form.
Answer
Sign in to view the complete answer paper.
How does two phase locking protocol ensure serializability?
Answer
Sign in to view the complete answer paper.
Explain ARIES algorithm for recovery.
Answer
Sign in to view the complete answer paper.
Differentiate between sparse and dense index.
Answer
Sign in to view the complete answer paper.
With suitable example data records demonstrate extendible hashing as a dynamic indexing structure.
Answer
Sign in to view the complete answer paper.