Transcript PPT

CSE4701 Final Exam Advice and Hints
CSE
4701
Prof. Steven A. Demurjian, Sr.
Computer Science & Engineering Department
The University of Connecticut
191 Auditorium Road, Box U-155
Storrs, CT 06269-3155
[email protected]
http://www.engr.uconn.edu/~steve
(860) 486 - 4818
FE.1
Hints for Taking Exam

CSE

4701




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.2
Hints for Taking Exam

CSE
4701



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.3
Chapters 18, 19 6e/14, 17, 18 5e

CSE
4701


Design/Storage Concepts - Chapter 18 6e:/14 5e
 Indexes – Primary/Secondary B/B+ Trees
 Only Slides 22-50 in ENACh17and18final
System Catalog - Chapter 19 6e, 17/18 5e
 Slides 1 to 59 in cse4701chap19.pptx
 Meta Data - What is it? - How is it Used?
 Overall System Processing
Query Optimization - Chapter 19 6e, 17/18 5e
 Slides 60 to 149 in cse4701chap19.pptx
 High-level Query Optimization (Algebraic) (60-121)
 Slides122 to 149 – understand concepts w.r.t. Limiting
Data for cost-optimization and implementing joins.
 Low-level Query Optimization (Cost-based)
 Implementing JOINs, SELECTs, etc.
FE.4
Chapters 21 & 22 6e / 19 & 20 5e

CSE
4701



Chapter 21 & 22 6e /19 & 20 5e
 Transaction Processing
 Concurrency Control
 Data Consistency Problems
 Schedules and Serializability
Chapter 21 & 22 6e/19 & 20 5e
 Pessimistic Concurrency Control (PCC)
 Three Different Locking-Based Algorithms
 2 Phase Protocol
 Deadlock and Livelock
 Optimistic Concurrency Control (OCC)
FOCUS ON NOTES RATHER THAN TEXTBOOK
NO QUESTIONS ON:
 OS Synchronization (slides 3 to 14)
FE.5
Chapters 23 5e, 24 6e and 22 5e, 23 6e

CSE
4701



Chapter 23 6e, 21 5e : Database Recovery
 Alternative UNDO/REDO Approaches
 Checkpointing and Shadow Paging
Chapter 24 6e, 22 5e : Database Security
 Security Glossary and Important Security Concepts
 DAC, MAC, RBAC Cryptography
Posted PPTs for Chapters 23 and 24 have Been
Constrained/Edited to the Required Material
Both Chapters – Focus on the concepts
FE.6
Chapters 25, 6e/24, 5e

CSE
4701

Chapter 25 6e/24, 5e: Distributed
DBMS/Architectures
 Goals, Objectives, and Approaches of DDBMS
 Fragmentation, Replication, Federation
 Architecture, Usage, Interoperation
Focus on the concepts
FE.7
Possible Questions

CSE 
4701
Open Notes, Book, and Web
5-8 Total Questions - Follow Instructions Possibilities
 Constructive and Algorithm Questions
 Query Opt, PCC (Alg. 2 and 3), OCC (Alg. 4)




Design Questions Related to
 Query Optimization
 Concurrency Control
 Storage/Indexing
 Transaction Processing
 Recovery, Security
 DDBMS & DB Architectures
Show All Work to Receive Partial (Any) Credit
Do Not Jump to Final Answer
Avoid Run-on Explanations
FE.8
Web Sources for Final Exam

CSE
4701
Final Exam Advice:
PPT and BBALL Handouts



www.engr.uconn.edu/~steve/Cse4701/cse4701fexamadv.pptx
www.engr.uconn.edu/~steve/Cse4701/cse4701BBall.doc
NEW Sample QO/CC Problems (has solns too)

www.engr.uconn.edu/~steve/Cse4701/cse4701QOandCCprobs.pptx
FE.9