CSE255 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 06269-3155 steve@engr.uconn.edu http://www.engr.uconn.edu/~steve (860) 486 - 4818

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!

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.

Chapter 14 Covered Topics Include … Slides 46-107 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

Chapters 17 and 18 Chapter 17 - System Catalog What is it? How is it Used? Chapter 18 - Query Optimization in RDBMS High-level Query Optimization (Algebraic) NO QUESTIONS ON Low-level Query Optimization (Cost-based) Slides 15-20 MBDS Slides 93-113

Chapters 19 and 20 Chapter 19 - Transaction Processing Concurrency Control Data Consistency Problems Schedules and Serializability Chapter 20 - 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

Chapters 21 and 22 Chapter 21: Database Recovery Alternative UNDO/REDO Approaches Checkpointing and Shadow Paging Chapter 22: Database Security Security Glossary and Important Security Concepts DAC, MAC, Cryptography Security in Statistical Databases NO QUESTIONS ON: Java Security/OS Security/RBAC

Chapters 24 and 27 Chapter 24: Distributed DBMS Goals, Objectives, and Approaches of DDBMS Fragmentation, Replication, Federation Chapter 27: Web-Based DB Architectures Role of Web in Architecture, Usage, Interoperation Different DB Interaction Styles Long-Term/Open Issues No questions on Data Mining (Chapter 26)

Possible Questions Open Notes and Open Book 6-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) Focus on UConn-XCHG/Applicability of Concepts Know your Algorithms and Constructs Show All Work to Receive Partial (Any) Credit Do Not Jump to Final Answer Avoid Run-on Explanations