×
When you want to succeed as bad as you want to breathe, then you’ll be successful.
--Your friends at LectureNotes
Close

Previous Year Exam Questions for Database Systems - DS of 2018 - CEC by Bput Toppers

by Bput ToppersBput Toppers
Type: PYQInstitute: Biju Patnaik University of Technology BPUT Course: B.Tech Specialization: Computer Science EngineeringViews: 42Uploaded: 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. PCS4G001 4th Semester Regular / Back Examination 2017-18 DATABASE SYSTEM BRANCH : CSE Time : 3 Hours Max Marks : 100 Q.CODE : C1148 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) g) h) Part – A (Answer all the questions) Answer the following questions: multiple type or dash fill up type: A view of database that appears to an application program is known as: a. Schema b. Subschema c. virtual table d. none of the above An abstraction concept for building composite object from their component object is called: a. Specialization b. Normalization c. Generalization d. Aggregation The number of entities to which another entity can be associated via a relationship set is expressed as: a. Entity b. Cardinality c. Schema d. Attributes In ER model the details of entities are hidden from the user, is called: a. Generalization b. Specialization c. Abstraction d. none of these The file organization that provides very fast access to any arbitrary record of a file is: a. Ordered file b. Unordered file c. Hashed file d. B-tree 4NF is designed to cope with: a. Transitive dependency b. Join dependency c. Multi valued dependency d. None of these Every Boyce-Codd normal form is in a. 1NF b. 2NF c. 3NF d. All of the above Rollback of transactions is normally used to: a. recover from transaction failure b. update the transaction c. retrieve old records d. repeat a transaction A super key is a set of one or more attributes that, allow us a. to identify uniquely an entity in the entity set b. to make the key most powerful for faster retrieval c. to increase effectiveness of database access d. none of the above Prevention of access to the database by unauthorized users is referred: a. Integrity b. Productivity c. Security d. Reliability Answer the following questions: Short answer type: What is data independence? What is transparent DBMS? What is time stamping? What is deadlock? How can it be avoided? How can it be resolved once it occurs? Enlist the advantages of normalizing database. What is meant by query optimization? What is transitive Dependency? What is a transaction? What are ACID properties? (2 x 10) (2 x 10)
i) j) Q3 a) b) Q4 a) What is 5NF or PJNF (Project Normal Form)? What is RAID Technology? Part – B (Answer any four questions) Explain the advantages of data base management system over file management system. Define various data base users. Explain. (10) (5) (10) b) A university registrar’s office maintains data about the following entities: Courses (number, title, credits, syllabus, and prerequisites); Course offerings (course_no, year, semester, section_no, instructor(s), timings, classroom); Student ( student_id, name, program); Instructor ( identification_no, name, dept, title); Further, the enrollment of students in each course they are enrolled for must be appropriately modeled. Construct an E-R diagram for the registrar’s office. Construct appropriate tables for the above E-R diagram. Explain QBE with an example? Q5 a) b) Specify the different types of file accessing method. Write short note on hashing technique. (10) (5) Q6 a) Consider the following relation R (A,B,C,D,E) and functional dependencies F= { A->BC, C->A,D->E, F->A, E->D } & decomposed R into R1(A, C, D), R2(B, C, D) and R3(E,F,D). Is it lossless or not? Differentiate between relational algebra and relational calculus. (10) Explain the types of data ware house and the steps needed to build a data ware house. Differentiate between OLAP and OLTP. (10) b) Q7 a) b) (5) (5) (5) Q8 a) b) What is lock? Explain types of locks. Why dead lock arises? Consider two transactions : T1 & T2 Transaction T1:= read-item(A) T2:= read-item(A) A=A-50; temp=A * 0.1; Write-item(A) A=A-temp; Read-item(B) write-item(A) B=B+50; read-item(B) Write-item(B) B=B+temp; Write-item(B) Find out which no serial schedule is a serializable schedule? (10) (5) Q9 a) b) Explain the different types of data base recovery techniques. What is transaction ? Define the properties & life cycle of a transaction? (10) (5)

Lecture Notes