×
Every great story on the planet happened when someone decided not to give up, but kept going no matter what.
--Your friends at LectureNotes
Close

Previous Year Exam Questions of Database Management System of bput - DBMS by Bput Toppers

by Bput ToppersBput Toppers
Type: PYQInstitute: Biju Patnaik University of Technology BPUT Course: B.Tech Specialization: Computer Science EngineeringOffline Downloads: 3Views: 197Uploaded: 3 months ago

Share it with your friends

Suggested Materials

Leave your Comments

Contributors

Bput Toppers
Bput Toppers
Registration No : Total Number of Pages : 02 B.Tech. PCS4I103 4th Semester Regular / Back Examination 2017-18 DATABASE SYSTEM BRANCH : CSE Time : 3 Hours Max Marks : 100 Q.CODE : C771 Answer Part-A which is compulsory and any four from Part-B. 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) Q2 a) b) c) d) e) f) Part – A (Answer all the questions) Answer the following questions: multiple type or dash fill up type: Which one of the following is a procedural language? a. Domain relational calculus b. Tuple relational calculus c. Relational algebra d. Query language The scheme for hierarchical data base is _____. a. a tree b. a graph c. a B-tree d. none of the above Which defines the structure of a relation which consists of a fixed set of attributedomain pairs? a. Instance b. Schema c. Program d. Super Key Data independence means a. data is defined separately and not included in programs. b. programs are not dependent on the physical attributes of data c. programs are not dependent on the logical attributes of data d. both B and C Which-one of the following statements about normal forms is FALSE? a. BCNF is stricter than 3 NF b. Lossless, dependency -preserving decomposition into 3 NF is always possible c. Loss less, dependency – preserving decomposition into BCNF is always possible d. Any relation with two attributes is BCNF View Answer The situation where the lock waits only for a specified amount of time for another lock to be released is a. Lock timeout b. Wait-wound c. Timeout d. Wait In order to undo the work of transaction after last commit which one should be used ? a. View b. Commit c. Rollback d. Flashback ______ will undo all statements up to commit? a. Transaction b. Flashback c. Rollback d. Abort Which level of RAID refers to disk mirroring with block striping? a. RAID level 1 b. RAID level 2 c. RAID level 0 d. RAID level 3 Which one of the following is a Stripping technique ? a. Byte level b. Raid level c. Disk level d. Block level Answer the following questions: Short answer type: What are advantages of DBMS over traditional file based systems? What is the difference between primary key and unique constraints? What are indexes? What is Functional Dependency? What is BCNF (Boyce-Codd Normal Form)? What is meant by query optimization? (2 x 10) (2 x 10)
g) h) i) j) What is transparent DBMS? Explain the difference between an exclusive lock and a shared lock? What are conflict serializable schedules? What is a Log File? b) Part – B (Answer any four questions) What is data independence? Discuss three tire schema architecture of data independence. Explain Database Administrator’s responsibilities. Q4 a) b) Draw an E-R model for Student Management System. Enlist the types of keys used in E-R diagram. (10) (5) Q5 a) b) Describe about the RAID structure with a labeled diagram. What is Data modeling and explain the types of data modeling in brief. (10) (5) Q6 a) Is the decomposition in 4NF always dependency preserving and lossless? Explain with an example. Define generalization and aggregation. Demonstrate generalization and aggregation using E-R diagram. (10) Q3 a) b) (10) (5) (5) Q7 a) b) Enlist briefly the types of data base recovery techniques. Describe about the different anomalies arise due to data redundancy ? Convert the following relation into 2NF. Emp-proj(e#, p#, hours, pname, ename, location) F = {e#,p#->hours, p#->pname,location, e#->ename} (10) (5) Q8 a) b) Describe ACID properties. Explain transaction life cycle. Why concurrency control is needed ? Explain the problems that would arise when concurrency control is not provided by the DB system? (10) (5) Q9 a) 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’. (iv) Display pname & Chief of those employees either working in p# ‘P005’ or having salary greater than 6000. (v) Display ename, p# of those employees working in pname ‘data base’ or ‘operating systems’. Differentiate between data ware house and data mining? (10) b) (5)

Lecture Notes