It does not matter how slowly you go as long as you do not stop.
--Your friends at LectureNotes

Previous Year Exam Questions of Database Management System of bput - DBMS by Verified Writer

  • Database Management System - DBMS
  • 2017
  • PYQ
  • Biju Patnaik University of Technology BPUT - BPUT
  • Electronics and Communication Engineering
  • B.Tech
  • 94 Offline Downloads
  • Uploaded 11 months ago
0 User(s)
Download PDFOrder Printed Copy

Share it with your friends

Leave your Comments

Text from page-1

Registration no: Total Number of Pages: 02 B.Tech FEEC6301 5th Semester Back Examination 2017-18 Data Base Management Systems BRANCH : AEIE, ECE, EEE, EIE, ELECTRICAL, ETC, IEE Time: 3 Hours Max Marks: 70 Q.CODE: B143 Answer Question No.1 which is compulsory and any five from the rest. The figures in the right hand margin indicate marks. Q1 a) b) c) d) e) f) g) h) i) j) Q2 a) b) Q3 a) b) Answer the following questions: Define the following terms: primary key, candidate key, foreign key and super key. Draw an E-R diagram to depict the features of specialization and generalization. For the relations R and S given below compute the following relational algebra operations: (i) A,C(R) (ii) B = 2(S) (iii) Natural Join (iv) Cartesian Product R A B C 1 2 3 4 5 6 7 8 9 S B C D 2 3 10 2 3 10 6 7 12 Suppose that we decompose the schema R =(A, B, C, D, E) into (A, B, C) and (A, D, E). Show that this decomposition is a lossless-join decomposition if the following set F of functional dependencies holds: F = {A → BC, CD → E, B → D, E → A} Explain the relevance of System Catalogue in a Database System. Differentiate between DDL and DML along with some examples of both. List all possible sequences of states through which a transaction may pass during its lifetime. What is a recoverable schedule? Why is recoverability of schedules desirable? What is timestamp ordering based concurrency-control scheme? What is checkpoint mechanism? How often should checkpoints be performed? (2 x 10) Differentiate between logical database design and physical database design. Show how this separation leads to data independence. Compare the three data models namely relational, network and hierarchical along with their advantages and disadvantages. (5) Draw and explain the three level architecture of the database system. Construct an E-R diagram for a hospital with a set of patients and a set of medical doctors. Associate with each patient a log of the various tests and examinations conducted. The hospital tables are as follows : patients(patient-id, name, insurance, date-admitted, date-checked-out) doctors(doctor-id, name, specialization) test(testid, testname, date, time, result) doctor-patient(patient-id, doctor-id) test-log(testid, patient-id) (5) (5) (5)

Text from page-2

performed-by(testid, doctor-id) Tables mentioned in italics indicate the various relationships among the three entities patients, doctors and test. The underlined attributes signify the primary key in each table. Q4 a) Consider the following relations: S (S#, SNAME, STATUS, CITY) SP (S#, P#, QTY) P (P#, PNAME, COLOR, WEIGHT, CITY) Give an expression in SQL for each of queries below: (i) Get supplier names for supplier who supply at least one red part (ii) Get supplier names for supplier who do not supply part P2. Consider the following relational schema: PERSON (SS#, NAME, ADDRESS) CAR (REGISTRATION_NUMBER, YEAR, MODEL) ACCIDENT (DATE, DRIVER, CAR_REG_NO) OWNS (SS#, LICENSE) Construct the following relational algebra queries: (i) Find the names of persons who are involved in an accident. (ii) Find the registration number of cars which were not involved in any accident. (5) What are inference rules for functional dependencies? Discuss the Armstrong’s Inference rules. Use Armstrong’s axioms to prove the soundness of the decomposition rule. Consider the relation schema R = (A, B, C, D, E) with the following set of functional dependencies F = {A → BC, CD → E, B → D, E → A}. Suppose R is decomposed into R1(A, B, C) and R2(A, D, E). Check whether this decomposition satisfy the properties of lossless-join decomposition and dependency-preserving. (5) Explain the concept of conflict serializability with example of an conflict serializable schedule. Compare the deferred-modification and immediate-modification versions of the log-based recovery scheme with suitable examples. (5) Q7 What is two-phase locking protocol? Discus the different variants of the protocol. Show that the two-phase locking protocol ensures conflict serializability and transactions can be serialized according to their lock points. (10) Q8 Write short answer on any TWO : Tuple Relational Calculus vs. Domain Relational Calculus ER Model to Relational Model Mapping Precedence Graph Types of Database Failure b) Q5 a) b) Q6 a) b) a) b) c) d) (5) (5) (5) (5 x 2)

Lecture Notes