Some important topics for DBMS
MODULE 1
• Difference between Structured, unstructured and semi structured data
•Three schema architecture
• Difference between physical and logical data independence
• People who deal with database
• Difference between DML, DDL and DCL
• Define entity and attribute
• Types of attributes
• Mapping cardinality
• Explain about Weak entity set with example
• Differentiate with example unary, binary and ternary degree of relationship
Problematic QNS
• Construct an ER diagram for a car insurance company whose customers own one or more cars each. Each car has associated with it zero to any number of recorded accidents.
• Construct an ER diagram for a hospital with a set of patients and a set of medical doctors. Associated with each patient a log of the various tests and examinations conducted.
MODULE 2
• Differentiate between primary key, candidate key, foreign key, partial key, non-key, super key
• Explain integrity constraints Entity constraints, Domain constraints and referential integrity constraints
• Explain Domino effect (cascading deletion)
• Fundamental operations of relational algebra select, project, union, set difference, Cartesian product, rename, division
• Join operations- equijoin, natural join, outer join
• SQL operations CREATE, DROP, ALTER, INSERT, DELETE, UPDATE
• Map the following ER Model to Relational DB
MODULE 3
• SQL queries
• Views assertions Triggers
• Heap files
• Indexing-Singe level and multi-level-indices
• B-Trees and B+-Trees
• Extendible Hashing
• Grid Files
MODULE 4
• Different anomalies in Database
• Armstrong's Axioms
• Normal forms (1nf,2nf,3nf and BCNF)
• Partial,transitive and full functional dependency
• Conditions of lossless join decomposition
• Canonical cover
Problematic Questions
• Find the closure of FD using Amstrong axioms
• If R (ABCDEH) and F= {ABC, CDE, EC, AHD} find the candidate key
• Consider a schema R(A,B,C,D) and functional dependencies A->B and C->D. Decomposition of R into R1(AB) and R2(CD). Check whether the decomposition is loss less and dependency preserving or not
• Given a Relation R(A, B, C, D, E) and its functional dependencies: {A->B, B->C, C->D, D->E}. Find the closure of the attribute {A}+
• A relation R (A, c, v, t, m ) is having two functional dependencies sets F and G as shown. Set F {AC, AC → D, E AD, E → H},Set G {A CD, E AH}. Prove F and G are equivalent.
• Relational scheme R (W, X, Y, Z) and the FDs are \ X -> W, WZ →XY, Y → WXZ }. Find the irreducible equivalent (canonical cover) for this set of functional dependencies.
MODULE 5
• ACID properties of transaction
• Transaction states (Transaction model)
• Serializability
• View serializability
• Conflict serializability
• Recoverability and Cascadeless schedule
• Two phase locking protocol
• Log-based recovery
• Deferred database modification
Comments
Post a Comment