Bsc(Hons) Web Technologies. Examinations for / Semester 2

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

UNIVERSITY OF BOLTON CREATIVE TECHNOLOGIES COMPUTING PATHWAY SEMESTER TWO EXAMINATION 2014/2015 ADVANCED DATABASE SYSTEMS MODULE NO: CPU6007

1 (10) 2 (8) 3 (12) 4 (14) 5 (6) Total (50)

Distributed KIDS Labs 1

MaanavaN.Com DEPARTMENT OF COMPUTER SCIENCE & ENGINEERING QUESTION BANK

MCA (Revised) Term-End Examination December,

Specific Objectives Contents Teaching Hours 4 the basic concepts 1.1 Concepts of Relational Databases

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

VIEW OTHER QUESTION PAPERS

GUJARAT TECHNOLOGICAL UNIVERSITY

CMSC 461 Final Exam Study Guide

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

Database Management Systems

Course 40045A: Microsoft SQL Server for Oracle DBAs

Distributed Databases

A7-R3: INTRODUCTION TO DATABASE MANAGEMENT SYSTEMS

TRANSACTION PROCESSING PROPERTIES OF A TRANSACTION TRANSACTION PROCESSING PROPERTIES OF A TRANSACTION 4/3/2014

SRM UNIVERSITY FACULTY OF ENGINEERING AND TECHNOLOGY SCHOOL OF COMPUTING DEPARTMENT OF CSE COURSE PLAN

Distributed DBMS. Concepts. Concepts. Distributed DBMS. Concepts. Concepts 9/8/2014

CMP-3440 Database Systems

Babu Banarasi Das National Institute of Technology and Management

Textbook(s) and other required material: Raghu Ramakrishnan & Johannes Gehrke, Database Management Systems, Third edition, McGraw Hill, 2003.

In This Lecture. Transactions and Recovery. Transactions. Transactions. Isolation and Durability. Atomicity and Consistency. Transactions Recovery

Database Administration. Database Administration CSCU9Q5. The Data Dictionary. 31Q5/IT31 Database P&A November 7, Overview:

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

Introduction The SELECT statement: basics Nested queries Set operators Update commands Table management

Distributed Databases

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

NJIT Department of Computer Science PhD Qualifying Exam on CS 631: DATA MANAGEMENT SYSTEMS DESIGN. Summer 2012

CS Final Exam Review Suggestions

Data analysis and design Unit number: 23 Level: 5 Credit value: 15 Guided learning hours: 60 Unit reference number: H/601/1991.

Chapter 19: Distributed Databases

CSE 444, Winter 2011, Midterm Examination 9 February 2011

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

City University of Hong Kong Course Syllabus. offered by Department of Computer Science with effect from Semester A 2017/18

BSc (Hons) Web Technologies. Examinations for 2017 / Semester 1

Course Book Academic Year

The Relational Model. Relational Data Model Relational Query Language (DDL + DML) Integrity Constraints (IC)

02 Hr/week. Theory Marks. Internal assessment. Avg. of 2 Tests

Database. Università degli Studi di Roma Tor Vergata. ICT and Internet Engineering. Instructor: Andrea Giglio

Relation Databases. By- Neha Tyagi PGT CS KV 5 Jaipur II Shift Jaipur Region. Based on CBSE Curriculum Class -11. Neha Tyagi, PGT CS II Shift Jaipur

THE COPPERBELT UNIVERSITY

NEW YORK CITY COLLEGE OF TECHNOLOGY COMPUTER SYSTEMS TECHNOLOGY DEPARTMENT CST4714 DATABASE ADMINISTRATION (2 class hours, 2 lab hours, 3 credits)

GUJARAT TECHNOLOGICAL UNIVERSITY

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

CS2255 DATABASE MANAGEMENT SYSTEMS QUESTION BANK UNIT I

Course Description. Audience. Prerequisites. At Course Completion. : Course 40074A : Microsoft SQL Server 2014 for Oracle DBAs

DISTRIBUTED DATABASES CS561-SPRING 2012 WPI, MOHAMED ELTABAKH

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

Administration Naive DBMS CMPT 454 Topics. John Edgar 2

A Sample Solution to the Midterm Test

B.H.GARDI COLLEGE OF MASTER OF COMPUTER APPLICATION. Ch. 1 :- Introduction Database Management System - 1

VALLIAMMAI ENGINEERING COLLEGE

Chapter 19: Distributed Databases

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

CSE 444 Midterm Exam

CS5300 Database Systems

The Relational Model. Week 2

T ransaction Management 4/23/2018 1

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

BBM371- Data Management. Lecture 1: Course policies, Introduction to DBMS

The University of Nottingham

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

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

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

Fundamental Research of Distributed Database

In This Lecture. Exam revision. Main topics. Exam format. Particular topics. How to revise. Exam format Main topics How to revise

D.Hemavathi & R.Venkatalakshmi, Assistant Professor, SRM University, Kattankulathur

INSTITUTE OF AERONAUTICAL ENGINEERING (Autonomous) Dundigal, Hyderabad

BSc. (Hons) Web Technologies. Examinations for 2017 / Semester 1

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

CMPS 181, Database Systems II, Final Exam, Spring 2016 Instructor: Shel Finkelstein. Student ID: UCSC

CSCI 585 Database Systems Prof. Dennis McLeod. Sample Midterm Exam

Distributed Databases

Bsc (Hons) Software Engineering. Examinations for / Semester 1. Resit Examinations for BSE/15A/FT & BSE/16A/FT

Course Content. Parallel & Distributed Databases. Objectives of Lecture 12 Parallel and Distributed Databases

CMPT 354 Database Systems I. Spring 2012 Instructor: Hassan Khosravi

Module 15: Managing Transactions and Locks

Database Systems Relational Model. A.R. Hurson 323 CS Building

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

Two hours UNIVERSITY OF MANCHESTER SCHOOL OF COMPUTER SCIENCE. Date: Thursday 16th January 2014 Time: 09:45-11:45. Please answer BOTH Questions

FACULTY OF ENGINEERING B.E. 4/4 (CSE) II Semester (Old) Examination, June Subject : Information Retrieval Systems (Elective III) Estelar

UNIVERSITY REGULAR EXAMINATIONS 2013 /2014 ACADEMIC YEAR FOR THE DEGREE OF BACHELOR OF SCIENCE IN COMPUTER SCIENCE

Comp 5311 Database Management Systems. 4b. Structured Query Language 3

management systems Elena Baralis, Silvia Chiusano Politecnico di Torino Pag. 1 Distributed architectures Distributed Database Management Systems

Introduction C H A P T E R1. Exercises

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

Database Applications (15-415)

Databases. Jörg Endrullis. VU University Amsterdam

Review. The Relational Model. Glossary. Review. Data Models. Why Study the Relational Model? Why use a DBMS? OS provides RAM and disk

Vendor: CIW. Exam Code: 1D Exam Name: CIW v5 Database Design Specialist. Version: Demo

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

CSC 407 Database System I COURSE PARTICULARS COURSE INSTRUCTORS COURSE DESCRIPTION

BEng. (Hons) Telecommunications. Examinations for / Semester 2

SQL: Transactions. Announcements (October 2) Transactions. CPS 116 Introduction to Database Systems. Project milestone #1 due in 1½ weeks

Chapter 11 - Data Replication Middleware

School of Computing and Information Technology. Examination Paper Autumn 2016

PESIT Bangalore South Campus

Department of Computer Science Final Exam, CS 4411a Databases II

Database Management System. Fundamental Database Concepts

Transcription:

Bsc(Hons) Web Technologies Cohort: BWT/11/FT Examinations for 2012-2013 / Semester 2 MODULE: ADVANCED WEB DATABASE MANAGEMENT SYSTEM MODULE CODE: DBT2105 Duration: 2 ½ Hours Instructions to Candidates: 1. Answer ALL questions. 2. Questions may be answered in any order but your answers must show the question number clearly. 3. Always start a new question on a fresh page. 4. All questions carry equal marks. 5. Total marks 100. This question paper contains 5 questions and 6 pages. Page 1 of 6

QUESTION 1: (20 MARKS) One of the tasks a database management system must perform is to ensure that the data is still intact in the face of software and hardware failure. This task is known as recovery. (a) Describe the three basic steps involved in recovery. (b) Describe the three types of failure in a database system. Support your answer with appropriate example. (6 Marks) (c) Discuss how the log file (or journal) is a fundamental feature in any recovery mechanism. (d) Explain what is meant by forward and backward recovery and describe how the log file is used in forward and backward recovery? (e) What is the significance of the write-ahead log protocol? (f) How do checkpoints affect the recovery protocol? (4 Marks) Page 2 of 6

QUESTION 2: (20 MARKS) A distributed database is defined as a collection of multiple logically interrelated database which are physically distributed over a computer network (a) Give any three advantages of implementing a distributed database system. (b) Provide any three difficulties that database designer has to face when implementing a distributed database system. (c) The components of a Distributed Database include the following: Network Processor, Remote data processor, Data dictionary, and local data processor. Explain the function of each of the above components. (4 Marks) (d) Differentiate between a Homogeneous Distributed Database and a (e) Heterogeneous Distributed Database. Briefly discuss why data fragmentation could be useful in such distributed database systems, and explain each of the following fragmentation rules: Completeness Reconstruction Disjointness (8 Marks) Page 3 of 6

QUESTION 3: (20 MARKS) Consider the following database relations: STUDENT (S#, SNAME, YEAR-OF-ENTRY, ADDRESS, PHONE) COURSE (C#, COURSETITLE, LEVEL, LECTURER) GRADE(S#, C#, COURSEWORK, EXAM, OVERALL) and the following query SELECT STUDENT.SNAME, OVERALL FROM STUDENT, GRADE WHERE GRADE.S# = STUDENT.S# AND GRADE.C# = QC303 AND GRADE.OVERALL > 9 Assuming that: i.) The STUDENT relation contains 2000 records; ii.) The GRADE relation contains 1000 records. Among them only 150 are for the course QC303 which is the C#, and of which 100 with OVERALL grade above 9; iii.) It is possible to hold up to 150 records in the main memory. Answer the following questions: (a) Choose two possible methods to evaluate the above query. Show all the steps in the evaluation and calculate the number of tuple input/output operations required for each step. (12 Marks) (b) Having considered a specific query as above, discuss now how query optimization is generally implemented in a relational database system. Your discussion should focus on describing various stages involved in an optimization process. (8 Marks) Page 4 of 6

QUESTION 4: (20 MARKS) (a) Differentiate between database security and database integrity (b) Database security involves measures to avoid loss of privacy and loss of confidentiality. Explain what is meant by the above terms. (4 Marks) (c) In the context of database security explain how the following database features help to enforce security in the database system: (i) Authorisation (ii) Access Control (iii) Views (d) Differentiate between a Discretionary Access Control and a Mandatory Access Control. Which one is more rigid to the modification of the privilege assigned to users? (5 Marks) (e) Assuming that the following view exist in your database schema: CREATE VIEW View1 AS SELECT S_id, S_name, Status, City FROM Suppliers WHERE City = Paris Write an appropriate SQL Code to give access right to two users Mark and Spencer so that they can Insert, Update, Delete and Retrieve all the data in the above view. Put a control so that both Mark and Spencer can only update the supplier name and the status of the suppliers. Page 5 of 6

QUESTION 5: (20 MARKS) (a) (b) In the context of concurrency control for a multi-transaction database system, briefly discuss the concept of lock and deadlock, and their relationship. (5 Marks) Consider the following two interleaved transactions A and B which might occur in a database system for a bank. Mr Smith s bank account, with an initial balance of $1000, is being updated simultaneously by two transactions A and B in the order shown below: 1. Transaction A retrieves the account balance 2. Transaction A transfer out $300 from the account and updates the account balance. 3. Transaction B retrieves the account balance. 4. Transaction B transfer $200 into the account 5. Transaction A executes a rollback. 6. Transaction B commits the transaction. Answer the following questions (i) Show the step-by-step changes to the account balance and the final balance of the account, if transaction A and B were performed according to the sequence shown above. (ii) Show the step-by-step changes to the account balance and the final balance of the account, if transactions A and B were performed in a serial sequence (i.e., Transaction A completes all its operations before Transaction B starts). (iii) Identify the type of concurrency problem occurred in the transaction sequence used for (i) above, and explain how the problem arises. (iv) Provide a step-by-step solution using locking to show how the two transactions would be executed, if appropriate concurrency control were applied to the system. (7 Marks) ***END OF QUESTION PAPER*** Page 6 of 6