This exam will be closed-book, closed-notes. It covers the topics described below. You will be given separate sheet that shows all the CAP database tables.
Be able to describe and recognize a superkey, candidate key, and primary key, e.g., Example 2.4.1
Nothing will be asked about relational algebra.
Going through Appendix C, "SQL Statement Syntax", (and Figure C.1) you are to be able to write out simple examples of the following - you are not required to know the full syntax, which can be quite elaborate:
In the Select statement in particular, the most important aspects that you should understand are:
You should have a solid understanding of E-R design. Most importantly, knowing how cardinality leads to only adding attributes or defining full tables.
Be able to explain and give examples of the three anomalies: Update, Delete, and Insert.
Understand how views can help to simplify queries, and how using subqueries can simplify the enclosing queries.
As before, be able to build a B-tree index by successive insertions. Describe in qualitative terms, why a broad (high fan-out) B-tree index can lead to a smaller number of disk accesses than the conventional in-memory binary tree.
Be able to discuss the transaction concept, focusing on how a system can remain consistent in the face of power failures that wipe out the CPU contents.