aindreas/uni
1
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

Re-format CT3532 exam notes

Browse Source
This commit is contained in:
Aindréas Ó hAodha
2023-12-10 19:09:55 +00:00
parent 3a4fc43f39
commit 5b99d22657
1 changed files with 6 additions and 7 deletions
Download Patch File Download Diff File Expand all files Collapse all files

13
third/semester1/CT3532: Database Systems II/exam_notes.txt
View File

@ -3,10 +3,10 @@
- overlap in terms of style with exercise sheets - overlap in terms of style with exercise sheets
- most questions have 3 parts with different marks - most questions have 3 parts with different marks
- question 1 is on design (first topic covered) 1. question 1: design (first topic covered)
a) functional dependencies minimal cover sets (problem based) a) functional dependencies minimal cover sets (problem based)
b) normalisation to BCNF (decursive/descriptive) b) normalisation to BCNF (discursive/descriptive)
c) denormalisation (decursive/descriptive) c) denormalisation (discursive/descriptive)
- key things to know in general: - key things to know in general:
- functional dependency - functional dependency
@ -15,7 +15,7 @@
- normal forms - normal forms
- redundancy / denormalisation - redundancy / denormalisation
- question 2: transactions 2. question 2: transactions
a) discuss one of problems (only 3 (think lost update problem etc not sure)) (supposedly easy) 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. 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 c) distributed databases, how do we manage recovery or two phase locking or something
@ -25,7 +25,7 @@
- recovery, system log - recovery, system log
- distributive databases - distributive databases
- question 3: indexing 3. question 3: indexing
a) b trees a) b trees
b) dynamic indexes b) dynamic indexes
c) multiattribute indexes / joint attribute indexes c) multiattribute indexes / joint attribute indexes
@ -38,7 +38,7 @@
- operators - operators
- question 4: database models 4. question 4: database models
a) parallelism a) parallelism
b) deductive / logic databases (not covered on past papers) (not too hard because we didn't spend long on it) b) deductive / logic databases (not covered on past papers) (not too hard because we didn't spend long on it)
- store facts and relations - store facts and relations
@ -47,5 +47,4 @@
- old course was called ct332 - old course was called ct332
- will get deductive / logic databases on old papers - will get deductive / logic databases on old papers
- no more exam material after ./slides/DatabaseSecurity.pdf - no more exam material after ./slides/DatabaseSecurity.pdf