DOC PREVIEW
SJSU CS 157A - Final Exam Study Guide

This preview shows page 1-2-3-4-5 out of 14 pages.

Save
View full document
View full document
Premium Document
Do you want full access? Go Premium and unlock all 14 pages.
Access to all documents
Download any document
Ad free experience
View full document
Premium Document
Do you want full access? Go Premium and unlock all 14 pages.
Access to all documents
Download any document
Ad free experience
View full document
Premium Document
Do you want full access? Go Premium and unlock all 14 pages.
Access to all documents
Download any document
Ad free experience
View full document
Premium Document
Do you want full access? Go Premium and unlock all 14 pages.
Access to all documents
Download any document
Ad free experience
View full document
Premium Document
Do you want full access? Go Premium and unlock all 14 pages.
Access to all documents
Download any document
Ad free experience
Premium Document
Do you want full access? Go Premium and unlock all 14 pages.
Access to all documents
Download any document
Ad free experience

Unformatted text preview:

BookTitleAuthorCategoryShelfCopy#Important Date Information Monday, May 23rd (7:15 - 9:30)PREPARE FOR WRITING EXAMINATIONA  BCE  AD2005 Spring CS157A Final Exam Study GuideProf. Sin-Min LeeNote: Please bring 882E scantron!The exam will be comprehensive. Test material will be drawn from the text book, lectures, assignments and any supplementary material provided in class.You should review the following: - all the lecture notes - all the assigned readings (if you don't have the text book, then the lecture notes will suffice) - both midterm exams Important Date Information Monday, May 23rd (7:15 - 9:30)PREPARE FOR WRITING EXAMINATION 1. STUDY-- Read the material which the exam will cover. A. Formulate possible study questions, use any study questions made available to you. B. Arrange your material (Notes, Note cards) so that you can anticipate an answer to one or more of the study questions.2. Know the exam conditions and be prepared to meet those conditions. (Since you most likely will have limited time, select and arrange those materials which will best help you present what you know about the subject and help you show that you can control that material.3. Before writing the exam, read all the questions. Choose that question which comes closest to those you formulated on your own and which most closely relates to those materials you have studied, reviewed, and arranged.4. While writing the exam--A. Be sure to CLEARLY and CONCISELY and PRECISELY answer the question. B. Make sure the discussion subsequent to your answer follows clearly from your answer:Your topic sentences should relate back to your answer. Your topic sentences should be supported by CLEAR, SPECIFIC references to your materials (i.e., your sources).C. Make sure you have a conclusion with summarizes the key points of your answer and offers some insight as to what you learned from writing on the question.D. Try to finish in time to edit (proofread) your answer for the most obvious problems. Or, try to edit those problems as you go. :Topics of the exam.1. Basic motivation and database terminology2. Entity-relationship model and E/R diagrams o Entity sets, relationship sets, attributes, keys, roles o Multiplicity of relationship sets (one-to-one, one-to-many, etc.) o Weak entity sets o Subclasses ("isa" relationships) 3. Relational model o Relations (tables), attributes (columns), tuples (rows) o Schema versus instance o Keys, null values o Translating E/R designs to relations 4.Relational DB, SQL, and Views 5.Relational database design o Functional dependencies (FD's): motivation, definitions, rules o Closure of attribute set with respect to FD's o Design flaws: redundancy, update & deletion anomalies o Boyce-Codd Normal Form (BCNF): motivation, definition, decompositionalgorithm o Multivalued dependencies (MVDs): motivation, definitions, rules o Fourth Normal Form (4NF): motivation, definition, decomposition algorithm 6.Relational algebra and relational calculuso Basic operators: select, project, Cartesian product, union, difference, rename o Abbreviations: natural join, theta join, intersection o relational algebra 7. Object-oriented databases and data miningSample Revision Problems:1. Let R be a relvar of degree n. What is the maxium number of functionaldependencies R can possibly satisfy (trivial as well as nontrivial)?2. What does it mean to say that Armstrong’s inference rules are sound? Complete?3. Prove the reflexivity, augmentation, and transitivity rules, assuming only the basicdefinition of functional dependence.4. Define (a) the closure of a set of FDs; (b) the closure of a set of attributes under a setof FDs.5. Relvar R{ A, B, C, D, E, F, G} satisfies the following FDs:A BBC DEAEF GCompute the closure {A, C} under this set of FDs. Is the FDACF  DG implied bythis set?6. What does it mean to say that two sets S1 and S2 of FD are equivalent?7. What does it mean to say that a set of FDs is irreducible?8. Here are two sets of FDs for a relvar R{A, B, C, D, E}. Are they equivalent? 1. A B AB C D AC D E 2. A BC D AE9. Relvar R{ A, B, C, D, E, F} satisfies the following FDs: AB  C C  A BC  D ACD B BE  C CE  FA CF  BD D  EF Find an irreducible equvalent for this set of FDs.10. A relvar TIMETABLE is defined with the following attributes:D Day of the week (1 to 5)P Period within day (1 to 8)C Classroom numberT Teacher name L Lsson nameThe tuple { D:d, P:p, C:c, T:t, L:l}appears in this relvar if and only if at time { D:d, P:p}lesson l is taught by teacher t in classroom c. You can assume that lessons are one periodin duration and that every lesson has a name that is unique with respect to all lessonstaught in the week. What functional dpendencies hold in this relvar? What are thecandidate key?11 Relvar R{ A, B, C, D, E, F, G, H, I, J} satisfies the following FDs: ABD E AB  G B  F C  J CJ  I G  H . Is this an irreducible.12. Suppose that we decompose the schema R = (A ,B, C, D, E) into (A, B, C) (A, D, E).Show that this decomposition is a looseless-join decomposition if the following set F offunctional dependencies holds: A  BC CD  E B  D E  A13. Show that the following decomposition of schema of Exercise.1 is not a looseless-join decomposition: (A, B, C) (C, D, E).Hint : Give an example of a relation r on schema R such that - A, B, C ( r ) - - C, D, E ( r ) - r14. Use the definition of multivalued dependency to argue that each of the following axioms is sound:(a) The complementation rule.(b) The multivalued argumentation rule(c) The multivalued transitivity rule.(d) The difference rule.15. Use the definitions of multivalued dependency and functional dependency to show the soundness of the replication rule.16. Show that the coalescence rule is sound. ( Hint: Apply the definition of - -- - to a pair of tuples t1 and t2 such that t1 [-] = t2 [-]. Observe that since - - - = -, if two tuples have the same value on R - -, then they have the same value on - .)17. Let R = (A, B, C, D, E ), and let M be the


View Full Document

SJSU CS 157A - Final Exam Study Guide

Documents in this Course
SQL

SQL

18 pages

Lecture

Lecture

44 pages

Chapter 1

Chapter 1

56 pages

E-R Model

E-R Model

16 pages

Lecture

Lecture

48 pages

SQL

SQL

15 pages

SQL

SQL

26 pages

Lossless

Lossless

26 pages

SQL

SQL

16 pages

Final 3

Final 3

90 pages

Lecture 3

Lecture 3

22 pages

SQL

SQL

25 pages

Load more
Download Final Exam Study Guide
Our administrator received your request to download this document. We will send you the file to your email shortly.
Loading Unlocking...
Login

Join to view Final Exam Study Guide and access 3M+ class-specific study document.

or
We will never post anything without your permission.
Don't have an account?
Sign Up

Join to view Final Exam Study Guide 2 2 and access 3M+ class-specific study document.

or

By creating an account you agree to our Privacy Policy and Terms Of Use

Already a member?