Structured Active Recall for Complex Coursework.
Turn your lecture PDFs into flashcards, adaptive quizzes, and spaced repetition reviews in seconds.
Start Free Sprint →ER Modeling, Relational Algebra, SQL joins/subqueries, Normalization (1NF, 2NF, 3NF, BCNF), and ACID transactions (Serializability, 2PL lock protocol).
Key Points: Compute attribute closures: (A)+ = {A, B, C, D, E}, (E)+ = {E, A, B, C, D}, (CD)+ = {C, D, E, A, B}, (BC)+ = {B, C, D, E, A}. Candidate keys: A, E, BC, CD. In B -> D, B is not a superkey, D is prime => 3NF. BCNF decomposition: R1(B, D) and R2(A, B, C, E).
Key Points: Identify conflicting operations (same item, different transactions, at least one write). Edges: r1(X) before r2(X) / w2(X) => T1 -> T2. r2(X) before w1(X)? No, r2 is after w1. w1(X) before r2(X) => T1 -> T2. Graph has single edge T1 -> T2 with no cycles => Serializable with equivalent serial schedule
Upload your Database Management Systems lecture slides to generate spaced repetition study cards in seconds.
Turn your lecture PDFs into flashcards, adaptive quizzes, and spaced repetition reviews in seconds.
Start Free Sprint →