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

Similar documents
2011 DATABASE MANAGEMENT SYSTEM

A7-R3: INTRODUCTION TO DATABASE MANAGEMENT SYSTEMS

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

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

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


Sample Question Paper

DATABASE MANAGEMENT SYSTEMS

Database Management Systems Paper Solution

INSTITUTE OF AERONAUTICAL ENGINEERING (Autonomous) Dundigal, Hyderabad

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

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

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

SYED AMMAL ENGINEERING COLLEGE

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

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

Babu Banarasi Das National Institute of Technology and Management

VIEW OTHER QUESTION PAPERS

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

Unit 3 : Relational Database Design

A subquery is a nested query inserted inside a large query Generally occurs with select, from, where Also known as inner query or inner select,

Solved MCQ on fundamental of DBMS. Set-1

Database Management Systems (CS 601) Assignments

The University of British Columbia Computer Science 304 Practice Final Examination

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

CS2255 DATABASE MANAGEMENT SYSTEMS QUESTION BANK UNIT I

CS 461: Database Systems. Final Review. Julia Stoyanovich

Name :. Roll No. :... Invigilator s Signature : INTRODUCTION TO PROGRAMMING. Time Allotted : 3 Hours Full Marks : 70

King Fahd University of Petroleum and Minerals

Chapter 8: Relational Database Design

Database Management

DATABASE MANAGEMENT SYSTEM

MaanavaN.Com DEPARTMENT OF COMPUTER SCIENCE & ENGINEERING QUESTION BANK

Assignment Session : July-March

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

UNIVERSITY OF BOLTON WESTERN INTERNATIONAL COLLEGE FZE BSC (HONS) COMPUTING SEMESTER ONE EXAMINATION 2015/2016 DATABASE THEORY AND PRACTICE

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

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

Chapter 7: Relational Database Design

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

CMSC 461 Final Exam Study Guide

VALLIAMMAI ENGINEERING COLLEGE

Final Review. Zaki Malik November 20, 2008

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

Relational Design: Characteristics of Well-designed DB

PESIT Bangalore South Campus

Elmasri/Navathe, Fundamentals of Database Systems, Fourth Edition Chapter 10-2


Chapter 10. Chapter Outline. Chapter Outline. Functional Dependencies and Normalization for Relational Databases

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

Schema Normalization. 30 th August Submitted By: Saurabh Singla Rahul Bhatnagar

Functional dependency theory

Normalization is based on the concept of functional dependency. A functional dependency is a type of relationship between attributes.

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

II B.Sc(IT) [ BATCH] IV SEMESTER CORE: RELATIONAL DATABASE MANAGEMENT SYSTEM - 412A Multiple Choice Questions.

UNIT 3 DATABASE DESIGN

GUJARAT TECHNOLOGICAL UNIVERSITY

The University of Nottingham

Database Management Systems

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

Schema Refinement: Dependencies and Normal Forms

CSE 544 Principles of Database Management Systems. Magdalena Balazinska Winter 2009 Lecture 4 - Schema Normalization

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

COMP7640 Assignment 2

Functional Dependencies and. Databases. 1 Informal Design Guidelines for Relational Databases. 4 General Normal Form Definitions (For Multiple Keys)

INSTITUTE OF AERONAUTICAL ENGINEERING (Autonomous) Dundigal, Hyderabad

Midterm Exam (Version B) CS 122A Spring 2017

Database Design Theory and Normalization. CS 377: Database Systems

FUNCTIONAL DEPENDENCIES

Fundamentals of Database Systems

Schema Refinement: Dependencies and Normal Forms

Chapter 14. Database Design Theory: Introduction to Normalization Using Functional and Multivalued Dependencies

Functional Dependencies

Relational Database Design. Announcements. Database (schema) design. CPS 216 Advanced Database Systems. DB2 accounts have been set up

Schema Refinement: Dependencies and Normal Forms

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

Normalization. VI. Normalization of Database Tables. Need for Normalization. Normalization Process. Review of Functional Dependence Concepts

Database Systems CSE Comprehensive Exam Spring 2005

CPS 510 Data Base I. There are 3 forms of database descriptions the ANSI/SPARK, 1975 and so on

V. Database Design CS448/ How to obtain a good relational database schema

CS411 Database Systems. 05: Relational Schema Design Ch , except and

SYED AMMAL ENGINEERING COLLEGE

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

Functional Dependencies CS 1270

Informal Design Guidelines for Relational Databases

CSE 544 Principles of Database Management Systems. Magdalena Balazinska Fall 2009 Lecture 3 - Schema Normalization

BACHELOR OF COMPUTER APPLICATIONS (BCA)

UNIVERSITY OF CALIFORNIA College of Engineering Department of EECS, Computer Science Division

Total No. of Questions :09] [Total No. of Pages : 02

S.Y.B.Sc. (CS) PAPER - III, Section - I Data Base Management Systems

PPSC Competitive Exam for the Post of System Analyst

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

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

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

Midterm Exam #2 (Version A) CS 122A Winter 2017

Examination examples

CPS510 Database System Design Primitive SYSTEM STRUCTURE

FINAL EXAM REVIEW. CS121: Introduction to Relational Database Systems Fall 2018 Lecture 27

MCA (Revised) Term-End Examination June, 2013 MCS-023 : DATABASE MANAGEMENT SYSTEMS. Time : 3 hours Maximum Marks : 100 (VVeightage 75%)

Database Design Principles

Transcription:

Name :. Roll No. :..... Invigilator s Signature :.. CS/B.TECH(IT)/SEM-6/IT-604/2012 2012 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 alternatives for any ten of the following : i) A table can have only one a) Primary key b) Candidate key c) Sup key d) all of these. 10 1 = 10 ii) What is the smallest unit of data in a relational model? a) Data type b) Field c) Data value d) None of these. iii) 2 NF is always in a) INF b) BCNF c) MUD d) None of these. 6302 [ Turn over

iv) Select operation in SQL is a a) data query language b) data definition language c) DML d) DCL. v) In ER model symbol is used for vi) a) attribute b) entity c) relation d) none of these. BCNF is a type of a) Indexing b) DFD c) Normalization d) none of these. vii) What is the cardinality of a table with 1000 rows and 10 columns? a) 10 b) 100 c) 1000 d) None of these. viii) Which operator performs pattern matching in SQL? a) Except b) Intersect c) Like d) All of these. ix) An index on the search key is called a a) primary index b) secondary index c) multilevel index d) all of these. 6302 2

x) Which phase is not part of a two phase locking protocol? a) Growing phase b) Shrinking phase c) Stabilization phase d) None of these. xi) The data dictionary tells the DBMS, a) What files are in the database b) What attributes are possessed by da a c) What these files contain d) All of these. xii) Fore DMC commands are a) Create, update, delete, select b) Insert, upda e, drop, select c) Create, alter, delete, select d) Ins rt, modify, delete, select. xiii) Which is n t an ACID property? a) Atomicity b) Integrity c) Consistency d) Durability. GROUP B ( Short Answer Type Questions ) Answer any three of the following. 3 5 = 15 2. Explain DDL, DML & DCL. 6302 3 [ Turn over

3. Consider the following Sailor and Reserve relation : Reserve (sid, bid, day) Sailor (sid, sname, rating, age) Formulate relational algebra Query : a) Find names of sailors who have reserved boat # XXX. b) Find names and ages of sailors who have r served a boat. 2 2 1 + 2 2 1 4. Explain two phase locking protocol. 5. Define BCNF. How does it differ f om 3NF? Why is it considered stronger than 3 NF? 6. Discuss the entity integrity and referential integrity constraint. Why is it consid red important? Explain with suitable example. GROUP C ( Long Answer Type Questions ) Answer any three of the following. 3 15 = 45 7. a) Find out the closure of attribute set (AG) i.e. (AG) + in the R. Set of FD s F are as given below : R = { A, B, C, G, H, I } F = { A B, A C, CG H, CG I, B H } is (AG) is a super key of R? 6302 4

b) What are the differences between Embedded SQL and Dynamic SQL? c) Define super key, candidate key and primary key. d) Compare between 3NF and BCNF with example. 5 + 2 + 3 + 5 8. a) Consider the following relation and write question in SQL : w) Flights (flow, from, to, distance, departs, arrives, price) x) Aircraft (Aid, aname, cruising ange). y) Certified (eid, aid). z) Employees (eid, enam salary) i) Identify the flights that can be piloted by every pilot wh s sal ry is more than $ 1,00,000. ii) Find the eids of employees who make the second highest salary. iii) Find the names of pilots who can aperate lanes with a range greater than 3000 mintes but are not certified on any Boeing aircraft. iv) Print the names and salary of every non-pilot whose salary is more than average salary for pilots. b) Specify the query in SQL to declare a Cursor to find names & cities of residence of customers who have both an account and a loan at a particular bank branch in the same city as that customer. 6302 5 [ Turn over

c) The sales man-master table records the salesman-no, name, rate-of-commission, qtd-sales. The commissionamount and date-of-payment along with the salesmanno is calculated and recorded in commission-payable table. Write a PL/SQL block of code such that depending upon the user entered salesman-no, the Commissi n-amount is calculated and inserted into the commission-payable table. 4 + 5 + 6 9. a) What are dense and sparse indexing? Explain with an example. b) Create a B + tree with the p owing key : order-3, key = 8, 5, 1 7, 3 12, 9, 6. c) What is a view? 6 + 7 + 2 10. a) What is multip e inheritance? b) What is attribut inheritance? c) Draw ER diagram showing cardinality : A bill is s nt to a customer. A customer may receive many bills. A clerk works in a bank. A bank has many clerks. Students appear for seats in a college. Each student can get almost one seat. A college has many seats. A student can sent many applications. d) With an example describe specialization and generalisation. 2 + 2 + 4 + 2 + 2 + 3 6302 6

11. a) Consider the relation R (A, B, C, D, E) with the set of FD s. F = {A C, B C, C D, DC C, CE A }. Suppose the relation has been decomposed by relations R 1 (A, D), R 2 (A, B), R 3 (B, E), R 4 (C, D, E), R 5 (A, E). Is this decomposition lossy or lossless? Justify your answer. 3 b) Use the definition of FD to argue that each of Armstrong Axiom namely reflexivity, augmentation, pseudo transitivity, union & decomposition are sound. 5 c) What is a trigger? How many types of trigger are there? 3 + 4 6302 7 [ Turn over