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

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

2011 DATABASE MANAGEMENT SYSTEM

Multiple-Choice. 3. When you want to see all of the awards, even those not yet granted to a student, replace JOIN in the following

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

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

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

CIS 330: Applied Database Systems. ER to Relational Relational Algebra

VIEW OTHER QUESTION PAPERS

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

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

Note: Select one full question from each unit

1. Considering functional dependency, one in which removal from some attributes must affect dependency is called

COSC Dr. Ramon Lawrence. Emp Relation

COMP302. Database Systems

Er Diagram Exercises. Exercise1. Draw an ER diagram for the following application from the manufacturing industry.

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

PESIT Bangalore South Campus

Database Management Systems Paper Solution

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

DATABASE MANAGEMENT SYSTEMS

CSE 562 Database Systems

Revised Guidelines for B.A. Programme Semester II Paper: Database Management System (Meeting held on 15 th Jan 2015)

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

SQL STRUCTURED QUERY LANGUAGE

High-Level Database Models (ii)

Query Processing & Optimization. CS 377: Database Systems

BSc (Hons) Software Engineering. BSc (Hons) Computer Science with Network Security. Examinations for / Semester 2 & 2017 / Semester 1

Database Management Systems (Classroom Practice Booklet Solutions)

Birkbeck. (University of London) BSc/FD EXAMINATION. Department of Computer Science and Information Systems. Database Management (COIY028H6)

Babu Banarasi Das National Institute of Technology and Management

Database design process

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

Relational Model History. COSC 304 Introduction to Database Systems. Relational Model and Algebra. Relational Model Definitions.

High Level Database Models

Introduction to SQL. ECE 650 Systems Programming & Engineering Duke University, Spring 2018

COSC344 Database Theory and Applications. Lecture 5 SQL - Data Definition Language. COSC344 Lecture 5 1

COSC344 Database Theory and Applications. σ a= c (P) S. Lecture 4 Relational algebra. π A, P X Q. COSC344 Lecture 4 1

NOTE: DO NOT REMOVE THIS EXAM PAPER FROM THE EXAM VENUE

CS 338 Functional Dependencies

PES Institute of Technology Bangalore South Campus (1 K.M before Electronic City,Bangalore ) Department of MCA. Solution Set - Test-II

Er Diagram Exercises. Exercise1

P.G.D.C.M. (Semester I) Examination, : ELEMENTS OF INFORMATION TECHNOLOGY AND OFFICE AUTOMATION (2008 Pattern)

UNIVERSITY OF TORONTO MIDTERM TEST SUMMER 2017 CSC343H Introduction to Databases Instructor Tamanna Chhabra Duration 120 min No aids allowed

GUJARAT TECHNOLOGICAL UNIVERSITY

A taxonomy of SQL queries Learning Plan

4. Entity Relationship Model

DBMS LAB SESSION PAVANKUMAR MP

DATABASE CONCEPTS. Dr. Awad Khalil Computer Science & Engineering Department AUC

PESIT Bangalore South Campus

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

Total No. of Questions : 6] [Total No. of Printed Pages : 2 [3689]-101. P. G. D. C. M. (Semester - I) Examination

Database Design Theory and Normalization. CS 377: Database Systems

Overview Relational data model

CSE 444 Midterm Exam

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

Database Design Process

Chapter 7 Relational Database Design by ER- and EERR-to-Relational Mapping

More Relational Algebra

Where Are We? Next Few Lectures. Integrity Constraints Motivation. Constraints in E/R Diagrams. Keys in E/R Diagrams

Relational Data Structure and Concepts. Structured Query Language (Part 1) The Entity Integrity Rules. Relational Data Structure and Concepts

Database Systems. Answers

Slides by: Ms. Shree Jaswal

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

CSC 742 Database Management Systems

DATABASE DESIGN I - 1DL300

From ER to Relational Model. Book Chapter 3 (part 2 )

Entity Relationship Modelling

Database Applications (15-415)

ECE 650 Systems Programming & Engineering. Spring 2018

Solutions. Updated of 7

SILVER OAK COLLEGE OF ENGINEERING & TECHNOLOGY ADITYA SILVER OAK INSTITUTE OF TECHNOLOGY

Database Management

The Relational Model. Chapter 3. Comp 521 Files and Databases Fall

ECE 650 Systems Programming & Engineering. Spring 2018

Chapter 4. Basic SQL. SQL Data Definition and Data Types. Basic SQL. SQL language SQL. Terminology: CREATE statement

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

KINGDOM OF SAUDI ARABIA-JAZAN UNIVERSITY COLLEGE OF COMPUTER SCIENCE & INFORMATION SYSTEMS 221 INFS 3 DATABASE SYSTEMS-1 REVIEW QUESTIONS

Class Information. Textbooks. Grading. Final Project. Grading. CS 440: Database Management Systems. Instructor:

Review The Big Picture

BSc (Hons) in Computer Applications. Examinations for / Semester 1

Integrity constraints, relationships. CS634 Lecture 2

BACHELOR OF COMPUTER APPLICATIONS (BCA)

Guideline 1: Semantic of the relation attributes Do not mix attributes from distinct real world. example

CSE 444 Midterm Test

The Relational Model (ii)

Contact Hours / week: 4 Total hours: 64. Table of Contents Architecture 3 Data Modeling Using the Entity-

The DBMS accepts requests for data from the application program and instructs the operating system to transfer the appropriate data.

2. E/R Design Considerations

Name: Database Systems ( 資料庫系統 ) Midterm exam, November 15, 2006

CSE 444, Winter 2011, Midterm Examination 9 February 2011

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

Answer 2.3 The ER diagram is shown in Figure 2.1.

Relational Database Systems Part 01. Karine Reis Ferreira

Schema Refinement: Dependencies and Normal Forms

The University Of New South Wales. Final Exam November 2006 COMP9311. Database Systems

BSc (Hons) Computer Science with Network Security. Examinations for / Semester1

The Relational Model. Chapter 3. Comp 521 Files and Databases Fall

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

CS 2451 Database Systems: Database and Schema Design

CSE wi Final Exam Sample Solution

Transcription:

' This question paper contains 8 printed pages] Roll No. I I I I I I I I I I ( 1 S. No. of Question Paper : 6074 Unique Paper Code Name of the Paper Name of the Course Semester Duration : 3 Hours : 234305 : Database Systems (CSHT-307). : B.Sc. (H) Computer Science : III D Maximum Marks: 75 (Write your Roll No. on the top immediately on receipt of this question paper.) Section A is compulsory. Attempt all parts together. Attempt any four questions from section B. All questions in section B carry equal marks. Section A All parts are compulsory. 1. (a) Differentiate between the following: (i) Database and DBMS Specialization lattice and Specialization hierarchy. (iii) Entity type and Entity set (iv) Centralized and Distributed DBMS P.T.O.

( 2 ) 6074 (h) Explain the meaning of notation A+ in XML document. 2 (c) Consider a MUSICAL COMPANY database in which data is recorded about the music industry. The data requirements are as follows : (i) Each musician has an SSN, a name, an address and a phone number. Each instrument that is used in the songs has a name and a musical key. (iii) Each album that is recorded on the company label has a title, a copyright date, a format and an album identifier. (iv) Each song recorded at the company has a title and an author. ( v) Each musician may play several instruments and serveral musician may play a given instrument. (vi) Each album has a number of songs on it but no song may appear in more than one album. (vii) One or more musician perform each song and a musician may_perform in a number of songs. (viii) Each album has exactly one musician who acts as its producer. A musician niay produce several albums. - Design an ER diagram for the above specifications and indicate all keys and cardinality constraints. Also state any assumptions that are made. 8

( 3 ) 6074 (d) Give SQL commands to create the following tables with the given constraints. 5 DEPARTMENT Field Data-Type NULL Key Default Dno int No Primary Ntl Key Dname Varchar(20) Yes Ntl Dlocation V archar(25) Yes 'Chandigarh' EMPLOYEE Field Data-Type NULL Key Default UID Char(12) No PRIMARY.Ntl ename Varchar(25) no Ntl Hire-date date no Ntl Manager Char(12) yes Foreign Key Ntl Dno lnt Yes Foreign Key 10 salary Decimal( 10,2) No Ntl (e) Find the output of the following expressions by using the DIVISION operator in relational algebra on the tables A, B 1, B2, B3 as given : 2x3 (i) NBl P.T.O.

,------------------------------- -- ( 4 ) 6074 (if) - AIB2 (iii) A/83 S.No. Sl 81 81 Sl A= 82 82 83 84 84 P.No. Pl P3 P4 Pl P4. P.No. B3 = 1-P_J_-1 P4 (j) Consider a 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}. What is the key of R? Decompose R into 2NF and then 3NF relations. 2+4 Section B Attempt any four questions :.. 2. (a) Define the Entity Integrity and Referential Integrity constraints. Why are they considered important? 2+2

( 5 ) 6074 (b) Map the ER diagram given in Figure 1 to relational database. Cardinality constraints are given as follows : 6 (z) BANK and BANK-BRANCH (1 : N) BANK-BRANCH and ACCOUNT (1 : N) (iii) BANK-BRANCH and LOAN (1 : N) (iv) LOAN and CUSTOMER (M : N) (v) ACCOUNT and CUSTOMER (M : N) Figure 1 3. (a) Consider the ER diagram in Figure 2. Assume that an employee may work in up to two departments or may not be assigned o any department. Assume that each department P.T.O.

-- ~---~~~~~---_.) ( 6 ) 6074 must have one and may have up to three phone numbers. Supply (min, max) constraints on this diagram. State clearly any additional assumptions you make. 4 EMPLOYEE DEPARTMENT PHONE Figure 2 (h) Given below are two sets F and G of FDs for a relation R(A,B, C, D, E). Ate they equivalent? Justify your answer. F = {A ---; B,AB-; C,D ---; AC,D ---; E} 6 G = {A ---; BC,D ---; AE} 4. (a) Consider a database that consists of the following relations : SUPPLIER (Sno, Sname) PART (Pno, Pname) PROJECT (Jno, Jname) SUPPLY (Sno, Pno, Jno) Solve the following queries in SQL : (i) Retrieve the project names (Jname) to whom supplier Sl supplies part.

( 7 ) 6074 Retrieve the total no. of parts supplied by each supplier. (iii) Retrieve a list of project names. (b) Differentiate between shared subclass and category with example. 2+2 5. (a) Explain the lost update problem, the dirty read problem and the incorrect summary problem with examples. 2 x 3 (b) What are the three main types bf XML documents? Explain 3 (c) What do you mean by commit point of a transaction? 6. (a) Give one example each of the following : 1 6 (i) (iii) Recursive relationship Identifying relationship Total and disjoint specialization. (b) How is OUTER UNION operation different from UNION operation? Explain with example. 4 7. (a) Explain update anomalies in a relation due to bad design with the help of ari. example? Why do they occur? 4 (b) What will be the result ofthe following relational algebra queries on the relations Mand N given below : 1.5 x4 (I) M Join N where M.X z:: N.P M Right Outer Join N where M.Y = N.Q P.T.O.

----------~ - ( 8 ) 6074 (iii) M Full outer Join N where M.X = N.P AND M.Y = N.Q (iv) M Union N M X y z p Q R 5 3 6 5 10 6 10 7 9 10 7 12 5 2 7 15 2 7 N 6074 8 1,200