Study for the day when you don't have to worry about price tags.
--Your friends at LectureNotes

Previous Year Exam Questions for Database Management System - DBMS of 2018 - CEC by Bput Toppers

  • Database Management System - DBMS
  • 2018
  • PYQ
  • Biju Patnaik University of Technology BPUT - BPUT
  • Chemical Engineering
  • B.Tech
  • 1 Offline Downloads
  • Uploaded 6 months ago
Bput Toppers
Bput Toppers
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. BECS2208 4th Semester Back Examination 2017-18 DATABASE MANAGEMENT SYSTEM BRANCH : BIOMED, BIOTECH, CHEM, ENV, FASHION, FAT, METTA, MINERAL, MINING, MME, PLASTIC, TEXTILE Time : 3 Hours Max Marks : 70 Q.CODE : C994 Answer Question No.1 which is compulsory and any five from the rest. The figures in the right hand margin indicate marks. Answer all parts of a question at a place. Q1 a) b) c) d) e) f) g) h) i) j) Answer the following questions : What are different DBMS facilities? What is schema and subschema? Define atomicity and aggregation ? What are the primitive operations common to all record management System? What is meant by query optimization? What do database languages do? Compare Non-clustered and clustered index. Enlist the various transaction phases. What is a checkpoint and When does it occur? What is data dictionary? Q2 a) b) Draw & explain 3-tier schema architecture of DBMS ? What are the factors of DBMS? (5) (5) Q3 a) Design an E-R diagram for Banking System. Find out the entity, attributes and relationships. Check the relation is in which normal form? If required, then convert it into 2nd normal form. Relation is R(A,B,C,D,E) and functional dependencies are F={ A>C, B->E, AB->d } (5) Write the query using tuple calculus & domain calculus. Given 3 relations are: Emp(e#, ename, sal) Assigned-to(e#, p#) Project(p#, pname, chief) (i) Display employee no(e#), employee name of those employees either getting salary more than 5000 or their employee no is greater than 105. (ii) Display name of the chief under whom ‘Peter’ is working. (iii) Display employee no and Project no(p#) of those employee whose chief is ‘Mark’. How B-tree is differentiate from B+ tree? Give an example. (5) Differentiate between relational algebra and relational calculus with given example. Why concurrency control is needed? Explain with an example. (5) b) Q4 a) b) Q5 a) b) (2 x 10) (5) (5) (5)

Text from page-2

Q6 a) b) Q7 Q8 a) b) c) d) Define & explain ARIES algorithm technique for data base recovery. What is shadow paging? Why it is used? (5) (5) Given a relation R(A,B,C,D,E) F = {A->B, AC->D, D->E, E->A} Check whether the relation is in 3NFor not. If not decompose into 3NF. Find out the decomposition is loss-less or lossy. (10) Write short answer on any TWO : Data base failures Serializable Schedule Parallel Data base Data ware house & Data mining (5 x 2)

Lecture Notes