JNTU
JNTU B.Tech II DATABASE MANAGEMENT SYSTEMS Previous Question Paper (May - 2019 - R16)
Note: This question paper contains two parts A and B. Part A is compulsory which carries 25 marks. Answer all questions in Part A. Part B consists of 5 Units. Answer any one full question from each unit.
Part A
What is DBMS? What are the advantages of DBMS?
Answer
A Database Management System (DBMS) is a software suite designed to define, create, maintain, and control access to a database, allowing users to store, retrieve, and update data efficiently while ensuring data integrity and security.
The primary advantages of using a DBMS include:
- Data Redundancy Control: Minimizes duplicate data storage, saving space and ensuring consistency.
- Data Sharing: Enables multiple users and applications to access the same data concurrently.
- Improved Data Security: Provides mechanisms to restrict unauthorized access through authentication and authorization.
- Data Integrity: Enforces constraints and rules to ensure the accuracy and reliability of stored data.
Explain generalization, specialization and aggregation in E-R Model.
Answer
These concepts are used to refine the Entity-Relationship model to better represent complex data relationships:
- Generalization: A bottom-up approach where multiple lower-level entities with common attributes are combined into a single, higher-level superclass entity. It emphasizes the shared characteristics of the entities.
- Specialization: A top-down approach where a higher-level entity is divided into lower-level sub-entities based on distinct characteristics or specific roles. It allows for the definition of attributes unique to specific subsets of the entity.
- Aggregation: A technique used to represent a relationship between an entity and another relationship. It treats a relationship as a single higher-level entity, allowing it to participate in further relationships without violating the standard binary constraints of the E-R model.
Define the terms primary key constrains and foreign key and check constraints.
Answer
Sign in to view the complete answer paper.
Explain the following Operators in SQL with examples: i) SOME ii) NOT IN.
Answer
Sign in to view the complete answer paper.
What is normalization? What are the conditions required for a relation to be in 1NF, 2NF?
Answer
Sign in to view the complete answer paper.
Explain what are the problems caused by redundancy.
Answer
Sign in to view the complete answer paper.
What is locking Protocol?
Answer
Sign in to view the complete answer paper.
Explain the ACID Properties of transaction with examples.
Answer
Sign in to view the complete answer paper.
What is Indexing and Hashing?
Answer
Sign in to view the complete answer paper.
Explain what are the differences between tree based and Hash based indexes.
Answer
Sign in to view the complete answer paper.
Part B
Develop an E-R Diagram for Banking enterprise system.
Answer
Sign in to view the complete answer paper.
Explain the functions of Database Administrator.
Answer
Sign in to view the complete answer paper.
Compare between super key, Candidate key, Primary Key for a relation with examples.
Answer
Sign in to view the complete answer paper.
Construct an ER-Diagram for a hospital with a set of patients and set of medical doctors. Associated with each patient a log of the various tests and examinations conducted.
Answer
Sign in to view the complete answer paper.
Explain the fundamental operations in relational algebra with examples.
Answer
Sign in to view the complete answer paper.
Explain various Domain constraints in SQL with examples.
Answer
Sign in to view the complete answer paper.
Let R =(ABC) and S=(DEF) let r(R) and s(S) both relations on schema Rand S. Formulate an expression in the Tuple relational calculus that is equivalent to each of the following. i) ∏A(r) ii) σp=19(r) iii) rXs iv) ∏A,F,( σC=D(rXs)).
Answer
Sign in to view the complete answer paper.
Explain various DML functions in SQL with examples.
Answer
Sign in to view the complete answer paper.
When is a decomposition said to be dependency preserving? Why this property Useful? Explain.
Answer
Sign in to view the complete answer paper.
Determine the closer of the following set of functional dependencies for a relation scheme. R(A,B,C,D,E,F,G,H), F={ AB→C, BD→EF, AD→G, A→H} List the candidate keys of R.
Answer
Sign in to view the complete answer paper.
Suppose that we decompose the schema R = (A, B, C, D, E) into R1 (A, B, C) and R2 (A, D, E). Determine that this decomposition is a lossless-join decomposition or dependency preserving if the following set F of functional dependencies holds: A → BC, CD → E, B → D, E → A
Answer
Sign in to view the complete answer paper.
Explain 2NF, 3NF and BCNF Normal forms with example. What is the difference between 3NF and BCNF?
Answer
Sign in to view the complete answer paper.
Explain the Time Stamp - Based Concurrency Control protocol. How is it used to ensure serializability?
Answer
Sign in to view the complete answer paper.
Explain the Check point log based recovery scheme for recovering the data base.
Answer
Sign in to view the complete answer paper.
Explain multiple granularity of locking protocol with example.
Answer
Sign in to view the complete answer paper.
What is serializability? Explain.
Answer
Sign in to view the complete answer paper.
Explain about Validation-Based Protocol.
Answer
Sign in to view the complete answer paper.
Explain the Insertion and deletion Operations in B+ trees with example.
Answer
Sign in to view the complete answer paper.
Explain Deletion and insertion operations in ISAM with example.
Answer
Sign in to view the complete answer paper.
Explain how does it handles insert and delete operations Extendable hashing?
Answer
Sign in to view the complete answer paper.