Delete CT3532 exam materials

third/semester1/CT3532: Database Systems II/exam_notes.txt

@@ -1,37 +0,0 @@
-- 4 questions, do 3
-- same type of questions as previous years
-- overlap in terms of style with exercise sheets
-- most questions have 3 parts with different marks
-
-1. question 1: design (first topic covered)
-    a) functional dependencies minimal cover sets (problem based)
-    b) normalisation to BCNF (discursive/descriptive)
-    c) denormalisation (discursive/descriptive)
-    
-    - key things to know in general:
-        - functional dependency
-        - axioms to generate new functional dependencies 
-        - minimal cover sets
-        - normal forms
-            - redundancy / denormalisation
-
-2. question 2: transactions
-    a) discuss one of problems (only 3 (think lost update problem etc not sure)) (supposedly easy)
-    b) concurrency control protocol to apply to above problem, such as timestamping, two phase locking etc.
-    c) distributed databases, how do we manage recovery or two phase locking or something
-
-    - problems that arise: concurrency control, lost update, etc
-    - serialisability, guarantee serialisability
-    - recovery, system log
-    - distributive databases
-
-4. question 4: database models
-    a) parallelism
-    b) deductive / logic databases (not covered on past papers) (not too hard because we didn't spend long on it)
-        - store facts and relations 
-    c) security (one of the models touched on 2023-11-14) (not covered on past papers)
-        - Bell-LaPadula model or some other model touched on
-
-- old course was called ct332
-    - will get deductive / logic databases on old papers
-- no more exam material after ./slides/DatabaseSecurity.pdf

third/semester1/CT3532: Database Systems II/tutorial.txt

@@ -1,24 +0,0 @@
-Types of conflicts:
-    - rw
-    - wr
-    - ww
-
-Conflicts in timestamping are directed: the second of the transactions is said to conflict with the first, not vice-versa.
-When a cycle is formed in the transaction graph, the transaction is killed.
-
-
-BCNF: all determinants (left-hand sides of FDs) are candidate keys
-    AB -> C
-     C -> B 
-     C+ = {C, B} != R
-
-
-Minimal cover set:
-    1. RHS should be singletons
-        i.e. X -> YZ becomes X->Y X->Z
-    2. minimal LHS
-        i.e XYZ -> W and YZ -> W then XYZ->W is redundant and should just be replaced with YZ->W
-    3. No redundant FDs
-
-in general, use an example of your own rather than given 
-    - "as far as he knows", it's all examples from your own imagination"