B.TECH - Semester 4 database design Question Paper 2020 (sep)
Practice authentic previous year university questions for better exam preparation.
Sample Questions
- 405 : DATABASE DESIGN (FR) (2013 Scheme) Time : 3 Hours Max. Marks : 100 PART - A Answer all questions. Each carries 4 marks.
- Discuss the Data Independence in layered architecture of DBMS.
- What are basic set operations available in SQL. Write examples.
- Define Functional dependency. How equivalence of two Functional dependency set can be determined?
- Differentiate between Primary Index, Secondary Index and Clustered Index.
- What is the need for Query optimization and how relational algebra can help on Query optimization? PART - B Answer any one full questions from each Module. Each question carries 20 marks.
- (a) Amal has a large Book collection. His friends like to borrow his Books, and he needs a way to keep track of who has what. He maintains a list of friends, identified by unique FID's (Friend Identifiers) and a list of Book's, identified by BID's (B...
- (b) Design and explain a sample scenario of Database requirements to have
- (i) Unary relationship (ii) Attributes to relationship. OR
- (a) List different types of attributes and their representation in ER Diagram.
- (b) Explain any two specific features of Extended ER Diagram.
- (c) Distinguish between the following, with suitable example.
- (i) Super Key, Candidate Key and Primary Key. (ii) Weak Entity and Strong Entity. (iii) Entity Type and Entity Set.
- (a) Consider the following relations to the registration of students and their examination result. Student (Student ID: String, SName: String, Address: String) Subject (Sid: String, Name : String, Department: String) Result (Student ID:String, Cid:S...
- (i) Find the names of students, who had taken subject from 'CSE' department. (ii) Find the names of students who had taken subject from both 'CSE and 'ECE' departments. (iii) Find the names of students who had taken subject named 'DBMS'. (iv) Find th...
- (v) Find the total marks received by the student ' $A B C S$, from all subjects taken. (vi) List each subject and average marks scored, sorted in the alphabetical order of subject names.
- (b) Explain any six relational algebra operators with example.
- (a) What are different DDL statements ? Explain SQL statement with example.
- (b) What are Views in SQL? Compare Views with Tables.
- (c) What are Triggers in SQL?
- (a) For the relations schemas given below, identify keys and highest normal forms
- (i) $\quad R(A, B, C, D, E)$ with set of functional dependencies. $$ G=\{A->D, B->A, B C->D, A C->B E\} $$ (ii) $\quad R(A, B, C, D, E, F)$ with set of functional dependencies, $$ F=\{A \rightarrow B, B C \rightarrow D, C \rightarrow E, B \rightar...
- (b) Explain how equivalency of two given Functional Dependency sets are to be checked and Find the equivalency of Functional Dependency sets $F=\{X \rightarrow Y, Y \rightarrow Z, X \rightarrow Z\}$ and $G=\{X \rightarrow Y, Y \rightarrow Z, X \right...
- (a) Consider the ER diagram.
- (i) Identify the set of relations required to map this ER model to a relational model. (ii) Identify all Primary keys and Foreign Keys. Draw a schema diagram showing all relations.
- (b) Define lossless and dependency preserving decomposition of relations. Check whether the relation $R(A, B, C, D)$ with set of Functional Dependency, $F=\{A B \rightarrow C D\}$ decomposing into $R 1(A, B, C)$ and $R 2(A, D)$ is lossless and depend...
- (a) What are the basic properties required for a Database Transaction? Explain with the help of simple transaction.
- (b) Explain conflict serializable schedules.
- (c) Describe the structure of B Tree nodes. How does B+ tree differ from B Tree?
- (a) Explain 2PC locking protocol. Whether it guarantee serializability and deadlock free?
- (b) Explain recoverability in Database Transactions. Differentiate between recovery with immediate update and recovery with deferred update.