Computer Science 419
Database Design
Spring 1997
Tim Wahls
office: E-258K Olmsted
phone: 948-6085
email: wahls@psu.edu
ANSWERS to the Final Exam study questions are now available! See the
link at the bottom of this page.
Question 7 of the Final Exam study questions has changed (on 5/6/97).
Please update your copy of the question, as the old version was not
provable.
Final Exam
- Friday, May 9 from 2:00 to 4:30
- open book and notes
- 150 points
- approx. 50 pts comprehensive
- approx. 100 pts on new material
- comprehensive material
- notes: through VII.B. (includes Database Modification in SQL, does not
include Advanced SQL)
- text: ch. 1, 2.1 - 2.5, 2.8, 2.9.1, 2.9.3, 2.10, 3.1 - 3.2, 4.1 - 4.9,
4.11
- new material
- notes: starting with VII.C.
- text: 4.10, 4.12 - 4.14, 6.1, 6.2, 6.5, 6.6, 7.1 - 7.4, 10.1 - 10.2,
11.1 - 11.3, 11.8
- note the link to study questions at the bottom of this page
- Course Syllabus
- Course Policies
- Assignments
- Homework 1
- Homework 2
- Homework 3
- Homework 4
- Homework 5
- Homework 6
- Homework 7
- Homework 8
- Homework 9
- Homework 10
- Introduction
- Data Abstraction
- Data Models
-
Instances and Schemes
- Data Independence
- Data
Definition Language
- Data
Manipulation Language
- Database Manager
- Database Administrator
- Database Users
- DBMS Components
- The Entity-Relationship Model
- Representation of Entities and
Entity Sets
- Relationships and Relationship Sets
- Mapping Constraints
- Keys
-
Primary Keys of Relationship Sets
- Entity-Relationship Diagrams
- Reducing Entity-Relationship
Schema to Tables
- The Relational Model
- Introduction
- Relational Database
Schemes
- Keys
- Query Languages
- Relational Algebra
- Fundamental Operations of
Relational Algebra
- The Select Operation
- The Project Operation
- The Cartesian Product
Operation
- The Rename
Operation
- The Union
Operation
- The Set Difference
Operation
- Inductive Definition of
Relational Algebra Expressions
- Additional
(Non-Fundamental) Operations of Relational Algebra
- The Set Intersection
Operation
- The Natural Join Operation
- The Division Operation
- The Assignment Operation
- SQL
Hold down the shift key and click
here to download a (partial) Microsoft Access database for a
university registrar's office.
- Querying in SQL
- Joins
- Set Operations and
Duplicates
- Tuple Variables
- Predicates
- Ordering Tuples
- Aggregate Functions
- Null Values
- Nested Queries
- Expressive Power of SQL
- Database Modification in SQL
- Deletion
- Insertion
- Updates
- Views
- Updates Through
Views
- Data Definition
- Advanced SQL
- Joined Relations
- Join Types
- Join Conditions
- Embedded SQL
- Other Relational Query Languages
- Query-by-Example (QBE)
- Quel
- Integrity Constraints
- Domain Constraints
- Referential Integrity
- Testing
Referential Integrity Constraints
-
Referential Integrity in SQL
-
Functional Dependencies
- Closure of a Set of
Functional Dependencies
- Closure of
Attribute Sets
- Canonical Cover of a Set of
Functional Dependencies
- Relational Database Design
- Why Some Designs Are Bad
- Decomposition
- Dependency
Preservation
- Normalization Using Functional Dependencies
- Boyce-Codd Normal Form
- Third Normal Form
- Normalization Using Multivalued
Dependencies
-
Multivalued Dependencies
- Fourth Normal Form
-
Summary of Normalization
- File Structures
- Introduction
- B+ Trees
- Operations on B+ Trees
- B+ Tree Lookup
- B+ Tree Insertion
- B+ Tree Deletion
Exam study questions:
Disclaimer