Dr Gordon Russell, Napier University M/C Walkthrough - V2.0 1 Multi-Choice Walkthrough.

Slides:



Advertisements
Similar presentations
ER Tutorial 1 Chapter 9 - Questions 1 and 2 V3.0
Advertisements

Chapter 7 Indexing Structures for Files Copyright © 2004 Ramez Elmasri and Shamkant Navathe.
Transactions Chapter 6.1 V3.1 Napier University Dr Gordon Russell.
TRANSACTION PROCESSING SYSTEM ROHIT KHOKHER. TRANSACTION RECOVERY TRANSACTION RECOVERY TRANSACTION STATES SERIALIZABILITY CONFLICT SERIALIZABILITY VIEW.
Database Management System MIS 520 – Database Theory Fall 2001 (Day) Lecture 13.
Data and Database Administration Chapter 12. Outline What is Concurrency Control? Background Serializability  Locking mechanisms.
Fundamentals, Design, and Implementation, 9/e COS 346 Day 8.
Database Systems: Design, Implementation, and Management Eighth Edition Chapter 10 Transaction Management and Concurrency Control.
Transaction Processing IS698 Min Song. 2 What is a Transaction?  When an event in the real world changes the state of the enterprise, a transaction is.
Physical Database Monitoring and Tuning the Operational System.
Chapter 8 : Transaction Management. u Function and importance of transactions. u Properties of transactions. u Concurrency Control – Meaning of serializability.
Concepts of Database Management Seventh Edition
Chapter 3: Data Modeling
CHAPTER 2: MODELING DATA IN THE ORGANIZATION © 2013 Pearson Education, Inc. Publishing as Prentice Hall 1 Modern Database Management 11 th Edition Jeffrey.
System Analysis and Design
Functions of a Database Management System. Functions of a DBMS C.J. Date n Indexing n Views n Security n Integrity n Concurrency n Backup/Recovery n Design.
Database Systems: Design, Implementation, and Management Eighth Edition Chapter 10 Transaction Management and Concurrency Control.
Transaction Management WXES 2103 Database. Content What is transaction Transaction properties Transaction management with SQL Transaction log DBMS Transaction.
Relational Databases What is a relational database? What would we use one for? What do they look like? How can we describe them? How can you create one?
Database Design & ER Diagrams
Michael F. Price College of Business Chapter 6: Logical database design and the relational model.
Copyright 2002 Prentice-Hall, Inc. Modern Systems Analysis and Design Third Edition Jeffrey A. Hoffer Joey F. George Joseph S. Valacich Chapter 10 Structuring.
Software Development Unit 2 Databases What is a database? A collection of data organised in a manner that allows access, retrieval and use of that data.
DATABASE MANAGEMENT SYSTEM ARCHITECTURE
Computer System Analysis Chapter 10 Structuring System Requirements: Conceptual Data Modeling Dr. Sana’a Wafa Al-Sayegh 1 st quadmaster University of Palestine.
2.3 Organising Data for Effective Retrieval
1 Chapter 12 File Management Systems. 2 Systems Architecture Chapter 12.
Database Technical Session By: Prof. Adarsh Patel.
Q1: What is DBMS and explain its architecture. Q2: Explain Data Independence in detail. Q3: What is database user and explain the types of database user.
Concepts and Terminology Introduction to Database.
Database Management System Module 5 DeSiaMorewww.desiamore.com/ifm1.
Data and its manifestations. Storage and Retrieval techniques.
BIS Database Systems School of Management, Business Information Systems, Assumption University A.Thanop Somprasong Chapter # 10 Transaction Management.
I Information Systems Technology Ross Malaga 4 "Part I Understanding Information Systems Technology" Copyright © 2005 Prentice Hall, Inc. 4-1 DATABASE.
Dr Gordon Russell, Napier University Unit Concurrency 1 Transactions Unit 4.1.
DBMS Implementation Chapter 6.4 V3.0 Napier University Dr Gordon Russell.
Recovery Chapter 6.3 V3.1 Napier University Dr Gordon Russell.
Concepts of Database Management Sixth Edition Chapter 6 Database Design 2: Design Method.
Copyright © 2007 Pearson Education, Inc. Publishing as Pearson Addison-Wesley Slide Index Index field = one of the columns/attributes in a table.
Concurrency Control in Database Operating Systems.
DataBase Management System What is DBMS Purpose of DBMS Data Abstraction Data Definition Language Data Manipulation Language Data Models Data Keys Relationships.
System Design System Design - Mr. Ahmad Al-Ghoul System Analysis and Design.
Chapter 9 Database Systems Introduction to CS 1 st Semester, 2014 Sanghyun Park.
3 & 4 1 Chapters 3 and 4 Drawing ERDs October 16, 2006 Week 3.
Copyright 2006 Prentice-Hall, Inc. Essentials of Systems Analysis and Design Third Edition Joseph S. Valacich Joey F. George Jeffrey A. Hoffer Chapter.
3 & 4 1 Database Systems: Design, Implementation, & Management, 7 th Edition, Rob & Coronel Keys Consists of one or more attributes that determine other.
+ Information Systems and Databases 2.2 Organisation.
DATABASE MANAGEMENT SYSTEM ARCHITECTURE
Programming Logic and Design Fourth Edition, Comprehensive Chapter 16 Using Relational Databases.
 2004 Prentice Hall Business Publishing, Accounting Information Systems, 9/e, by Bodnar/Hopwood 13 – 1 Chapter 13 Auditing Information Technology.
Concurrency Chapter 6.2 V3.1 Napier University Dr Gordon Russell.
15.1 Transaction Concept A transaction is a unit of program execution that accesses and possibly updates various data items. E.g. transaction to transfer.
©Silberschatz, Korth and Sudarshan14.1Database System Concepts - 6 th Edition Chapter 14: Transactions Transaction Concept Transaction State Concurrent.
Chapter 5 : Integrity And Security  Domain Constraints  Referential Integrity  Security  Triggers  Authorization  Authorization in SQL  Views 
Copyright © 2009 Pearson Education, Inc. Publishing as Prentice Hall Chapter 9 Designing Databases 9.1.
©2003 Prentice Hall Business Publishing, Accounting Information Systems, 9/e, Romney/Steinbart 4-1 Relational Databases.
© 2009 Pearson Education, Inc. Publishing as Prentice Hall 1 Chapter 5 (Part a): Logical Database Design and the Relational Model Modern Database Management.
Chapter 3: Relational Databases
Copyright 2002 Prentice-Hall, Inc. Modern Systems Analysis and Design Third Edition Jeffrey A. Hoffer Joey F. George Joseph S. Valacich Chapter 10 Structuring.
SQL Basics Review Reviewing what we’ve learned so far…….
NORMALISATION OF DATABASES. WHAT IS NORMALISATION? Normalisation is used because Databases need to avoid have redundant data, which makes it inefficient.
Dr Gordon Russell, Napier University Normalisation 1 - V2.0 1 Normalisation 1 Unit 3.1.
Basic Concepts in Data Management
Chapter 4.1 V3.0 Napier University Dr Gordon Russell
Chapter 10 Transaction Management and Concurrency Control
18.3 Test Questions By Donavon M. Norwood 03/04/2009.
Concurrency Unit 4.2 Dr Gordon Russell, Napier University
Concurrency Unit 4.2 Dr Gordon Russell, Napier University
Recovery Unit 4.4 Dr Gordon Russell, Napier University
Normalisation 1 Unit 3.1 Dr Gordon Russell, Napier University
Presentation transcript:

Dr Gordon Russell, Napier University M/C Walkthrough - V2.0 1 Multi-Choice Walkthrough

Dr Gordon Russell, Napier University M/C Walkthrough - V2.02 Q1 A publishing company produces academic books on various subjects. Books are written by authors who specialise in one or more particular subject. The company employs a number of editors who do not have particular specialisations but who take sole responsibilty for for editing one or more publications. A publication covers a single subject area but may be written by one or more author - the contribution of each author is recorded as a percentage for the purposes of calculating royalties. A publishing company produces academic books on various subjects. Books are written by authors who specialise in one or more particular subject. The company employs a number of editors who do not have particular specialisations but who take sole responsibilty for for editing one or more publications. A publication covers a single subject area but may be written by one or more author - the contribution of each author is recorded as a percentage for the purposes of calculating royalties.

Dr Gordon Russell, Napier University M/C Walkthrough - V2.03 Q1 Continued The following ER diagram is intended to represent the above specification: The following ER diagram is intended to represent the above specification:

Dr Gordon Russell, Napier University M/C Walkthrough - V2.04 Q1 Options Indicate the relation which has an incorrect cardinality shown: A. specialises in A. specialises in B. makes B. makes C. is about C. is about D. to D. to E. None of the above E. None of the above

Dr Gordon Russell, Napier University M/C Walkthrough - V2.05 Q2 The specification is to be changed so that an author can develop a publication covering more than one subject area and that the schema must be able to store the percentage of the compents concerned with each of the subjects. Select an appropriate change to the ER diagram: The specification is to be changed so that an author can develop a publication covering more than one subject area and that the schema must be able to store the percentage of the compents concerned with each of the subjects. Select an appropriate change to the ER diagram: A. publication-subject becomes many to many A. publication-subject becomes many to many B. author-subject becomes many to many B. author-subject becomes many to many C. author-publication becomes many to many C. author-publication becomes many to many D. more than one of the above D. more than one of the above E. none of the above E. none of the above

Dr Gordon Russell, Napier University M/C Walkthrough - V2.06 Q3 Consider the relational schema R(A,B,C,D,E) with non-key functional dependencies C,D - E and B - C. Consider the relational schema R(A,B,C,D,E) with non-key functional dependencies C,D - E and B - C. Select the strongest statement that can be made about the schema R Select the strongest statement that can be made about the schema R A. R is in first normal form A. R is in first normal form B. R is in second normal form B. R is in second normal form C. R is in third normal form C. R is in third normal form D. R is in BCNF normal form D. R is in BCNF normal form E. None of the above E. None of the above

Dr Gordon Russell, Napier University M/C Walkthrough - V2.07 Q4 Locking was introduced into databases so that Locking was introduced into databases so that A. Keys can be provided to maintain security. A. Keys can be provided to maintain security. B. Reading and writing is possible. B. Reading and writing is possible. C. All simultaneous transactions are prevented. C. All simultaneous transactions are prevented. D. Passwords can be provided to maintain security D. Passwords can be provided to maintain security E. Consistency can be enforced. E. Consistency can be enforced.

Dr Gordon Russell, Napier University M/C Walkthrough - V2.08 Q5 When accessing a disk block, the seek time When accessing a disk block, the seek time A. is insignificant in comparison to transfer times A. is insignificant in comparison to transfer times B. is about the same as transfer times B. is about the same as transfer times C. greatly exceeds transfer times C. greatly exceeds transfer times D. is the time taken to search for data in a sorted list of database rows D. is the time taken to search for data in a sorted list of database rows E. is measured in nanoseconds E. is measured in nanoseconds

Dr Gordon Russell, Napier University M/C Walkthrough - V2.09 Q6 Hash-table insertions Hash-table insertions A. avoid hash-collisions by manipulating the foreign keys A. avoid hash-collisions by manipulating the foreign keys B. might use hash-chains to allow hash-collisions B. might use hash-chains to allow hash-collisions C. use balanced binary trees to allow hash-collisions C. use balanced binary trees to allow hash-collisions D. use primary keys to avoid hash-collisions D. use primary keys to avoid hash-collisions E. become unusable if there are any hash-collisions E. become unusable if there are any hash-collisions

Dr Gordon Russell, Napier University M/C Walkthrough - V2.010 Q7 When a transaction aborts When a transaction aborts A. all users must be notified A. all users must be notified B. all changes it has made are immediately available to other transactions B. all changes it has made are immediately available to other transactions C. the modifications of all transactions currently running are also aborted C. the modifications of all transactions currently running are also aborted D. it can abort transactions which have already committed D. it can abort transactions which have already committed E. it releases all of its locks E. it releases all of its locks