CS 3335Final ExamDecember 10, 2010100 points Name:1. (30)One of the challenges for LampQuest is to determine if a hero had slain all of the monstersrequired for a quest. Note that a quest can require different monsters to be slain, andit can require more than one instance of a monster to b e killed. Furthermore, a heroonly gets credit for the monsters killed after the quest starts. Write a query to returnall of the quest-hero pairs such that the hero has slain all of the monsters required bythe quest. You may create views to simplify the query, but they must be defined as partof your answer. Your query and views must be well documented. Use the back of thispage if needed.2. Consedir the relation R = (A, B, C, D, E) with FDs F = {AB → CD, D E → A, E → D}.(a) (10)Find the cannonical cover for F.(b) (10)Using the algorithm from class, find the 3 NFLJDP decomposition for R with F.(c) (10)Using the algorithm from class, find the BCNFLJ decomposition for R with FPage 2Multiple ChoicePut the correct letter in the blank.3. (2)In a B+-tree, the last pointer in non-leaf node points to (a) the next node(b) the subtree with values greater than or equal to the last key value (c) nothing; it isalways null (d) the physical location of the row with the last key value (e) none of theabove4. (2)In a B+-tree, when a non-leaf node splits (a) the least value of the greatesthalf is copied to the parent (b) the value inserted into the database is copied to the parent(c) a new root node is created (d) the height o f the tree increases (e) none of the above5. (2)The relational algebra operator that corresponds to the FROM clause inSQL is (a) Π ( b) σ (c) ρ (d) × (e) none of the above6. (2)Which of the following relational algrebra experessions are not equivalentto σp1∧p2(R) (a) σp1(R) ⊲⊳ σp2(R) (b) σp1(R)Tσp2(R) (c) σp1(σp2(R)) (d) σp2(σp1(R))(e) all of the above are equivalent7. (2)The SQL isolation level Read Committed (a) allows dirty writes (b) allowsunrecoverable schedules (c) allows dirty reads (d) all of the above (e) none of the above8. (2)If the 3-nn of user u rated item i as 1,1,4 (on a 1- 5 scale), the predictionfor user u on item i is (a) 1 (b) 2 (c) 4 (d) 6 (e) none of t he above9. (2)In information retrieval, the expression TF is (a ) the number of times aword appears in a document (b) the number of words in a document (c) the number ofdifferent words that appear in a document (d) the number of documents with the word(e) none of the above10. (2)Which of the following is NOT a property of the data structure used byBig Table (a) atomic (b) multi- dimensional (c) persistent (d) map (e) all of them are11. (2)If the three nearest neighbors had values 1,1,4, under classification, theprediction would be (a) 1 (b) 2 (c) 4 (d) 6 (e) none of the above12. (2)If there exists exactly one large 4-item set, there must exist (a) at least 4large 3- items sets (b) 4 items with sufficient confidence for a rule (c) at most 4 possiblerules over 4 items (d) more 5-item sets (e) none of the abovePage 313. (2)For relation R = (A, B, C, D, E) is the relation and FDs {A → BCDE, BC →A}, the highest normal form is (a) 5NF (b) 4NF (c) BCNF (d) 3NF (e) none of the above14. (2)Which of the following is not part of a three-tier web/database app (a)web server (b) database (c) application server (d) business logic (e) all of the above arepart of a three-tier web/database a pp15. (2)If A → B and B → C both hold, then by augmentation we know (a)B ⊆ A (b) AB → AC (c) A → C (d) AB → BC (e) none of the above16. (2)Given an ER diagram with a many-to-many relationship R between en-tities E1and E2such that R has no attributes (a) we should create a table for therelationship (b) we should add fo r eign keys to the tables for E1and E2but not createa table for R (c) we should ignore R completely (d) we should create one table with E1and E2combined (e) none of the above17. (2)Within the LampQuest game, an example of a derived attribute would be(a) the level of a quest (b) the level of the men at arms (c) the level required to use anitem (d) t he level of t he hero (e) none of the above18. (2)When inserting into a table (a) you must give every at tr ibute a value (b)you must start a transaction if using a query to insert multiple rows (c) you must notviolate a consistency constraint (d) all o f the above (e) none of the above19. (2)Within JDBC, the ResultSet method next() (a) returns the number ofrows returned by the query (b) must be called before the first row can be accessed (c)always returns true the first time it is called ( d) when called multiple times, returns thesame value if no data is retrieved from the query (e) none of the above20. (2)Which of the following is NOT true for the SQL o perator EXCEPT (a) isnot supported by MySQL ( b) requires union compatible attributes (c) is similar to theset difference operator (d) is used in subset queries (e) all of the a bove are true21. (2)Which of the following is not an SQL aggregate operator (a) COUNT (b)AVG (c) MAX (d) SUM (e) all of them are22. (2)If LampQuest allowed users to upload pictures of their heroes, the bestdata typ e to store the pictures would be (a) varchar (b) bit string (c) blob (d) clob (e)none of the abovePage