Name :. Roll No. :... Invigilator s Signature : DATABASE MANAGEMENT SYSTEM

Similar documents
2011 DATABASE MANAGEMENT SYSTEM

CS/B.Tech/CSE/New/SEM-6/CS-601/2013 DATABASE MANAGEMENENT SYSTEM. Time Allotted : 3 Hours Full Marks : 70

Techno India Batanagar Computer Science and Engineering. Model Questions. Subject Name: Database Management System Subject Code: CS 601

Northern India Engineering College, New Delhi Question Bank Database Management System. B. Tech. Mechanical & Automation Engineering V Semester

Name :. Roll No. :... Invigilator s Signature : DATABASE MANAGEMENT SYSTEM

CS2255 DATABASE MANAGEMENT SYSTEMS QUESTION BANK UNIT I

MASSACHUSETTS INSTITUTE OF TECHNOLOGY Database Systems: Fall 2008 Quiz I

A7-R3: INTRODUCTION TO DATABASE MANAGEMENT SYSTEMS

DATABASE MANAGEMENT SYSTEMS

CMSC 461 Final Exam Study Guide

CS6302- DATABASE MANAGEMENT SYSTEMS- QUESTION BANK- II YEAR CSE- III SEM UNIT I

VIEW OTHER QUESTION PAPERS

Database Management Systems (CS 601) Assignments

Sankalchand Patel College of Engineering, Visnagar B.E. Semester III (CE/IT) Database Management System Question Bank / Assignment

SYED AMMAL ENGINEERING COLLEGE

MaanavaN.Com DEPARTMENT OF COMPUTER SCIENCE & ENGINEERING QUESTION BANK

VALLIAMMAI ENGINEERING COLLEGE

Database Management Systems Paper Solution

A7-R3: INTRODUCTION TO DATABASE MANAGEMENT SYSTEMS

CSE 444, Winter 2011, Midterm Examination 9 February 2011

VU Mobile Powered by S NO Group All Rights Reserved S NO Group 2013

Babu Banarasi Das National Institute of Technology and Management

Database Management Systems (Classroom Practice Booklet Solutions)

Data about data is database Select correct option: True False Partially True None of the Above

. : B.Sc. (H) Computer Science. Section A is compulsory. Attempt all parts together. Section A. Specialization lattice and Specialization hierarchy

Bachelor in Information Technology (BIT) O Term-End Examination

Attach extra pages as needed. Write your name and ID on any extra page that you attach. Please, write neatly.

Total No. of Questions :09] [Total No. of Pages : 02. II/IV B.Tech. DEGREE EXAMINATIONS, NOV/DEC Second Semester CSE/IT DBMS

8) A top-to-bottom relationship among the items in a database is established by a

Rajiv GandhiCollegeof Engineering& Technology, Kirumampakkam.Page 1 of 10

IMPORTANT: Circle the last two letters of your class account:

Course Outline Faculty of Computing and Information Technology

Examination paper for TDT4145 Data Modelling and Database Systems

DATABASE MANAGEMENT SYSTEM

AC61/AT61 DATABASE MANAGEMENT SYSTEMS JUNE 2013

CS403- Database Management Systems Solved MCQS From Midterm Papers. CS403- Database Management Systems MIDTERM EXAMINATION - Spring 2010

Example Examination. Allocated Time: 100 minutes Maximum Points: 250

Administrivia. CS186 Class Wrap-Up. News. News (cont) Top Decision Support DBs. Lessons? (from the survey and this course)

B.C.A DATA BASE MANAGEMENT SYSTEM MODULE SPECIFICATION SHEET. Course Outline

CSE 444 Midterm Exam

ADVANCED DATABASES ; Spring 2015 Prof. Sang-goo Lee (11:00pm: Mon & Wed: Room ) Advanced DB Copyright by S.-g.

Sample Question Paper

Department of Information Technology B.E/B.Tech : CSE/IT Regulation: 2013 Sub. Code / Sub. Name : CS6302 Database Management Systems

The University of British Columbia Computer Science 304 Practice Final Examination

1. (a) Briefly explain the Database Design process. (b) Define these terms: Entity, Entity set, Attribute, Key. [7+8] FIRSTRANKER

Solutions to Final Examination

Conceptual (high-level, semantic)/ Physical (low-level, internal)/ Implementation (representational)

Solutions to Final Examination

Part A (Compulsory) (Marks : 10) Answer all ten questions (20 words each). Each question carries equal marks.

Q.1 Short Questions Marks 1. New fields can be added to the created table by using command. a) ALTER b) SELECT c) CREATE. D. UPDATE.

The University of Nottingham

CS403- Database Management Systems Solved Objective Midterm Papers For Preparation of Midterm Exam

GUJARAT TECHNOLOGICAL UNIVERSITY

E.G.S. PILLAY ENGINEERING COLLEGE (An Autonomous Institution, Affiliated to Anna University, Chennai) Nagore Post, Nagapattinam , Tamilnadu.

Assignment Session : July-March

DATABASE MANAGEMENT SYSTEM SHORT QUESTIONS. QUESTION 1: What is database?

INSTITUTE OF AERONAUTICAL ENGINEERING (Autonomous) Dundigal, Hyderabad

Name Class Account UNIVERISTY OF CALIFORNIA, BERKELEY College of Engineering Department of EECS, Computer Science Division J.

MCA (Revised) Term-End Examination December,

Database Management Systems


SYED AMMAL ENGINEERING COLLEGE

Q.2 a. List the main characteristics of database approach versus fileprocessing

UNIT 3 DATABASE DESIGN

Draw A Relational Schema And Diagram The Functional Dependencies In The Relation >>>CLICK HERE<<<

Delhi Noida Bhopal Hyderabad Jaipur Lucknow Indore Pune Bhubaneswar Kolkata Patna Web: Ph:

PESIT Bangalore South Campus

CSCE 4523 Introduction to Database Management Systems Final Exam Spring I have neither given, nor received,unauthorized assistance on this exam.

Normalization. Murali Mani. What and Why Normalization? To remove potential redundancy in design

Database Management Systems (Solutions for Vol 1_Classroom Practice Questions)

Material You Need to Know

Homework 3: Relational Database Design Theory (100 points)

Data Analysis. CPS352: Database Systems. Simon Miner Gordon College Last Revised: 12/13/12

COURSE PLAN. Computer Science and Engineering. COURSE DETAILS Name Of The Programme:: B.Tech Batch:: Systems

Goals for Today. CS 133: Databases. Final Exam: Logistics. Why Use a DBMS? Brief overview of course. Course evaluations

Question 1 (a) 10 marks

Final Review. CS 377: Database Systems

INSTITUTE OF AERONAUTICAL ENGINEERING (Autonomous) Dundigal, Hyderabad

Fundamentals of Database Systems

Come And Join us At Worlds Top Study Site

Sample Copy. Not For Distribution.

CS348: INTRODUCTION TO DATABASE MANAGEMENT (Winter, 2011) FINAL EXAMINATION

Jordan University of Science & Technology Computer Science Department CS 728: Advanced Database Systems Midterm Exam First 2009/2010

INSTITUTE OF AERONAUTICAL ENGINEERING

INSTITUTO SUPERIOR TÉCNICO Administração e optimização de Bases de Dados

Objective. The goal is to review material covered in Chapters 1-5. Do the following questions from the book.

Computer Science 304

D.K.M COLLEGE FOR WOMEN(AUTONOMOUS),VELLORE DATABASE MANAGEMENT SYSTEM QUESTION BANK

COSC Dr. Ramon Lawrence. Emp Relation

CPS510 Database System Design Primitive SYSTEM STRUCTURE

Introduction to Database Systems. Announcements CSE 444. Review: Closure, Key, Superkey. Decomposition: Schema Design using FD

Chapter 10. Normalization. Chapter Outline. Chapter Outline(contd.)

MIDTERM EXAMINATION Spring 2010 CS403- Database Management Systems (Session - 4) Ref No: Time: 60 min Marks: 38

1. (a) Explain the Transaction management in a database. (b) Discuss the Query Processor of Database system structure. [8+8]

Transactions and Concurrency Control. Dr. Philip Cannata

The University of British Columbia

Seminar: Presenter: Oracle Database Objects Internals. Oren Nakdimon.

Answer any Five Questions. All questions carry equal marks.

CPSC 310: Database Systems / CSPC 603: Database Systems and Applications Final Exam Fall 2005


Transcription:

Name :. Roll No. :..... Invigilator s Signature :.. CS/B.TECH(IT)/SEM-6/IT-604/2011 2011 DATABASE MANAGEMENT SYSTEM Time Allotted : 3 Hours Full Marks : 70 The figures in the margin indicate full marks. Candidates are required to give their answers in their own words as far as practicable. GROUP A ( Multiple Choice Type Questions ) 1. Choose the correct alternative for the following: 10 1 = 10 i) One of the shor comings of file system is ii) a) data availability b) fixed records c) sequential records d) lack of security. A trigger i a) a statement that enables to start any DBMS b) a statement that is executed by the user when debugging an application program c) a condition the system tests for the validity of the database user d) a statement that is executed automatically by the system of a modification. 6302 [ Turn over

iii) One difference between TRUNCATE and DELETE command is a) TRUNCATE deletes the table but DELETE only deletes records b) DELETE operation can be rolled back, but TRUNCATE operation cannot be rolled back c) TRUNCATE can be rolled back but DELETE cannot be rolled back d) TRUNCATE is a DML command but DELETE is a DDL command. iv) Which defining a numeric number field that can hold 3 digits before the decima point and 3 digits after the decimal points, the width wo ld be given as a) 6 b) 7 c) 8 d) 3. v) Advantage of locking algorithms in concurrent execution vi) of DB transaction is... a) deadlock b) concurrency c) consistency d) none of these. Consider the schema R = ( S, T, U, V ) and the dependencies S T, T U, U V and V S. Let R = (R1 and R2) be a decomposition such that R 1 R2 = θ. The decomposition is : a) Not in 2NF b) In 2NF but not in 3NF c) In 3NF but not in 2NF d) In both 2NF and 3NF. 6302 2

vii) EMPNO ENAME SAL A822 RAMASWAMY 3500 A812 NARAYAN 5000 A973 UMESH 2850 A500 BALAJI 5750 Use these data for the following questions. Select SAL from EMP E1 where 3 > ( Select c unt ( * ) from Emp E2 where E1 SAL > E2 SAL ) w ll r trieve a) 3500,5000,2500 b) 5000,2850 c) 2850,5750 d) 5000,5750. viii) The information about data in a database is called a) meta data b) tera data c) hyper data d) none of these. ix) R = { I, J, K, L } F = { I K, IL J, JK L, L K }, The candidate keys are a) J and K b) JK c) Only I d) JK and JL. x) Consider he primary key foreign key relationship between Employee and Department table via Dept ID column. If you try to delete a department in Department table which is referred in Employee table, Oracle by default does not allow this. This is known as ON DELETE... a) SET CASCADE b) SET DEFAULT c) RESTRICT d) SET NULL. 6302 3 [ Turn over

GROUP B ( Short Answer Type Questions ) Answer any three of the following. 3 5 = 15 2. a) What is the difference between a database and a table? b) Why are entity integrity and referential integrity important in a database? 2 + 3 3. a) What is lossless decomposition? b) Draw a functional dependency diagram (FD diagram) that is in 3NF but not in BCNF. Decompose that FD diagram into BCNF. 4. Design a Generalization-Specialization hierarchy for a motorvehicle sales company. The company sells motor-cycles, passenger cars, vans, buses. Justify your placement of attributes at each level of the hierarchy. Explain why they should not be placed at a higher or lower level. 5. What s the difference between Primary Index, Secondary Ind x and Clustering Index? 6. What are the recovery implications of : a) forcing buffers to the database at COMMIT? b) fever physically writing buffers to the database prior to 1 1 COMMIT? 2 + 2 2 2 6302 4

GROUP C ( Long Answer Type Questions ) Answer any three of the following. 3 15 = 45 7. a) Hotel ( Hotel No, Hotel Name, Address ) Room ( Room No, Hotel No, Type, Price_pn) Booking ( Hotel No, Guest No, Date From, Date To, Room No ) Guest ( Guest No. Guest Name, Guest Ad ress ) where the underlined column names are primary key. Write down expressions in relational algebra for the following queries : i) list all the hotels which are situated in Kolkata ii) list all single rooms with a charge below Rs. 1000 per night iii) list the names of all guest who are going to stay at ITC hotel from 25th December to 1st January. iv) list the price per night and type of all rooms at Grand Hotel. 6 b) What do you mean by composite attribute and derived ttribute? Give example. 2 c) Some of the entities relevant to a technical university are given below : i) STUDENT and ENGG-BRANCH (students register for engg branches) ii) BOOK and BOOK-COPY ( books have copies ) 6302 5 [ Turn over

iii) ENGG-BRANCH and SECTION (branches have section) iv) SECTION and CLASS-ROOM ( sections are scheduled in classrooms ) v) FACULTY and ENGG-BRANCH ( faculty teaches in a particular branch ) For each of them, indicate the type of relationship existing among them ( for example, one-to-one, one to-many or many-to-many ). Draw a relationship diagram for each of them. 5 d) An E-R diagram can be viewed as a graph. What do the following means in terms of the structure of an enterprise schema? i) The graph is disconnected ii) The graph is cycl c 2 8. a) Compute the closure of the following set F of functional dependencies for relational scheme. R = ( A B C, D, E ) A > BC, CD > E, B > D, E >A 3 b) Consider the relation R = { A, B, C, D, E, F, G, H, I, J } and the set of functional dependencies : F = { AB > C, A > DE, B > F, F > GH, D > IJ } Decompose R into 3NF. 5 c) What do you mean by lossless and dependency preserving decomposition? 4 d) What is MDV? Explain with an example. 3 6302 6

9. a) Consider relation R ( A, B, C ) and a set of functional dependencies F = { A > BC, B > C, A >B, AB >C } Compute the canonical cover for F. 6 b) Define BCNF. How does it differ from 3NF? Why is BCNF considered to be stronger than 3NF? 4 c) Draw a functional dependency diagram that is in 3NF but not in BCNF. Decompose that FD diagram into BCNF. 3 d) Explain candidate key with an example 2 10. a) State Two-phase Commit protoco and discuss the implications of a failure on the part of i) the coordinator ii) a participant, during each of the two phases. 4 b) Describe the wait-die and wound-wait protocols for deadlock prevention. 2 c) Define three concurrency problems : dirty read, nonrepeatable read, phantoms. 3 d) Let T T2 and T 3 be transactions that operate on the sam data items A, B and C. Let r 1 ( A ) mean that T 1 reads A, w 1 ( A ) means that T 1 writes A and so on for T 2 and T 3. Consider the following schedule Sl : r 2 (C), r2 (B), w2 (B), r3 (B), r3 (C), r1 (A), w1 (A), w3 (B), w C), r (A), r (B), w (B), (A) 3 ( 2 1 1 w2 Is the schedule serializable? 3 e) What are the roles of the Analysis, Redo and Undo phases in the recovery algorithm 'ARIES'. 3 6302 7 [ Turn over

11. a) State the difference between the following in brief : Primary Index versus Secondary Index. b) What is blocking factor? Explain the difference between B-tree and B+tree indexing with proper example. c) Explain deferred update technique for recovery with its advantages and disadvantages. d) What are the causes of bucket overflow in a hash file organization? e) Construct a B+ tree for the following set of key values : ( 2, 3, 5, 7, 11, 17, 19, 23, 29, 3 ) Assume that the tree is nitially empty and values are added in ascending order. Construct B+ -trees for the cases where the numbers of pointers that will fit in one node is as follows i) Four ii) iii) Six Eight 6302 8