0% found this document useful (0 votes)
24 views24 pages

Ans Sheet DB

Uploaded by

Mohamed Maged
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF or read online on Scribd
0% found this document useful (0 votes)
24 views24 pages

Ans Sheet DB

Uploaded by

Mohamed Maged
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF or read online on Scribd
You are on page 1/ 24
Chapter 1 Data Bases and Data Base Users Multiple-Choice Questions: IA is a collection of related data. a) datdbase b) data store c) data system 4) data application 2) is a collection of 1s that enables users to create and maintain a database. a) RTS b) DBMS o) IS dAl 3) is a subset of database. a) portion b) scene ©) vie 4) part 4) allows program-data independence and program-operation independence. a) data redundancy —_) data definition c) data definition d) data abstraction SA is an executing program or process that includes one or more database access. sion b) object ©) procedure 4) application 6) software ensures that several users trying to update the same data can do in controlled manner. a a) access control b) concurrency conser c) redundancy control d) view control 7) Storing same data in many places is called . a) iteration b) redundaney_— ) concurrency 4) enumeration HE Constantly crying and updating the database using standard types of queries and ups is called a) dynamic rs inactive d) active 9 determines thé Fequirements|of end-users and develop specifications for those requirements. a) database administrators) application programmers 2) artem sop ¢) auditors 10) ble forGuthorizing acces the data base. res 2) doabase sna ) application programmers c) system analyst d) auditors Scanned with CamScanner TRUE or FALSE: 1. The database and DBMS software together is called (database seq, @ F) 2. DBMS cannot protect hardware and software malfunction TH) 3 Database{imanipulation}involves querying and updating the database. @) access the database{Goncurrety @F) system can be changed with time. Or ) 4. Multiple users and programs c 5. A databi 6. A software engineer cannot be a system analyst. ( TO 1€asual)end-users do canned transactions. = OX (T O — A 1. What are the various functions of DBMS? Ans. Defining, constructing, manipulating, sharing, protecting, maintaining a database, What are the main characteristics of a database? Ans. — Self-describing nature, <— ys5 insulation between programs and data, data abstraction, rt of multiple views, <~ sharing of datas multiuser transactior ssit ous = 3. List the people associated with the database. — Ans. Database Administrators (DBA), Database Designers, End-users, System Analyst, Application Programmers . What are ‘Ans. Control redundancy, restrict unauthorized access; backup and recovery, storage structures for efficient query processing, provide persistent storage for program objects; — enforce integrity constraints. Scanned with CamScanner Chapter 2 Data Base System Concepts and Architecture Multiple-Choice Questions: 1) Many airline reservation and telephone directory systems that support large number of yicurrent transactions ‘itil dap are categorized a3_—_ _/OOLTP b)RTS oAl 4) OFTP yor 2 stores information about schemes, constraints, design decisions, usage standards and user information. a) data bank pository ©) depository 4) tables 3) is the ability to change the schema at one level of a database system without having to hange the schema at next higher level. a)data exchange _b) data dependence cY@ata independence _—_d) data binding data independence changes the(Concepiwal Scheme without changing the external scheme. ¢) b) internal c) low-level 5) To change the constraints the scheme needs to be changed. mceptual b) physical c) logical d) low-level 6) To change the physical file structure the scheme needs to be changed a) conceptual b) physical ©) logical 4d) low-level nD) language is used to define both the internal and conceptual scheme when there is no separation between these schemes. a) VDL b) SDL ©) DDI 4)DML 8) Iangunge i sed wo specify the itera] scheme a) VDL ¢) DDI 4d) DML *~— ~ SL at 9) language is used to specify the(User Views and their mappings to conceptual schema. a) VDL ©) DDL ) DML. Ue 10) lanesae is sev do mention, deletion reteval, rd roction of date a) VDL b) SDL ©)DI PabML 11) A high-level DML used in stand-alone interactive manner is called language. a) query — 'b) machine c) assembly 4) natural 12) The description of schema constructs and constraints is called _\J lin a) dynamic b) beta ©) ue 13) The description of a database is called same , a)schema—_b) suture ©) construct, 4) implementation 14) Each object in the schemevof a database is called a) method b) structure c) consti d) module Co LL VV oO Scanned with CamScanner 15) A state that satisfies the structure and constraints of a scheme is called state. a) invalid b) true ¢) real d) valid 16) The database state is called schema, a) intension b) extension ) expansion 4) definition 17) A standard Open Database Connectivity (ODBC) provides an interface calle a) GUI b) CLI c) OOI Al TRUE or FALS! We 1. Powerbui ‘acai ctpeaion development environment. otal The conceptual scheme of a database cannot be changed once it is defined. Pv » . SQL is a Data Definition Language only s A query language specifies which data to retrieve rather than how to retrieve it. 7 (IF) 5. The DML commands can be embedded in a general-purpose programming language: @ F) 6. Data se scheme is specified during database design. also called set-oriented pan 8, High-level DML can specify and retrieve many records in single DML statement, 7. Low-level DMI 9. Database scheme changes very frequently. (/—~ 10. The database state is also called an instance of daabasey 11, Only one database state can be constructed from a particular database schema | 12. Schema diagram does not show the data types of each data item. a @ Match the following: DL | Manipulates the data base 4 2.5I Specifies user views and their mappings 3 3. VDL _\ Specifies internal schema 2 4, DML Specifies conceptual and internal schema both or conceptual schema only | 1 Scanned with CamScanner —S T. Relational data model | Represents database as collection of tables 1 [2 Network model Standard for data interchange over Internet 4 3 Hierarchical model 7 | Represents data as tre structures 3 4. XML model Represents data as record types 2 PS jew level Describes the part of database for a particular user group 3 2. Conceptual level _<| Describes the structure of whole database for community of users | 2 3. Internal level Describes the part of database for a particular user group 1 SS Short Answer Questions: 1, ‘What are the criteria of ea ‘Ans. Data model, number of users supported by system, number of sites the database is distributed, of DBMS cost of DBMS 2, What are the various database languages? ‘Ans. Data definition language (DDL), Storage definition language (SDL View definition language (VDL), Data Manipulation language (MD ifying DBMS? 3, What are the categories of Data models? Ans. High-level or conceptual Data model, Low-level or physical Data model, Implementation Data model Repeat ind 4. What are the three levels of three-tier architecture? . ‘Ans. _ Intemal schema, Conceptual schema, Extemal schetia \y\@M! Scanned with CamScanner Chapter 3 Data Modeling Using the Entity-Relationship Modeling Multiple-Choice Questions: » is an object modeling methodology. a) EML IML ©) OML 4) DML 2) diagrams are important part of object modeling methodology. a) application by data e) class d) level 3) During the design phase of database design, the properties of data is given importance, rather than its storage details. a) conceptual ) logical ) physical d) actual 4 is the basic object of ER mode(which thing prea! word. > a) relation b) domain ‘e) attribute atiy_— 5) Entities are described by properties called as a) attributes by characteristics c) features 4) relations ue 6) Atibts tat art dvi called 8) composite By © complex 4) structured D attributes can have more than one value. a) composite b) simple ) multi-valued d) single valued 8) When the value of an attribute A is obtained from the value of an attribute B, then the attribute Ais called 1) composite "b) stored °) derivgd_ — 4) retrieved 9) The entity types are represented in ER-diagrams by . a) ovals b) rectangles ¢) double ovals d) diamonds 10) The multivalued attributes are represented in ER-diagrams by . a) ovals, b) rectangles ©) double ovals — ¢) diamonds mn attribute values are used to identify each entity uniquely. a) complex b) unique ) characters: a key_- 12) An entity type without a key attribute is called entity type. a) null b) weak ©) strong d) single aa 13) specifies th€Set of valueSthat can be assigned to the attribute. a) block b) relation ©) structure d) omg —— 14) Multivalued attributes are shown by aQ Cot) <> ane 15) The(elationships are displayed as in ER-diagrams. a) rectangles b) ovals, ) triangles ) diamonds Scanned with CamScanner 16) The relationship in which an entity type participates more than once is a relationship. a) eure — b) iterative c) enumerated ) implied’ 17) specifies thecmaxinnum number of relationship instances that an entity can participate. a) range b) domain cS) cardinals — 4) ceiling 18) In ER diagrams, the total participation is displayed as a a) oval b) single line ©) doubleling? 4) arrow 19) A weak entity type normally has a key. a) partial — ») total ©) super 4) strong 20) A weak entity type always has a_"parlicipation constraint With respect to its identifying relationships. a) partial b) total a c) overlap d) disjoint 2 ty thd partial Key 3tribute is underlined with a line. a) single b) shaded c) dotted d) double ‘TRUE or FALSE: 1. The ER model is high-level conceptual model. ae F 2. The class diagrams in UML specify the operations on object so B In database design the conceptual design phase comes after logical design phase. ( 4, Composite attributes cannot be further subdivided. t 25. A multivalued attribute can have lower and upper bounds. e F) c (T. ctr ( c 6. An attribute value can be derived from another attribute, 7. The names on entity types and entity sets are different. Co 8. An entity cannot have more than one key attribute, 9. A relationship type of degree two is called as ternary relationship. 10. Relationship types can also have attributes\_—~ 11. The attribute of a relationship type can be added to participating entity types (OIF) 12. A weak entity type can have more than one identifying entity ve c 13. ‘The number of levels of weak entity types cannot be more than one, ( yo) Short Answer Questions: 1, What are the main phases of database design? Write them in order. Ans. Requirement collection & analysis, conceptual design, logical design and physical design. 2. How does ER model describes data? Ans, ER model describes data as entities, relationships, attribut 3. What are the different values a null value can have? Ans. A Null value can mean@q_unknown, hot applicable, exists but not available. Scanned with CamScanner Match the following notations for ER ms: Symbol Meaning | >) MULTIVALUED ATTRIBUTE 8 | DERIVED ATTRIBUTE ' 4 o> IDENTIFYING RELATIONSHIP pS 1 oO ENTITY ATTRIBUTE WEAK ENTITY RELATIONSHIP > KEY ATTRIBUTE PARTIAL KEY COMPOSITE ATTRIBUTE Scanned with CamScanner Identify the of the followin; binary relationships: Select the cardinality ratio: 1:N Nel M:N Parti n of EMPLOYEE: Cfotabor Partial Participation of PROJECT: otal yr Partial Select the cardinality ratio: Nil M:N Participation of EMPLOYEE: (Toiabor Partial Participation of DEPARTMENT: ‘Total o» Select the cardinality ratio: it M:N Participation of EMPLOYEE: Total Sx Partial \, Participation of PROJECT: PROJECT, Select the cardinality ratio: Participation of EMPLOYEE: Total for Partial ~ Participation of. DEnARTMENT: EMPLOYEE MANAGES. perartmenr Total Scanned with CamScanner Inthe ER di for COMPANY database identity the f + Names of (nonweak) entity types fp by wolo . Names of weak entities _ cho pe . Key of DEPARTMENT Primary key of EMPLOYEE co) . Names of partial keys (if any). Legon ape . Names of composite attributes Na cop esa . Names of multivalued attributes _\s.c IT ig. . Names of relationships Names of identifying relationships 9 10. Names of derived attributes _T. a 1. All the EMPLOYEEs must work on some meow o 2. All the EMPLOYEES should have a DEPENDENT.>< 3. Alll the DEPARTMENTS should have a PROJECT). 4. An EMPLOYEE need not be a manager of a DEPARTMENT. @ F) 5. A DEPARTMENT need not be managed by an EMPLOYEE. (T /(@) Answer the follox uestions based on the ER diagram for COMPANY database: 1, One EMPLOYEE can have many DEPENDENT'’s. \_— @/F) 2. One EMPLOYEE can work on asingle PROJECT. = —(T (@)) 3. One DEPARTMENT can control many PROIECTs. Lb, (@F) —5f2 One PROJECT can belong to only one DEPARTMENT. (@F) =f; One EMPLOYEE can work for many DEPARTMENTs_L_(T (06) 6. One PROJECT can be done by only one EMPLOYEE. (T /(@D 7. One EMPLOYEE can supervise only one EMPLOYEE=- — (T. 8. One DEPARTMENT is managed by only one EMPLOYEE. (WF) 9. One DEPARTMENT can have many EMPLOYEE, (@) F) 10. One EMPLOYEE can manage many DEPARTMENTs.c\ (T Scanned with CamScanner 1. The attribute NumberOF Employees of DEPARTMENT entity is a attribute. a) key c) composite d) multivalued 2. The attribute Name of EMPLOYEE entity is a attribute. a) key b) derived c) composite x~ d) multivalued 3. The attribute Locations of DEPARTMENT entity is a attribute, a) key b) derived c) composite \ ey foultivalued 4, The attribute Name of DEPENDENT entity is a key. a) primary b) candidate c) partial al ) super 5. The attribute Name of PROJECT entity is a key. a) primary b) candidate c) partial ) super 6. The attribute Ssn of EMPLOYEE entity is a key. a) primary b) candidate c) partial ) super 7. The relationship DEPENDENTS_OF is a relationship. a) identify b) recursive c) strong d) weak 8. The relationship SUPERVISION is a relationship. a)identifying _b) recursive c) strong d) weak 9. The attribute Name of PROJECT entity is a attribute. a)simple\“ _b) derived ) composite d) multivalued 10. The entity DEPENDENT is a entity. a) weak b) good c) strong d) super Scanned with CamScanner the ER di for database Names of (nonweak) entity types ‘Names of weak entities Key of AIRPORT Primary key of AIRPLANE 5. Names of partial keys (if any) ae LP Names of composite attributes 3k Names of multivalued attributes 8. Names of relationships fying relationships 10. Names of derived attributes 9. Names of Answer the follo yuestions based on the ER diagram for AIRPLANE database shown below: 1. The attribute NumberOFAirplanes of AIRPLANE entity is a attribute. a) key b) derived 6) composite ) multivalued 2. The attribute CustomerName of RESERVATION entity is a attribute. a) key bjderived —_c) composite ) multivalued 3. The attribute Weekdays of FLIGHT entity is a attribute. a) key b) derived c) composite 4) multivalued 4. The attribute SeatNo of SEAT entity isa key. a) primary ») candidate ©) partial 4) super 5. The attributes Number and Airline of FLIGHT entity is a key. ) primary ») candidate ©) partial ¢) super 6. The attribute Airplaneld of AIRPLANE entity is a key. a) primary b) candidate ©) partial d) super 7. The relationship INSTANCE OF is a relationship. a) identifying) recursive ©) strong 4) weak 8. The entity FLIGHT LEG is a entity. a) weak ~~ p) good ) strong 4d) super 9. The attribute Stare of AIRPORT entity is a attribute. a) simple b) derived ©) composite 4) multivalued 10. The entity FLIGHT is a entity. a) weak b) good ¢) strong 4) super Scanned with CamScanner 1. One AIRPLANE TYPE can have only one AIRPLANE. T@ 2. One AIRPLANE TYPE can land in only one AIRPORT. (T VF) 3. One AIRPORT can allow landing of many AIRPLANE TYPEs. ( F) 4. One FLIGHT can have many FAREs. F) 5. One AIRPLANE can be assigned many LEG INSTANCEs. F) Scanned with CamScanner Names of (nonweak) entity types 1. 2. Names of weak entities 3. Key of BANK 4. Primary key of CUSTOMER 5. Names of partial keys (if any) 6. Names of composite attributes 7. Names of multivalued attributes 8. Names of relationships 9. Names of identifying relationships 10. Names of derived attributes Answer the foll uestions based on the ER for database shown belo 1. The attribute NumberOFBranches of BANK-BRANCH entity is a attribute. a) key b) derived ©) composite 4) multivalued 2. The attribute Name of CUSTOMER entity is a attribute. a) key b) derived ©) composite 4d) multivalued 3. The attribute Type of ACCOUNT entity is a attribute, a) key b) derived ©) composite ) multivalued 4. The attribute BranchNNo of BANK-BRANCH entity is a key. a) primary b) candidate c) partial d) super 5. The attributes LoanNo and Type of LOAN entity is a key, a) primary b) candidate ©) partial ¢) super 6. The attribute SSW of CUSTOMER entity is a key. a) primary ») candidate ©) partial 4) super 7. The relationship BRANCHES is a relationship. a) identifying) recursive ©) strong d) weak 8. The entity BANK-BRANCH is a_ relationship. a) weak b) good cc) strong, d) super 9. The attribute Code of BANK entity is a attribute. a) simple b) derived ©) composite ) multivalued 10. The entity CUSTOMER is a entity. a) weak b) good ©) strong 4) super Scanned with CamScanner Answer the following questions based on the ER di for. 1. One BANK can have many BRANCHES. 2. One BANK-BRANCH can have only one ACCOUNT. 3. One CUSTOMER can have many ACCOUNTs. ( 4. One CUSTOMER can have only one LOAN. 5. One ACCOUNT can belong to many CUSTOMERS. Scanned with CamScanner Composite and multivalued attributes can be nested to any number of values. Suppose we want to design an attribute for a STUDENT entity type to keep track of previous college education. The student might have attended more than one college previously. Such an attribute will have: ¢ One entry for each college previously attended having college name, start date and end date, degree entries (can be more than one), and courses entries. + Each degree entry contains a degree name, month and year the degree was awarded. “Each course entry contains a course name, semester, year and grade. Design an attribute to hold this information using the notations () for composite attributes and {} for multivalued attributes as well as show how it can be represented in ER diagram. Scanned with CamScanner Consider the following set of requirements for a university database that is used to keep track of student's transcripts. 4 The university keeps track of each student’s name, student number, National ID number, current address and phone, permanent address and phone, birthdate, gender, class (I year, H year...), major department, minor department, and degree program (B.Sc., B.A.,....Ph.D.). ‘The name of the student should have first, middle, and last names. The permanent address should have apartment number, street number, city, state, postal code. Both National [D number and student number must be unique for each student. 4 Each department must be described by a name, department code, office number, office phone, and college. Both name and code must be unique for each department. 4 Each course has a course name, description, course number, number of credit hours, level number, and offering department. The course number should be unique for each department. + Each section has an instructor name, semester, year, course number and section number. The section number must be unique and each course can have multiple sections taught during same semester/year. A grade report has a student number, student name, section number, letter grade, and numeric grade (percentage marks). Design an ER schema for this application and draw an ER diagram for that schema. Specify key attributes for each entity type, and structural constraints on each relationship type. Scanned with CamScanner Chapter 5 The Relational Data Model and Relational Database Constraints Multiple-Choice Questions: 1) The relational model represents the ibase as a collection of a) files b) relat ) applications ) systems 2) In formal relationat model terminology, a row is called . a) tuple b) attribute c) relation d) domain 3) In formal relational model terminology} a column is called a) tuple b) attribute ) relation 4) domain 4) The say re Tata ‘appear in each column is represented by ___of possible values. a Gr Say “htc 5) A domain is a set of. values. a) multiple b) complex c) small d) toms — 6) The degree of relati number of of its relation schema, a) attribut b) tuples ) data types 4) relationships 7) A domain should be given __. a) name b) data type c) format 4) all of t) 8) A relation is defined as a es. a) function b) set ©) tee 4) graph 9) The null value of an attribute indicates value, a) zero b) unknow; ) infinite d) error The relational model is sometimes called as relational model. a) round b) complex ¢) tabular d) fat WP The Gelation schema yan be interpreted as a-type of. . a) statement ll em ute 4) definition 12) Each tuple in a relation can be interpreted as a f act a) virtual b) value d) domain 13) constraintcan be expressed in schema of relational model by using DDL. a) schema-1 b) inherent model-based) application-based 4) system-based 14) constrain species ta any sate of relational schema can have same values for superkeys. a) entity-integrity —_b) domain ¢) referential-integrity 4) a a yu Scanned with CamScanner 15) constraint specifies that within each tuple, the value of each atribute ust be atoms > value From some domain. a)entity-integrity b) oma c) referential-integrity d) key 16) key is used a) secondary 17) When there is more than one key in a relation, then each such key is called > a) primary b) useful c) multiple d) cance /” 18) constraint states that no primary key value can be null. a) key b) domain ) referential-integrity \ Gait integety 19) constraint states that a tuple in one relation that refers to another relation must refer to b) domain \c)FeféFential-integrity d) entity-integrity 20) constraint is used to maintain consistency among tuples if two relations. > a) key b) domain c) refe a entity-integrity d) number |. All values in a column are of same data type.———— Each row in a table represents a collection offen ta values7<-—_ In formal relational model terminology, a table is called a relation A domain is a set of composite values. 3& A domain need not be given a formats&—— “%. Itis possible for several attributes to have same domain. 7. Tuples in a relation must have a particular order 8. Ordering of values in a tuple is important> 9% Composite or multivalued attributes are ‘ilowed in relational model->— 10. A relation schema can have more than one keys - A key can have redundant attributes. +— 12. A superkey can have redundant attributes, —— S 13. The underlined attribute in ER diagram represents a primary key: 14, I1is better to have a primary key that has as many attributes as possible. 15. Key and entity-integrity constraint are specified on more than one relation.» 16. The referentia-integrity constraint is specified between two relations; ~ 17. A foreign key can have a null value 8. A foreign key can refer to its own relation.’ 9. Insert operation cannot viol wee ponlars: + 3 Ser a7 3 Scanned with CamScanner Quays 11228 Data Base Systems 113344 Computer Networks 114455 Computer Networks 223344 Data Base Systems ws S=225577 Computer Architecture 1331199 MS Ottice iss Operating Systems “> __ 445566 Operating Systems 556677 Operating Systems 661199 MS Word 663300 Logic Design 773311 JAVA 773355 Programming Languages 881100 Visual Basic 881166 JAVA 881188 Logic Design ‘991100 MS Office 994466 C/C++ 112203 111111 119344 222222 4 114455 339333 223344 117111 225577 333333 112233 El-Masri ‘Addison Wesley 113344 Tanenbaum | ‘Addison Wesle 114455 El-Masri ‘McGraw Hil 7223344 Tanenbaum ‘McGraw Hil 225577 Mano ‘Addison Wesley 331199 John ‘Addison Wesley 334455 El-Masti Addison Wesley 445566 Tanenbaum McGraw Hil 556677 Mano |Prentice Hall 661199 John Prentice Hall 663300 El-Masri Prentice Hall 773311 Ahmed Prentice Hall 773355 El-Masri | McGraw Hill 1881100 Schildt ‘Addison Wesley 1881166 Aho | McGraw Hill 881188 Mano McGraw Hill | 991100 Ramesh Prentice Hall 1994466 Aho J Addison Wesley OO rizzad}it1111 567890 6/1/2008 a/t2005) | +335, =o 119344fa3999a_ 204567. 612/2005, 82/2005) Y 114455|222222 345678 6/1/2005 8/1/2005) 229344|333333. 456789 4/6/2005 6/8/2005, 331199 111111 (226577)8333337567890c 6/4/2005 8/4/2005, 334455 111111 331199]111111 678901 1/1/2005 3/1/2005) 445566 333333 445566|333333 890123 4/4/2005 6/4/2005, 556677 222222 + S56677|111111 901234 2/1/2005 4/1/2005 (Ws 661199 111111 661199]111111 229456 6/1/2008 6/1/2005, 663900 220002 9 773855]111111 667890 6/2/2008 8/2/2005) 773311 111111 | 881166|222022 556789 1/1/2001) 3/1/2001 773355 444444 1881168)|222222 223456 2/2/2004 4/2/200 881100 333333 991100|111111 901234 1/1/2005, 3/1/2005) ~ 881166 222222 994466|444444 456789 6/1/2003 8/1/2003, 2 2 3 281188 444444 LAL OO 991100 222222 2 994466 939999 2 ’ ( Scanned with CamScanner Mui 111234 |Aiman —_‘|1122, Street |666 5457 119, Jeddah 112345 [Abdul 1120. Street |999 7654 10, Riyadh 123456 Ahmed _|1020, Street 222 4567 1, Hayel 222845 |Hussain _[2233, Street |888 6556 — l20, Riyadh 223456 |Mubarak [2230, Street |777 4567 —_ 111, Jeddah | ——— 234567 |Mohammed |2030, Street |555 6789 — l2, Jeddah 334567 |Saad [3340. Street |999 5643 _» H2, Riyadh 345678 [Jabbar —_|3040, Sireet 888 5432 [s, Riyadh 445678 [Mohsin ‘14450, Street |444 6789 13, Jeddah 456789 [Salem 4050, Street |393 7645 |4, Dammam 556789 |Moosa _|5560, Street |111 4567 Ha, [Dammam 567890 |Saiman [5060 Street |777 4356 [5, Riyadh 667690 [Fahd (6670. Street [666 5678 15, Khobar 678901 [Zayed [6070, Street |777 4567 [6, Jeddah 778901 |Khaled —_|7780, Street |777 5443 16. Riyadh 7@9012 [Osama |7080. Street |999 6434 7, Makkah 389012 Jazz \8890. Street |777 5678 17, Jeddah 890123 |Ismail [8090, Street |111 2346 [3, Madinah ‘901234 [Lateef __|9010, Street [777 5432 lo, Riyadh 990123 [Taleb \9910. Street [222 4567 18, Riyadh —s PUBUSHER Publisher Name/Address" ||" Phone ‘Addison Wesley |3000, West End, 303030333 [Singapore WeiGraw Hil 2000, Connaught Place, 202020222 hi Prentice Hall |1000, Arington Street, 101010111 wentenectond hee 111111_|North 111, North End) 3222222 [South 222, South E 333333_|East 333, East End aaaaad [West ‘444, West End 5 7 — Scanned with CamScanner [Michigan ‘Suppose each of the following update operations is applied directly to the LIBRARY database state, Discuss all integrity constraints violated by each operation. if any. 1. Insert <*114455°, ‘Discrete Mathematics’, ‘Pearson’> into BOOK. ‘Morris’> into BOOK_AUTHORS 222222", +234567", 3/4/2006". *3/5/2006'> into BOOK_LOANS. ‘Ahmed’, +1124, Street 5, Riyadh’, *222 5432'> into BORROWER. a 444444", 12> into BOOK_COPIES. (6: Insert <'5S5555°, ‘Central’. °555 Central Point’> into LIBRARY_BRANCH. (NJ. Delete the BOOK tuple with BookID = *881166". (AS. Delete the BORROWER tuple with CardNumber = ‘234567. ¢9. Delete the LIBRARY_BRANCH tuple with Branch ID = *22222: \16-Delete the BOOK_LOANS tuple with Book ID = °331199". ‘AI1. Delete the BORROWER tuple with CardNumber = "334567 l2. Modify the Book ID of BOOK_COPIES tuple with Book ID = +2334" to *886655. S43. Modify the Branch 1D of BOOK_LOANS tuple with Book [D = *225577' to *111222". into PROJECT. Insert <"Production’, 4, “943775543", *1998-02-01"> into DEPARTMENT. Insert <°677678989", null, °40.0°> into WORKS ON. Insert <*453453453", ‘John’, M, *1970-02-03", ‘“SPOUSE’> into DEPENDENT. Delete the WORKS_ON tuples with ESSN = ‘333445555", Delete the EMPLOYEE tuple with SSN = ‘9887654321. Delete the PROJECT tuple with PNAME = ‘ProductX”. Modify the MGRSSN and MGRSTARTDATE of the DEPARTMENT tuple with DNUMBER = 5 to “123456789 and *1990-10-01", respectively. 1952-06-21", ‘2365 Newcastle Rd, Bellaire, |. Modify the SUPERSSN attribute of the EMPLOYEE tuple with SSN = 999887777" to *94377543". . Modify the HOURS attribute of the WORKS_ON tuple with ESSN = 999887777" and PNO = 1010 5.0". Scanned with CamScanner

You might also like