Presentation on theme: "FE.1 CSE 4701 CSE4701 Final Exam Advice and Hints Prof. Steven A. Demurjian, Sr. Computer Science & Engineering Department The University of Connecticut."— Presentation transcript:
FE.1 CSE 4701 CSE4701 Final Exam Advice and Hints Prof. Steven A. Demurjian, Sr. Computer Science & Engineering Department The University of Connecticut 191 Auditorium Road, Box U-155 Storrs, CT (860)
FE.2 CSE 4701 Hints for Taking Exam Read the Questions Carefully! Ask Questions if you are Confused! Answer Questions in Any Order Organized to fit on minimum number of pages Answer “Easiest” questions for you! Assess Points per Time Unit 120 minutes = 120 points 20 points = 20 minutes For Essay/Short Answer Questions - Length Answer Matches Points 5 points = 1/4 page = 3 or 4 sentences 30 points - if 1/4 page - likely few points! Exam Designed to be Longer than 120 Minutes!
FE.3 CSE 4701 Hints for Taking Exam Don't Define Concepts E.G., Ask About Concept X, Don't Explain Concept X, Just Answer the Question and I'll Know If You Know Concept X Don't Panic, Read and Review Course Materials Prior to Exam! Don't Be Afraid to Not Answer a Question 60% Correct for 100 Points = 60 Points 90% Correct F0r 80 Points = 72 Points Partial Credit Is the Norm If I Ask You to Pick and Analyze a Concept - for a 5 Pt Problem You Get 1 for the Concept and 4 for the Analysis.
FE.4 CSE 4701 Chapter 14 5e, 15 & 16 6e - Func Depend: Covered Topics Include … Slides in cse255chap14.pps First, Second, and Third Normal Forms Understanding the Objectives of Normalization Process No Questions on … FDs - but you must understand what FDs in Order to Answer Questions on Normal Forms
FE.5 CSE 4701 Chapters 17 & 18 5e, 19 6e Chapter 17 - System Catalog What is it? How is it Used? Chapter e, 19 6e - Query Optimization in RDBMS High-level Query Optimization (Algebraic) Low-level Query Optimization (Cost-based) Implementing JOINs, SELECTs, etc.
FE.6 CSE 4701 Chapters 19 & 20 5e, 21 & 22 6e – TP/CC Chapter 19 & 20 5e - Transaction Processing Concurrency Control Data Consistency Problems Schedules and Serializability Chapter 21 & 22 6e - Concurrency Control Three Different Locking-Based Algorithms 2 Phase Protocol Deadlock and Livelock Optimistic Concurrency Control FOCUS ON NOTES RATHER THAN TEXTBOOK NO QUESTIONS ON: OS Synchronization
FE.7 CSE 4701 Chapters 21 5e, 22 6e and 22 5e, 23 6e Chapter 21 5e, 22 6e : Database Recovery Alternative UNDO/REDO Approaches Checkpointing and Shadow Paging Chapter 22 5e, 23 6e : Database Security Security Glossary and Important Security Concepts DAC, MAC, RBAC Cryptography Security in Statistical Databases NO QUESTIONS ON: Java Security/OS Security
FE.8 CSE 4701 Chapters 24, 26 & 27 5e, 26, 28 & 29, 6e Chapter 24 5e, 26 6e: Distributed DBMS Goals, Objectives, and Approaches of DDBMS Fragmentation, Replication, Federation Chapter 26 5e, 28 6e: Data Mining Mining and Warehousing Querying Differences from DB Chapter 27 5e, 29 6e: Web-Based DB Architectures Role of Web in Architecture, Usage, Interoperation Different DB Interaction Styles Long-Term/Open Issues
FE.9 CSE 4701 Possible Questions Open Notes, Book, and Web 8 Total Questions - Follow Instructions - Possibilities Constructive and Algorithm Questions Normalization, QO, PCC (Alg. 2 and 3), OCC (Alg. 4) Design Questions Related to Recovery, Security, Concurrency DB Architectures (DDBMS, Web) DB Querying (Traditional, Programmatic, Mining) Applicability to UConnJobSearch.com Know your Algorithms and Constructs Show All Work to Receive Partial (Any) Credit Do Not Jump to Final Answer Avoid Run-on Explanations
FE.10 CSE 4701 Web Sources for Final Exam Final Exam Advice: PPT, JobSearchPlus and BBALL Handouts hwww.engr.uconn.edu/~steve/Cse4701/UConnJobSearchPlus.docx NEW Sample QO/CC Problems: PPTX NEW Sample QO/CC Solutions: PPTX Normalization Problems/Solutions: PPTX