Unit-8 DATABASES_ 2a2AaaTtaG pireINTRODUCTION To DBMS anp RELATIONAL MODEL Qi Q2 Qs LEVEL-1 ‘A customers telephone number is stored ina Q4 customer file, a sales agent file, and in an invoice file, In database, this is known as (a) Transparency (b) Availablity (©) Redundancy (A) Integrity ‘To be considered minimally relational, the DBMS must support the following key relational functions: (a) SELECT, UNION, INTERSECT (b) SELECT, UNIO? Qs JOIN (c) SELECT, PROJECT, JOIN (@ SELECT, PROJECT, UNION ‘The schema of a table is an example of (a) Relationship (b) Entity (c) Metadata (@) Atamicity A transaction is a collection of operations that performs 2 single logical function in a database application. The successful execution of a database despite the possibility of system failure is called {a) Inegrity (b) Durability (c) Consistency (@) Atomicity In context with Relational Algebra, which of the following are unary operations. 1. SELECT I, PROJECT U1, UNION IV PRODUCT. (a) All are binary operations (b) Land II only, (e) Toaly (@) 1 and M1 onlye&e—$£@££@— — — Qs Q7 Qs ay Match the following, Group Group Vortical subset ofa | 1,| SELECT | A. table | Honzontal subset of 2. ROREE B atable | G[ Common tuples | @ 1-2-8 () 1-C,2-A4 () 1-B.2-A @T-a,2-B Database that are designed and managed specifically to meet information needs are called (a) Database Management Systems (b) Data’ Warehouses {e) Transaction databases (@) Production databases ‘The data retrieval time factor is most critical for (a) Data Warehouse (©) Decision DBMS (©) Transactional DBMS () Both (a) and (b) ‘A file system is said to exhibit data dependence because (a) When any of the file's data characteristics change, all data access programs are subject to change. (b) Data is the most important part of a file system which also includes hardware, software people and procedures. (©) Orgonization of the data, within the file is determined by the data’s expected use (@) A change in any file's structure, such as the addition or deletion of a field, requires the modification of all programs using that fil, @.10 Qi Q12 Q.13 Qi4 Qs {Daranases ‘Suppose x is a component of some tuple, and the domain for that component is the integers. If x hhas the value NULL, what is the value of L O#x I x- (2) NULL, NULL (b) 9,0 (©) NULL, 0 (d) 0, NULL Which of the following is administrator's function? a database {a) User coordination (b) Performance monitoring (©) Backing up the database (@ All of these ‘Which two files are used during operation of the DBMS? (a) Data dictionary and query language (b) Data dictionary and transaction log {e) Data manipulation language and query language (@) Query languages and wilities A schema describes (a) record relationships (b) records and files (©) data elements (@ all of these ‘A transparent DBMS (a) keops its physical structure hidden from users (b) keeps its logical structure hidden from users (e) Cannot hide sensitive information from users (@) both (2) and (b) ‘A phone no in a database is an example of a (a) File (b) Son (e) Field (@) RecordINTRODUCTION To DBMS ano Rewanionat Mops, } ——__________(aagn) Qs Qi7 Qs Qi Q.20 Q21 If P and Q are predicates and ¢ is the relational algebra expression, then which of the following equivalence are valid? (2) sxl6Q\e))=g(cp(2)) (b) splagle))=p,a(e}) (6) a9ferle))=sr.gle)) (d) All of these A race condition occurs when (a) vo users of the DBMS are interacting with different files at the same time (b) two concurrent activities interact to cause a processing error (©) both (a) and (b) (@ tone of these The distinguishable pasts of a record are called (@) database (0) ficlds (©) data (2) files The logical data structure with a one-to-many relationship is 2 (a) relational (b) chain (c) tree (@) network Ina large DBMS, (a) cach sub-schema contains every field in the logical schema () cach user can access every sub-schema (c) each user can "see" only a small part of the catire data base (@) all of the above A network schema {a) Stores data in tables (b) Permits many-to-many’ relationships (e) Restricts the structure toa one-to-many relationship (d) None of the above Q22 Q.23 Q24 Q.25 Q.26 Q27 Goals for the design of the logical schema include (a) Boing able to access data efficiently (b) Being able to construct queries easily (©) Avoiding data inconsistency (2) All of the above When several users access the database at the same time, it is said to be (a) Concurrent storing (b) Connection trap (©) Database management (@) Integrated data Which of the following is not a responsibility of a DBA: (a) Deciding access strategy (b) Deciding the storage structure and access strategy (©) Marketing the software (€) Deciding the information content of the database ‘A good query’ system {@) allows non-programmers to information stored in a database (b) can be accessed only by the data processing professionals (©) can accepts English language commands (@) none of the above When using a database management system, the first thing that we must do is to (@) load the software (b) activate file editor (6) create @ data base file (¢) koep a floppy disk in readiness Which of the following 1s an advantage of the database approach? (@) program/data independence (b) elimination of the data redundancy (©) ability to associate related data (d) all of the above access 10 our micro-computerQ.28 Q.29 Q.30 Invan entity relationship, y is the dominant entity and x is a subordinate entity Which of the following isfare incorrect? (a) Operationally, x 1s deleted, y remains the same (b) Operationally, x is deicted, s0 is y (c) Operationally, if y is deleted, so is x (@) x is existence dependent on y LEVEL-2 Consider the relation 1, (P,Q. R) and (R$. T) with primary keys P and R_ respectively The relation r, contains 2000 tuples andr ‘contains 2500 tuples, The maximum size of the Join ry oar is (a) 2000 (0) 2500 (©) 4500 (a) 5000 Consider a relation geq which represents groater than or equal to", that is, (x, y) geq only ify 2x Create table goq (ib integer ‘not null ub integer not null primary key Ib foreign key cascade) (ub) references geq on delete Which of the following is possible if a tupls (x. y) is deleted? {a) A tuple (z, w) with 2 > y is deleted (©) A tuple (2, w) with 2 > x is deleted (©) A tuple (2, w) with w 1200)} (b) {| 3s © borrow (t{Customer name] = s{Customer_name]) s[smount] > 1200)} (©) {t | UCustomername) ¢ borrow 4 tlamount] > 1200} (@) {t(Customer mame) / t € borrow {amount} > 1200)}Intropuction To DBMS ano Reiarionat Mopet Qu ass Qe Which of the following Domain relational calculus finds all customers who have a loan amount of over 1200? (a) ( | © borrow 4 a> 1200)} (b) { | 3b, |, a (-b, |, > & borrow Aa > 1200)} (@) { | 3b, |, a ( © borrow va > 1200) | a> € borrow Aa > 1200)} ‘A natural JOIN is the result of a three-stage process. Choose the option that gives the correct order of it (a) PRODUCT, SELECT and PROJECT (b) PRODUCT. PROJECT and SELECT (c) PRODUCT, JOIN end SELECT (@) PRODUCT, JOIN and PROJECT Consider the relational algebra DOCTORS(Id, LastName, Departmert, Supervisor) NURSES(d, Last Name. Department, Supervisor) Write a query to find the last names and supervisors of the medical personnel that work in the Cardiology department (2) Tlhot Name. Supervisor (ODerartment = Cardislory (NURSES)) That Nanc, Supervisor (Department = Catiology (DOCTORS) (B) That ane, Superson (Crepurinest = Cardintoey (NURSES)) Tan Name. Supervisor (Cpepartment = Caology (DOCTORS)) (©) Thaw wane, supeesisor (Foeparmen = Cuviotegy (NURSES)) Tot Nome, Superior (Cepartment ~ Cardiology (DOCTORS) () None of these Q37 The (a) No Output Q38 (b) te) @) @ result of 64-s(0) is x BE 1 1 a x a a B 1 1 2} A a result of My, a(¢) is as a_| bf a | e [2 As a a 13Q.39. Tae result of rs is, (a) Empty relations (b) legal Operation ES ©) Q.40 Identity the type of relationship. responsibility of CAR DRIVER responsibility for @it @).N M Mel @iM Q.A1_ We have the following relation schemas: Pationt(patient_nams, ‘Treating doctor), Hospitalcharges(patient name, hospitalchargeid, typeofcharge, amount); patient_addr, Doctorcharges(patient_name, doctorchargeid, typeofchargeid,, amount) Suppose we have query as, (SELECT patient name FROM Doctorcharges) EXCEPTALL, (SELECT patient_name FROM Hospitalcharges) If Jones has 3 dostorcharge bill and one hospitalcharge bill, then how many tuples with the name Jones are there in the result? a) 1 tuple (b) 2 tuples (©) 3 tuples (@) 4 tuples Q42 Q43 Qa Consider a relation with a single-attribute key and n (n> 0) tuples. If we do a Projection on the key attribute on this relation, what can we say about the cardinality of the Projection relation? (a) Cardinality =n +1 (b) Candinality = 9 (©) Cardinality = 1 (d) None of these Consider the join of a relation R with a relation S. If R has m tuples and S has n tuples ‘Then the maximum and minimum sizes of the join respectively are (a) ma and m +n (b) m+ mand [m ~ a (©) m and 0 (d) m+n and 0 Consider the mode! given below What type of model 1s it? (a) Relational tb) Network {c) Hierarchical {d) None of these LEVEL-3 Common Data For Questions 45 to 48: ' Answer the questions with reference to entities EMPLOYEE PROJECT and the and relationship ASSIGNED_TO between them, | Emp [- tor [103] 1 | } 106 [107 1 10 fo Fig. : EMPLOYEE TableInreopuction 10 DBMS ann Retationat Mone: Qas NET278 NET231 Figure : ASSIGNED_TO Table Project# | Project Name | Project_Leader | NET231 | Pascal 107 | NET278 | Pascal/Object | no NET353 | Database _| NET354 | Operating Sys ot Nerds | Daiatae | iol Figure : PROJECT Table Write a relational algebra expression to satisfy the following query, "Get Lmp# of employees working on project /‘NET353" (2) Feaps (Crrjet - surs(EMPLOYEE oa PROJECT) (0) Crp Forject (©) Memps (Srrojece (@) None of these ners ASSIGNED TO) ‘erie ASSIGNED, TO) any Q46 Choose the correct response’ relation from the given option for the following query: (Relational Algebra Expression) EMPLOYEE 24 gy: (Ghia (ASSIGNED_TO)) [Emp# | Projecti [106 | NETS33 17 [NETS Anite Dipti Priya 12 | Empé | Project NET353 | AS RET | 107 | NET3S3 [2 | NET353 Choose the most appropriate relational algebra expression to satisfy the following query. "Obtain details of employees working on the database project” (a) EMPLOYEE. <1 po (ASSIGNED_TO Pd Grrojeatt (PROJECT)))) (b) EMPLOYEE 41 typ (ASSIGNED_TO PS (ject (PROJECT)))) (0) EMPLOYEE 4. trype (PROJECT et (Project? CiPreject Name = (ASSIGNED_TO)))) W) EMPLOYEE Dd tigi (PROJECTOS (Praject? (pejou Nene “ (ASSIGNED_TO))) (reese Nate | = Datsase (Orrojea Nene - Database Dasimee Dulane—<$ @A@ a$$ A A$ (ern) ‘GAB Choose the correct response relation from the Common Dale For Questions 50 given option for the following query. to 52: “Get the number of employees who work on all Refer table 1, table 2 and table 3 of a banking Pe system, Emp# @ | tr Client pin | 400085 | | 613432 . ua 523512 © waar muenand Rat | 414564 agin opt Mambai | 400086 © fe Chennai 724036 QAP Consider the following: L_Yaresh_ | Bangalore | 614012 | Fig. The client relation ‘4, Woh Table 2 3 [ Ace_no Balance 4 | S101 | 1000 $102 1500 Fig. The Account relation Table 3 Client_name | Acc no pamela Sees Bhayna Bhayna Manish | Prakash | S_102 Vishal $305 Fig. The Depositor relation ), @.5D How many tuples will be present in response to the following query | tint name het pmy{Clicnt) rca ame(Depesitor) Process [Time P Q P R fos} Time. ia) 40 @— 3 ‘ F 4 (b) 35 fe) 32 (d) None of these QaIntropuction ro DBMS ano Retationat Monet Q51 Q.52 Q53 How many tuples and attributes will be the result of the following query Gotan cty = “tangle! (Clisnt >I Account >a Depositor) where ‘O19 natural join. (a) 86 (b) 8,5 O84 @25 Which of the following 1s 2 query to find the name of all chent who have aa account tn the bank and balance more than 1000 (8) Mecries none) (Favane > vow" (Cent Dt Account <1 Depositor)) (b) Scctiem rane) (Faimnec > -ieor (Client Ot Account t<1 Depositar)) (©) Mciien mane) (Face - row) (Client Pet Account)) ) G¢ctiat same) Fmratonce ~ viovor) (Client Dt Account) ‘GATE QUESTIONS Let R (a, b, ¢) and S (d. ¢. £) be two relations in which d is the foreign key of S that refers to the primary key of R. Consider the following four operations R and $ A. Insert into R B. Insert into S C. Delete from R D. Delete from S Which of the following is true about the referential integrity consiraint above! IGATE. 1997] [2-Marks| (a) None of these can cause its violation (b) All of these can cause its violation (c) Both A and D can cause its violation (d) Both B and C can cause its violation Q.54 Qs5 Q.56 Q.57 Which of the following query transformations (ic, replacing the LHS. expression by the RHS expression) is incorrect? R; and Rp are relations, C) C3 are selection conditions and Ay and Ap are attributes of Ri [GATE 1998] [2-Marks] () 6¢,(6¢,R)40¢,(0¢,(R1)) ©) Ge, (a, RD Ra,(6c,()) (6) G(R: U Ra)G0 (RD) U Ge,(Rod (@) ma, (eR) F90,(FA,(RD) Let R = (a. b,c. df) be a relation schema with the following depeadencies © -> £, ¢ > a, ce +d, a->b Which of the following is a key of R? [GATE 1999] [1-Mark] (a) ac (b) ac {e) ec @) ed The relational algebra expression equivalent to the following tuple cateulas expression (te rs CA] = 10 4 YB] = 20) is IGATE 1999] [1-Mark] @) SantovB-209() ©) %a=10(-9(B-20 60) (©) Sa=10 (9 (B-20)10) 4) O%a=10 (0) ~ FB-20/(0) Given the relations, employee(name, salary, deptno), and department(depino, deptname, address) which of the following queries cannot be expressed using the basic relational algebra operations (6, TX, [x 0, U, J? [GATE 2000} [1-Mark] (a) Department address. of every: employes (©) Employees whose name is the same as their department name (€) The sum of all employees salaries (@) All employees of a given departmentQ.58 Qs? Qo Q61 ‘Suppose the adjacency relation of vertices in a ‘graph is represented in a table Adj(X, Y). Which of the following queries cannot be expressed by a relational algebra expression of constent length? IGATE 2001] [1-Mark] (a) List of all vertices adjacent to a given verte (b) List of all vertices which have self loops (c) List of all vertices which belong to cycles of less than three vertices (@ List of all vertices reachabie from a given vertex Which of the following relational calculus expressions is not safe? {GATE 2001] [2-Marks] @ {t/YuER,([A]="x" = 3seR, (A= sfA] AsiA]=ufAD)} (b) {t | 3u © Ry@[A] = u[A) 9 3s © RAGLA] = sIAD (©) {| ate Ry} (@) {| du © RA] = uJA}) > 3s © RyG[A] = sfA)}} Let r and s be two relations over the relation schemes R and S respectively, and let A be an attribute in R. Then the relational algebra expression Ca..( <1 5) is always equal to IGATE 2001] (2) Oya(t) [Mark] (b) r (6) Cau) bas (2) none of the above With regard to the expressive power of the formal relational query languages, which of the following statements is tue? [GATE 2002) [Mark] fa) Relational algebra is more powerful than relational calculus (b) Relaticnal algebra has the same power as relational calculus (©) Relational algebra has the same power as safe relational calculus (@) None of the above Qé2 Q63 aes Let R, (A, B, ©) and R; (D. £) be two relation schema, where the primary keys are shown underhned, and let C be a foreign key in Ry referring to Ry. Suppose there is no violation of the above referential integrity constrain: in the corresponding relation instances ry and r Which one of the following relational algebra expressions would necessarily produce an empty relation’? IGATE 2004] U-Mark] {a) Mott) - Tet) {b) Te(ty) ~ Mostra) (c) TotimacnR2) {d) Tet &to-pra) Consider the following relation schema pertaining toa students database Student (rollno, name, address) Enroll (rolino, courseno, coursename) where the primary keys are shown underlined The number of tuples in the student and Enroll tables are 120 and 8 respectively. What are the maximam and minimum number of tuples that can be present in (Student * Enroll), where denotes natural join? [GATE 2004] (a) 8.8 (b) 120.8 (©) 960.8 (d) 960.120 Tt is desired to design an object-oriented employee record system for a company Each employee has a name, unique id and salary Employers beiong to different categories and their salary is determined by theic category. The functions getName, getld and compute Salary are required. Given the class hierarchy below, possible locations for these Functions are 1 sgetld is implemented in the superclass LL, getfd is implemented in the subclass IIL getName is an abstract function in the superclassIntropucrion to DBMS ano Retarionat Mobei IV, getName is implememted inthe superclass: V. getName is implemented in the subclass Vi. getSalary is an abstract function in the superclass VII geSalary is implemented in the superclass VII, ge:Salary is implemented in the subclass Emphyee Engineer Seria Choose the best design [GATE 2004] [2-Marks} (@) 1.1, Vi, vil (b) LV. Vu (e) 1, MM, ¥, VIL Vill @ u, %, var Consider the relation Student (name. sex, marks), where the primary key is shown underlined, pertaining to students in a class that has at least fone boy and one girl. What docs the following relational algebra expression prochce? Uae Gee (SB4tt))- Ue SHEE, > Pa ( SEH) [GATE 2004] (2-Marks} fa) names of girl students with the highest marks (b) names of girl students with more marks than some boy student (c) names of girl students with marks not less than some boy student (d) names of girl students with more marks than all the boy student Q66 Q67 Q68 Qs Which level of locking provides the highest degree of concurrency in 2 relational database? [ITFGATE 2004) [1 Mark} (a) Page (b) Table (©) Row (4) Page, table and row level locking allow the same dogrec of concurrency Let r be a relation instance with schema R= (A, B,C, D) We define 1, = TT, off) and ry = Tlap(t), Let s = ry * ry where * denotes natural join, Given that the decomposition ofr into r, and 1 is lossy, which one of the following is TRUE? (GATE 2005] @ser [-Mark} @) rus @rcs @rt Consider a relation scheme R = (A, B, C, D, E, H) on which the following functional dependencies hold : {A -> B, BC > D. EC, D + A}. What are the candidate keys of R? [GATE 2005] [2-Marks| s (@) AE, BE (b) AE, BE, DE () AEH, BEH, BCH (@) AEH, BEH, DEH Let E, and E, be two entities in an E/R diagram with simple single-valued attributes. R, and Ry are two relationships between E; and Ep, where R, is one-to-many and R, is many-to-many, R, and Ry do not have any attributes of their own, ‘What is the minimum number of tables required ‘0 represent this situation in the relational modsI? IGATE 2005] [2-Marks] fa) 2 &) 3 ©4 @5Q.70 The following table has two attributes A and C where A is the primary key and C is the forcign key referencing A with on-delete cascade prcione wit ose A c } | 2 4 fh 4 _ 3 t cs | 2 4) [2 2 9 Lae Te The set of all tuples that must be additionally deleted to preserve referential integrity when the tuple (2, 4) is deleted is: [GATE 2005] (a) @, 4) and © 4) [2-Marks] {b) (3, 2) and (7, 2) (©) G. 2), (7, 2) and (8, 5) @ 6. 4), 4,3) and (6, 4) Q.71_ Consider the relation enrolled (student, course) in which (student, courso) is the primary key, aad the relation paid (student, amount) where student is the primary key. Assume no null values and no foreign keys or integrity constraints. Assume that amounts 6000, 7000, 8000, 9000 and 10000 were each paid by 20% of the students. Consider these query plans (Plan 1 on left, Plan 2 on right) to “list all courses taken by’ students who have paid more than x" tat Tada Pais 4 4 foun) [Sel] [wee] [smona Toadon| [femgeest| maca| | sea Tad ses oo Tete op 4 Pajerea cone aegees } - elec ov ni + ‘A disk sock takes 4 ms, disk data transfer bandwidth is 300 MB/s and checking a tuple to see if amount is greater than x takes 10 ps Which of the following statements is correct? [GATE 2006] [2-Marks| Q72 Qn (a) Plan 1 and Plan 2 will not output identical row sets for all databases (©) A course may be listed mote than once ia the output of Plan 1 for some databases (c) For x = $000, Plan I executes fester than Plan-2 for all databases (d) For x = 9000, Plan 1 executes slower than Plan 2 for all databases Information about a collection of students is given by the relation studinfo (studld, name, sex), The relation enroll (stud. courscld) gives which student has enrolled for (or taken) what course(s), Assume that every course is taken by at keast onc male and at least one female student. What does the following relational algebra expression represent? Tleousetd (Tavita (sex ~ “emate” (usin) * TTeourcta (enroll)) ~ enroll) [GATE 2007] [2-Marks} (a) Courses in which all the female students are enrolled (b) Courses in which a proper subset of forsale students are enrolled (©) Courses in which only male students are enrolled (@) None of the above Consider the relation employee(name, sex, supervisorName) with name asthe keysupervisor Name gives the name of the supervisor of the employee under consideration, What does the following ‘Tuple Relational Calculus query: producc? [GATE 2007] [2-Marks| {ename | employee(c) « (V7) [-empolyee(x) v x supervisorName # ename v xsex = "male"]} (a) Names of employees with a male supervisor (®) Names of employees with no immediate male subordinates (©) Names of employees with no immediate female subordinates (@) Names of employees with supervisor a femaleInrkopuction 10 DBMS ano Retarionat Mopet Q74 Qs Common Data For Questions 74 to 75: Consider the following ER diagram The minimum number of tables needed to represent M, N, PRI, R2 is [GATE 2008] @2 [2-Marks} &) 3 4° @5 Which of the following is a cortect attribute set for one of the tables for the correct answer to the above question? [GATE 2008} (@) (MI, M2, M3, PL} [2-Marks} (b) (Mi, PL, NI, N2} (©) (MI, PINT} (d) (MI, PL} Q.76 Let R and S be two relations with the following, schema RQ, RL R2. R3) SP. Q, $1, $2) where {PQ} ia the key for both schemas. Which of the following queries are equivalent? [GATE 2008} [2-Marks] 1. To(Ressy 11 TR) os TIS) M1, Hea) 0 Te(S)) TV. Then) ~ MagR) - ThelS)) {a) Only | and IT (b) Only 1 and tt (c) Only 1, Hand 1 (@) Only 1, MM and IV ANSWER KEY seo I & © 3 e 4 b 5 6 (* |e 7 lie 8 ene 9 aj 0 [a a d 12 b 13 a | 14 a 15 c 16 d 7 (oe 18 b 9 © 20 d 21 bee| 22 ued 23 [uae 24 (ree) 25 (ie 26 5 2 de] 28 5 29 a 30 S [31 |gedie| 32 [mea] 33 [lgbeel 34 [ite | 35. |e | 36 @a| 37 e 38 3 39 © 40. ame al 6 42 b | |e 44 c 45 © 46 b 47 b 8 & 49 d “50 d 31 a | 2 loaal 53 co 4 (ae oS ee 36 (peel 57 lwo) 58 (lid 39 [eed | 90. | ne 61 c 62 a | 63 a 4 a 65 a 66 fe 67 € 68 d 9 b 70 c 7 ©. R © B © 4 a 7... 7% [ue3.1 $.2 33 3.4 3.5 SOLUTIONS (c) Redundant data is unnecessarily duplicated data A database contains data redundancy when the same data about the same entity are kept in different locations. Redundant data are often the source of difficult — to — trace information errors. Reports might yield different results, depending on which version of the data was used, fe) Relational algebra defines the theoretical way of manipulating table contents using the eight relational functions. SELECT, PROJECT, JOIN, INTERSECT, UNION, _ DIFFERENCE. PROJECT and DIVIDE To be considered minimally relational, the DBMS must support the key relational funccions SELECT, PROJECT and JOIN. Very few DBMS are capable of ‘supporting all eight relational operators. (c) A data dictionary contains metadata — that 1s, data about data, The schema of tables is an example of metadata. A database system consults the data dictionary before reading or modifying actual data (b) ‘Atomicity: Requires that all operations (parts) of a transaction be completed, if net, the transaction 48 aborted, In other words, a transaction is ‘treated as a single, indivisible, logical unit or work. Durability: Indicates the permanence of the database's consistent state, When a transaction is completed, the database reaches a consistent state, and that state cannot be lost, even in the ‘event of the system's failure. (b) SELECT and PROJECT are called unary operations because they operate on one relation 36 S7 Ss S32 (c) SELECT yields values for all attributes found in a table, SELECT can be used to list all of the rows values for cach attribute, or it can yield selected row values for cach attribute, In other words, SELECT yields a horizontal subset of a table PROJECT produces a tist of all values for selected attributes In other words, PROJECT yields a vertical subset of a table. (b) Produetion databases, also known as Transaction databases are the databases we encounter when ‘we participate in online transactions such as enrolling in a class, registering for car, buying a product, or making a bank deposit or withdrawal ‘Although such databases yield streams of useful information, there are specialized databases, known as data warehouses that are designed and managed specifically to meet information needs. The data warchouses derive most of their data from production databases () Transactions such as product or service sales, payments and supply purchases reflect critical day-to-day operations. Such transactions are time-critical and must be recorded accurately and immediately. A database management system primarily designed to support such “immediate response" transactions 1s classified as transactional databases. (a) A file system ig said to exhibit. sirictural dependence because a change in any file's structure, such as addition or deletion of z ficld, requires modifications of all programs using that file, That means, access to a file is dependent on its structure A file system is said 10 exhibit data dependence because a change in any file's data characteristies, such as changing the field fiom integer to decimal, requires change in all data access programs, That means, access to a file data is dependent on its data charactensticsIntropuction to DBMS ano Retanionat Movet $.10 $11 $.13 $.16 $.27 8.29 3.30 $31 $32 (a) When we operate on a NULL and any value, including another NULL, using any attribute operator, the result is NULL. (d) Optimizing the perforamance of the queries is fone of the important function of a DBMS. User co-ordination and backing-up the database is also its funetion (a) Schema means the structure of the database, the tables, the constraints, the relation, etc. which make-up the entire database, {d) a, b, care same type of equivalence expressions (d) Advantages of databaso approach 1 Reduce data redundancy 2. Provides data sharing facilites 3. Provides data integrity Provides data independance (a) 1(P, QR) and 1(R, $, T) ‘The primary keys are P and R respectively Relation r1 contains 2000 tuples and Ro contains 2500 tuples R is the forcign key in relation 11. ‘The maximum size of the jom r)>1000); Relational Algebra Query is where Teustomer_same (Stpatance-iom (Deposit)) (4) Select client customer_name, client customer_eity from clieat, customer $33, 8.34 $35 $.36 $37 where (client customer mame = customer. Customer_name and Banker name = "Agassi" Relational Algebra Query is “%etiontcestamer- name, customer city (Caient.customer- name) = customer.custo (Caeter name ~ *Agunir (Client x customer) (b) Relational Algebra Query is er_name {t | J s © borrow (t{Customer_name] = s{Customer_name}) ~ slamount] > 1200) (e) ‘The relational calculus statement is {eer |Ib ae 1200)} (a) A natural JOIN links tables by selecting only the rows with common values in their common attribute(s). A natural join is the result of a three -stage_ process Step |: First, 2 PRODUCT of the tables is created, Step 2: A SELECT is then performed on the ‘output of step | to yield only the rows for which the common attributo(s) vaiues are equal Step 3: A PROJECT is performed on the results of Step 2 to yield a single copy of each attribute, thereby climinating duplicate columns {e) Since wo want the last names and supervisors of the medical personnel that work in the Cardiology department, 62> © borrow A a> (@) First, we find the last names and supervisors among Nurses who work in Cardiology department, (i) Secondly, we find the last names and supervisors among Doctors who work in the Cardiology department. (ii) Lastly, we took the union of both to find the required query (e) Since, it is only selection and not projection, all the attributes will appear in the result having A=a$.38 $39 $.40 3.41 $8.42 5.43 3.44 (a) ‘The output relation will contain attributes of A and B. But tuple (a, 1) is repeated. ‘Therefore it will appear only once. {c) Since both r and s are union compatible, the operation is legal. The result will be relation 1 after removing all the tuples that are common to both. (c) L to R. Each CAR must be responsibility of one and only one DRIVER R to L:: Each DRIVER must be responsible for ‘one or more CARs, ‘This is a M.: 1 relationship. (b) Since we retain all duplicaics by using EXCEPTALL, therefore the rumber of duplicate copies a tuple in result is equal to number of duplicate copies of the tuples in d minus the number of duplicate copies of the tuple im b, provided that the difference is positive {b) Since there are m different tuples in the relation, there must be n different key values, one per ‘tuple, Therefore, the cardinality of the projection on the key attribute should be equal ton since there are-no duplicate values and cach valuc ‘must appear only once. {e) Tho maximum size would be the case where every tuple of R is combined with every tuple of $ to got mn tuples, The minimum ease is when no tuple of R is able to combine with any tuple of S. (c) It is hierarchical because access t0 each item 1s only through one path beginning at the top. One could not access the cost without knowing the part name, For selational modol, it would be tables as shown below The tables would be connected by the supplicr ID number The relational model would be better because any item can be accessed quickly in a variety of ways SUPPLIER COsT ae PART NAME | COLOR } | — + +——_+ — — - + — Lp $.46 $8.47 | SUPPLIER 1D ‘SUPPLIER ADDRESS SUPPLIER PHONE, j—_-_—}. L {c) To evaluate the given query, we select those tuples of relations ASSIGNED_TO such that the value of the Projecti attribute is NET3S3, We then project the result on the attribute Empi# to ‘eet the response relation The response relation is as shown below Zan 106 a [an | {b) The first part of the evalnation of this query 18 the same as in the query in the previous example It is however, followed by a natural join of the result with EMPLOYEE relation to gather ‘the complete details about the employees working on the project NET3S3 (b) This query requires two joins. The first step is to find the number(s) of the project(s) named Database. This involves a selection of theInrropuction to DBMS anp Retationat Monet 5.48 SAP relation PROJECT, followed by a projection on the attribute Project, The result of this projection is joined with the ASSINGED TO rolation to give tupks of the ASSINGED_ TO imolving Database. This is projected on Emp# and subsequently joined with EMPLOYEE to get the required employee details The response relation via as shown below EMPLOYEE 2 tig: (ASSINGED_TO Dat ‘Datta’ (PROJECT) reece (Cprejed Sime Emp# | Name 101 | Manish 106 | Anita 107 | Dip 2 | Priya {c) ‘The sequence to follow in evaluating this qucry is first compile a list of all projects from the PROJECT relation by a simple projection on Project#, then dividing the ASSIGNED_TO relation by it to derive a unary containing the required employee nambers The relational algebra expression for this is, ASSIGNED_TO + Xprojece (PROJECT) (a) DIVIDE requires the use of one single columa table and one two-column table. Using the above question, we note that ) 1 is divided by r2_ +1 and £2 both contains ‘Time! bat do not share Process’ (i) To be included in the result (r1 +12), a value in the unshared column ‘Process must be associated (in the dividing 12) with cvery value in rl (ii) The only value associated with both 3 and 4 SP The correct answer 1s Provess P 8.60 (a) Since a relation 8 a set, any duplicate rows are eliminated, The result of M(Ctiew sane, Cert piny(Cliznt) has 7 tuples since (Mumbai, 400086) is repeated Similarly Tectient raney(Depositor) has 4 rows, “Therefore, the Cartesian Produet operation (X) results in 7 4 = 28 teples $61 (a) “The result of the above qty will be S| oe oe S| | "Bhavna | Bangalore | 613432 [$101 | 1000 | Bhavna | Bangalore | 613432 |§ 251| 1900 | 8.62 (a) S53 3.54 (Clieat <4 Account bt Depositor) gives the list cf all client having, an account in the bank Mecca nam (Getatance = “sor (Client oc Account [>< Depositor)) gives the list of all licnts having balance more than 1000 and option {a) satisfies the required query. {d) Whon Insert into 'S' operation will take place there will be inconsistency in the data base, since it has a foreign key which refers to the primary key of R. When delete from 'R’ take place it ‘will cause violation because since it's primary Key is the foreign key for 'S' so there will be inconsistency in the database, Before deleting from R, the corresponding rows from S has to be deleted. The other options (A) and (D) will not cause such problem. (a) Here the values of selection conditions C, # C2 (they may not be equal) Therefore it is not equivalent. The other three quory transformation are equivalentccc S55 $.56 $57 5.58 3.59 (e) cof ea given eed! > e3b 30) cof eof 30) alsoes -+ ec > (4) esd +6) ee — abede s+ e¢ is key for 'R'. (e) The 'n' operator in tuple calculus will have same effect as the ‘A’ intersection operator in relational algebra. (c) ‘The above statement can F> represented using the following, expression. sumatary(employee) is a relation with a single a single row with a numeral value corresponding to the sum of all the salaries of all employees working at the department. ‘The result of this que attribute, eontaini (d) To express all the vertices we use Project ‘operator ‘n’ and to select particular value we specify some predicate or conditions of selection which is not possible for the above problem rather it will be very complicated, In other three cases it is possible to give particular concltions for selection operator. (c,d) ‘The above expression is unsafe, because it allows yalues in the result that are not in the domain of the expression. 16, {t| XteR))} $.60 5.41 $.62 $63 S64 In the expression (d) (eSueRy (HAL = u [A] 4 aseR; GIA = s [Alt Hence, the 24 part (seRz) implies s does not exist in Rp, Since all relations are finite, an infinite n0, of values for $ does not appear in '. Thus. xt is not possible, in general, to test the second part of the formula, without considering an infinite no. of potential values for (e) (4 rea 2) = (oy (E)) P4o Ea when 9 1s condition oaly on attributes of Ey () 63, (E1>49E2) = Ex>4y(oq, (E2)) when Qo is condition only on attributes of Ep It distributes when all the attributes im selection condition 0g involve only the attributes of one of expressions (E,) being joined. (c) When Relational Calculus is added with some additional properties (restriction) itis called safe Relational calculus which is equivalent to Relational algebra (a) RA. B.C) R,@. E) C is the forsign key in Ry and referring to primary’ key to Ry, D is the primary key of R In relation R column D values are subset of Ry column C. Because of integrity constraints. So Tln(R2) ~ [c(Ry) 1s empty. (a) ‘The minimum and maximum number of tuples in _g:ven natural join operation is minimum of these min (120, 8) = 8. (a) Superclass hide the information to the outside world so cach id of an employes must be implemented in superclass Name is also an important attribute of employse so must be implemented in the superclass Salary of an employee differ by category and department so it is a function that must be implemented in subclassIwrropuction to DBMAS ano Retarionat Monet $.65 8.66 8.67 $.68 5.69 (d) The given query computes the names of girl students with more marks than all the boy students. {c) The highest degree of concurrency in a relaticnal database is provided by Row level locking. (c) Given R=(A,B C.D) = tec t= Ra nit) sentn All tuples in r is also tuples of sor & +. (d) R=-(A.B. C.D, EW) FD ={A->B, BC ->D,E-+ C.D >A} The candidate keys of R 1s AEH, BEH, DEH because all of these generates the {A. B.C, D, EH} R, key b Ry key ab E key a E, key b Ry and E, can merge because keys are same Hence, One table for El, One table for ‘One table for R2; Total 3. Tables Remember that only one to many relationship can be represented with entity set from one's side, because cach entity set can be associated with at most one entity of another set. (c) If @, 4) is deleted then 2 is the primary key but in (5, 2) and (7, 2) 2 is the forvign key so these must be deleted. The primary key for (5, 2) and (7, 2) is 5 and 7 respectively but in (9, 5) 5 is the foreign key so it 18 also deleted. (c) ‘There are two plans mainly plan 1 and plan 2. In plan 1 first of all the records pair is selected then they are joined but in plan 2 all paid records are joined first and then the records are checked “The seck time of disk is 4'mS and data transfer rate is 300 MB/S So if x = 5000 then plan 1 executes faster than plan 2 for all databases {c) Step 1: Tyutdl Sue tnate(studinfo)) Selects the females from studInfo table and projects their studld Step 2: Tate df0))*T yt 20) Provides only the "coursele" from “enroll” table whose "studld" are projected Step 3: THecetdl Tete aoc ee Stdlnfo))* Le gmeteFOl) enroll) Reduces the sclected."courscld" from "courscld” of enroll, i¢., providing the remaining "coursed", i.c., of male students and projecte them. Hence, result: is: courses in which only male students are enrolled (c) The quory fenamo | employee(e) A (¥™) [-sempolyee(x) v x supervisorName # ¢.name Vv xsex = "male"]} computes the name of employees with no immediate female subordinates.5.74 8.75 $76 {a) Here we require only two tables to represent M, N, P, RI, R2, because there are two relations RI and R2 are two relation, In relation tables, we ean include fields of M, N and P Relation R1 is one to many from P to M and R2 is one to many from P to N. But N is a weak cntity. There is also total participation of tables in relations so we can merge M and P as one table and P and N as other table, (a) The correct attribute set is (M1, M2, M3, P1} Since, merging P and M into one result is non- normalised talbes as P2 depends only on one of the key valucs PL, so, it has to be removed. This can be done without the loss of information as PI and P2 are also in other table which has attributes P1, P2, NI and N2 having primary key as PI. So, attribute set for tables are: (NI, M2, M3, PI} and {P1, P2, NI, N2} (c) Rand § are two relations RIP, Q, Ri, Ro, Ra) SP, Q.S,. 82) 1. TI(Re4S) : The query join the relation R and S then project the column P only IL Tp(R) Ea [Ip(S) : The query project the column P from R and § then join these Projected column so this produces same result as in I IIL. Tipo) Mpg (S)) The given query project separately the column P and Q in both relations R and S_ The intersection produces only those column which are comnon in both and finally projection produces the result as the column P so this query is also equivalent to | and 1 DatNORMALIZATION Ql Q2 LEVEL-1 Indicate which of the following statements are true! A relation database which is in 3NF may still have undesirable data redundancy because there may exist: (a) transitive functional dependencies (b) non-trivial functional dependencies involving prime attributes on the right side (©) non-trivial functional dependencies involving prime attributes only on the left side (@) non-trivial functional dependencies involving only prime attributes Let us consider the following declaration R represents n entity and the set X, Y of attributes represents the key of R, then if R represents a one-to-one relationship between ‘entity E, and E; then which of the following is correct” (a) The FD Y - X will hold only (b) The FD X > Y will hold only (©) (@) and (b) hold together (@) Neither (a) nor (b) holds Q4 Qs Given two sets of Function Dependencies (FDs) F and G over a relation scheme R, if G covers F and if no proper subset G(G’ < G) covers F, then G is called (a) determinant cover (b) nonredundant cover (c) nondeterminant cover (4) redundant cover Spurious tuples are (a) the multiple entries with same value (b) the tuples with null values, that exist in the original relation (c) the tuples with null values, that did not exist in the original relations (@) the tuples with mull values If F is a set of FDs ona relation scheme R, then F’, the closure of F, is the smallest set of FDs such that F* = F and no FD can be derived from F by using the interference axioms that are not contained in F* (a) it is assumed to contain all the attributes that appear in F (b) whole statement is incorrect (c) F! ie. closure is not possible (@) none of these(3223 $$ {_Darasasis Qs Qz Qs as Qo A primary key if combined with a foreign key creates (a) many-to-many relationship besween tables that connect them (b) network model between the tables that connect thom the {c) parent child relationship between the tables that connect them (@) sone of the above Manager's salary details are hidden from the employee. This is (a) extemal level data hiding (b) physical level data hiding (c) conceptual level data hiding (a) none of the above Consider the following set of functional dependencies on the scheme (A, B.C), A+ BC Boc A->B AB-+C ‘The canonical cover for this set is (a) A-> Band B > (b) A-> BC and AB > C (c) A> BC and A> B (@) A-> BC and B > C LEVEL-2 Which of the following statement is correct? (a) FEY oXitX cY (b) FEEX > YiffX' CY (o) FEY > Xaff¥ cx @FEX>YvifYoXx Let R = (A, B,C, D) and F = {A> B, A> C, BC ~> D} then which of the following is correct?” @FEB+D () FE ASB ( FEA>D (d) None of these Qu Qi2 Q.i3 Let R= (A, B. F= {A+B A then A-> Dis in F D) and + C, BC > D} Then which of the following 1s correct” (a) A—> Dis in F* is always true (>) A> D is in F° but, for that D> A must be satisfied (©) A-> Dis not m F (4) None of these Consider the following relation scheme pertaining to the information about a student maintained by an university STDINF (Name, Course, Phone No, Major, Prof, Grade) then this scheme 18 decomposed into the relation schemes STUDENT (Name, Phone No, Majer. Grade) COURSE (Course. Prof] Then select the cormet statement, if it is bad «éeomposition {a) Due to loss of information (b) Due to redundancy and update anomaly (e) The above decomposition is not at all bad (d) Both (a) and (b) ‘A decomposition of relation scheme R <(X, ¥. 1), F> into Ry AX, Y), Fr? and Ry <(X. 2), is lossless if (a) the common attnbutes X of either Ry or R; form a superkey of atleast one of these 1 ¢ X-+YorX 9% (b) the common attributes X of Ry and R> form a superkoy of atleast ono of these ie. X -> YorX 97 {e) every functional dependeney in R- can be logically derived from the fuetional dependencies either of Ry and R; but not both (a) every functional dependency in R can be logically derived from the _fanetional dependencies of Ry and R»Ql Qs Ql6b Consider the following relation R Name | Student | Course | ae Mahesh 22 VB60 A | ' - V sunj [2a [aaval B Ketan 38 REE T & ' - | Ketki net | D ‘Then identify the incorrect statement about relation R. 1, The relation candidate keys I The relation R is in 3NF IIL The relation R is in BCNF TV The relation R has a disadvantage of repetition of data @ Iv (b) OT ) 0 @ ‘A decomposition of a relation scheme R <5, F> into the relation schemes R,(I 4 T1,,(R) then such a. decomposition is called (a) dependency preserving (&) lossy (c) Neither (a) nor {b) (a) Beth (a) and (b) Consider the following relationship fd Department | Chaiiperson then which of the following statement is correct? (a) Name is the key and Chairperson is fully functional dependent on te key (b) Name ond Department are the keys and Chairperson is fully functional dependent on the key R_ has two overlapping Name. (ec) Name 1s the key and Chairperson is transitively dependent on the key (d) Name and Department are the keys and Chairperson is transitively dependent on the keys Q17 Q18 Ql? Consider the following relation R(A, B, C,-D, E) a [os fe [a [a = iri] oii) -loesste bake 6 a |» fle lala! “4 oe Pale @ |e |e | |e 4 cs Which of the following statement is correct? 1 For the relation R, the FD B + CD is satisfied and by projectivity, B + C and B >D IL_ For the relation R, the FD B+ € and C > D are satisfied and hence by transitivity, B 3D @ i @i” (c) Both I and Il (@) Neither T nor Tt Given the relation RA, B, €) and the sot F = {AB > C, B > D, D > B} of functional dependencies, then the candidate key/s of the relation is/are? (a) AB, BD (0) AB, AD (©) AD (@) AB ‘The highest normal form of the relation R(A, B, C, D) if the following FDs are satisfied by relation F = {AB + D, AC > BD, B-> C} (2) BCNF (b) SNF (c) 2NF INF20 Consider the relation scheme of the relation @.23 SCHEDULE shown below, What is the highest normal form of this relation? Q2i Q22 SCHEDULE(Stud_ID, Class, Stad_Name, Stud_Major, Class Time, Building Room, Instructor) Assume the following functional dependencies Stu@_ID > Stud Name Stud ID > Stud_Major Class -> Class_Time Class + Building Room Class Instructor (a) BONE (b) 3NF (c) 2NF (@ INF Given the following relation instant Po Per 1 4 2 i 5 3 1 6 3 (3 2 | Which of the following functional dependencies are satisfied by the instance? (a) PR-+ Qand Q > P (b) QR > P and P +R (c) QR > P and Q >R (@ PQ Rand R+OQ LEVEL-3. Consider the following declaration F = {W- X, X > ¥, W > XY) thon which, of the following statement is correct about F 1 F’ includes W > W. X > X.Y >Y II. F* includes W -> X, X > Y, W > XY IIL, F* insludes W > ¥, WZ (@) 1,0, Mt (b) OL 11 it @Lm Q24 Q25 O26 Let's assume that F= {A> BC. CD +E, E> C, D > AEH, ABH -> BD, DH -+ BC} then (CD)* under {F ~ (CD ~+ E)} is equal to (a) ABCDEH (0) BCDEH (©) ABCEH (a) ABCD If F={ABC, CD 9E, EC, D-+ AEH, ABH -> BD, DH ~ BC} then canonical cover for F is (@) [A>BA>C E> C,D+H ACH DY 6) (ASBE2C.D>AD 3H AHS Dd} (©) (AB ASCE +CDOADOE D-> HAH > D} (a) None of these Consider the relation scheme, <(ABCD), {AB > C, € = A}> the decomposition obtained finally by above relation scheme is in (a) BCNF decomposition which is dependency preserving, BCNF decomposition dependency. preserving 3NF decomposition which is dependency preserving, (a) 3NF decomposition which is not dependency preserving, Find the candidate key for the relation R(A, B, C.D, F) A>D b) which is not (co) BOEF Esc (a) BE (b) AB (©) DE (@ CDQ27 Q.28 ‘The BCNF decomposition of the relation scheme SHIPPING with the following set of functional dependencies SHIPPING (Ship. Capacity. Date, Cargo, Value) Ship —> Capacity ShipDate > Cargo CargoCapacity -> Value is (a) Ry (Cargo, Capacity, Value) with the FD CargoCapacity > Value R, (Ship, Capacity) with the FD Ship —> Capacity Ry (Ship, Date, Cargo) with the FD ShipDate -> Cargo (b) Ry Ghip, Capacity) with the FD Ship —+ Capacity R, (Ship, Date, Cargo, Value) with the FD ShipDate + Cargo (e) Both (a) and (b) (€) Neither (a) nor (b) Using the candidate key obtained in the above question, normalize the relation R(A, B,C, D, B, F) to 2NF with functional dependencies A> D, Bo» EF (Assume R is in INF) @ RABE) R, DE, F) RD, ©) ©) R, (AB, D) R, (B,C, D) REF (©) Ri (A, B,D) REF R, (A, B) MRABO RB. E, F) R; (A, D) Q.29 Q.30 Q31 Consider the following functional dependencies in a database D+A ASE NOR RN esi, Cor RO+G ‘The relation (R, N, D, A) is (a) in BCNF (b) in 3NF but not in BONF (©) in 2NF but not in 3NF (@) none of these GATE QUESTIONS For a database relation R (a, b, ¢, d), where the domains of a, b, ¢, d include only atomic values, only the following functional dependencies and those that can be inferred from them hold ate bod This relation is (GATE 1997) [2-Marks] (a) in first normal form but not in second normal form (b) in second normal form but not in third normal form (©) in third normal form (@) none of the above Which of normal form is considered adequate for normal relational database design? [GATE 1998] (1-Mark] (a) 2.NF () 5 NF (©) 4 NE @) NE—I— A jAOH——__— hens Q32 Q33 Q34 Consider the schema R = (S T U V) and the dependencies § > T, T+ U, U > V and V+ S. Let R= (RI and R2) be a decomposition such that R19 R2 = 6 The decomposition is: IGATE 1999] [2-Marks] {a) not in 2NF (b) in 2NF but not in 3NF (6) in 3NF but not in 2 NF (@) in both 2NF and 3. NE Given the following relation instance Which of the following functional dependencies are satisfied by the instance? [GATE 2000] [2-Marks| fa) XY > Zand ZY (b) YZ > X and Y¥ > Z () YZ» X and X > Z (a) XZ >Y¥and ¥>X Consider a schema R(A. B, C, D) and functional dependencies A —» B and C -» D. Then the decomposition of R into Ry(AB) and Ro(CD) is [GATE 2001] U-Mark] (a) dependency prosorving and lossless join (b) lossless join but not dependeney preserving (c) dependency preserving but not lossless join (d) not dependency preserving and not lossless pin Q.35 Q36 Q37 Relation R with an associated set of functional dependencies F. is decomposed into BCNF The redundancy (arising out-of functional dependencies) in the resulting set of relation is [GATE 2002] (a) Zero [1-Mart] (b) More than zero but less than that of an equivalent 3NF decomposition (c) Proportional to the size of F* (@ Indeterminate Relation R is decomposed using a set of fanctional depondencies F, and relation S is decomposed using another set of functional dependencies, G. Onc decomposition is definitely BCNF, the other is definitely 3NF, but it is not known which is which To make a guarantecd identification, which one of the following tests should be used on the decomposition? (Assume that the clesures of F and G are available) [GATE 2002] [2-Marks] (a) Dependency — preservation () Lossless — join (c) BCNF definition (8) SNF definition Consider the following, functional dependencies 1m a database: Date of Birth -+ Age Age > Eligibility Name -> Roll Number Roll_ number ~» Name Course number -» Course_name Course_number -> Instructor (Roll_ number, Course_aumber) > Grade ‘The relation (Roll_number. Name, Date_of birth, Age) is IGATE, 2003} [2-Marks} {a) n second normal normal form but not in third omnal fort (6) in third but not in BONF (c) in BONE (d) in none of the above(Geowsateaton }-—————_—_—————___(i) Q.38 Q39 Q.40 ‘The relation scheme Student Performance (name, courseNo, rollNo, grade) has the following fimetional dependencies name, courseNo > grade Roll No., cours:No > grade name -+ rollNo rollNo The highest normal form of this relation scheme is IGATE 2004] [2-Marks| > name (a) 2. NF (b) 3 NF (©) BCNF (6) 4.NF A relation Empétl is defined with attribute empoode (unique), name, strect, city, state and pincode. For any pincode, there 1s only one eity and state. Also, for any given street, city and. state, there is just one pinzode, In normalization terms, Empdtl is a relation in (IT-GATE 2004] [2-Marks] (a) INF only (b) 2NF and hence also in INF (©) 3NF and hence also in 2NF and INF (@) BCNF and hence also in 3NF, 2NF and INF A table has ficlds Fl, F2, F3, following functional dependencies FI>F3 F294 — (FLF2) In terms of Normalization, this table is m IIT-GATE 2005] {1 Mark] Pa, FS with the > FS (a) | NF (b) 2. NE (o) 3.NE (@) None of these Q4l Q42 Q43 Which one of the following statements about sacral forms is FALSE? IGATE 2005] [-Mark] (@) BCNF is stricter than 3NF (b) Loss less, dependency-preserving decomposition into NF is always possible (c) Loss less, dependency-preserving docompesition into BCNF is always possible (@) Any relation with two attributes is BCNF The following functional dependencies are given AB > CD. AF + D, DE 3, C3 GF > EGA Which one of the false” following options is IGATE 2006 [2-Marks} (a) (CF}* = (ACDEFG} (b) {BG} = {ABCDG) (©) {AF}" = (ACDEFG} (a) (AB}' = {ABCDFG) Which one of the following statement is FALSE? [GATE 2007] [2-Marks] (a) Any relation with two attributes is in BCNF (b) A relation in which every key has only one attribute is in 2NF (c) A prime attribute can be transitively dependent on a key in 3NF relation (@) A prime auribute can be transitively dependent on a key in a BCNF relation.Qa Q4s Consider the following relational schemes for a library database Book(Title, Author, Catalog, no, Publisher, Year, Price) Colleetion(Title, Author, Catalog_no} Within the following functional dependencies I. Tite, Author —> Catalog, ne Il. Catalog no —> Title Author Publisher Year IIL, Publisher Title Year > Price ‘Assume {Author, Title} is tho key for both schemes: Which of the following statements is true? [GATE 2008] [2-Marks] (a) Both Book and Collection BCNF (b) Both Book and Collection are in 3NF aly (©) Book is in 2NF and Collection is in 3NF (@ Both Book and Collection are in 2NF only Common Bata For Questions 45 to 46: Consider the following relational schema: ‘Suppliers(sid:integer,sname: street:string) are in string, city’string, Parts(pid.imtewer, pname'string, color:string) Catalog(sid:integor, pidtinteger, cost real) Consider the following relational query o the above database: SELECT S name FROM Supphers $ WHERE S.sid NOT IN (SELECT C sid FROM Catalog C WHERE C pid NOT IN (SELECT Pid FROM Parts P WHERE P.color>'BLUE)) Ab Assume that relations corresponding to the above schema are not empty. Which one of the following is the correct interpretation of the [GATE 2009] 2 Marks} (a) Find the names of all supplies who have supplied 2 non~blue part (b) Find the name of all supplies who have not supplied a nom-blue part (c) Find the name of all supplies who have supplied only blue part (b) Find the name of all supplies who have not supplied only blue part Assume that, m the suppliers relation above, each supplier and each street within a city has a unique name, and (name, city) forms a candidate key. No other functional dependencies are implied other than those implied by primary and candidate keys Which one of the following is TRUE about the above schema? [GATE 2009] [2 Marks} (a) The schema is in BCNF (b) The schema is in SNF but not in BONF (©) Tho schoma is in 2NF but not in INF (@ The schema is not in 2NF