Module 7: Basic Database Administration
User Management and Access Control
Backup and Restore Procedures
Indexing for Performance
Introduction to Transactions and Concurrency
Introduction to Data Security and Privacy
Practical Session:
Administering a database (creating users, setting permissions).
Module 8: Final Project and Assessment
Final Project: Design and implement a small database system for a real-world application
(e.g., e-commerce, library management, etc.)
Assessment: Written exam (basic theory) + practical test (SQL queries and database design)
Assessment Methods:
Quizzes: To test theoretical understanding of database concepts.
Practical Assignments: Hands-on tasks involving data modeling, SQL querying, and
database design.
Final Project: A comprehensive project involving the design and implementation of a small
database.
Final Exam: Testing both theoretical and practical understanding.
Recommended Texts:
1. Database System Concepts by Abraham Silberschatz, Henry Korth, and S. Sudarshan
2. Fundamentals of Database Systems by Ramez Elmasri and Shamkant Navathe
3. Learning SQL by Alan Beaulieu
This course is designed to provide a solid foundation in database design and SQL, which students
can build on as they move to more advanced topics like database optimization, NoSQL databases,
and database security.
Types of Inference rules:
1. Modus Ponens:
The Modus Ponens rule is one of the most important rules of inference, and it states
that if P and P → Q is true, then we can infer that Q will be true. It can be represented
as:
Example:
Statement-1: "If I am sleepy then I go to bed" ==> P→ Q
Statement-2: "I am sleepy" ==> P
Conclusion: "I go to bed." ==> Q.
Hence, we can say that, if P→ Q is true and P is true then Q will be true.
Proof by Truth table:
2. Modus Tollens:
The Modus Tollens rule state that if P→ Q is true and ¬ Q is true, then ¬ P will also
true. It can be represented as:
Statement-1: "If I am sleepy then I go to bed" ==> P→ Q
Statement-2: "I do not go to the bed."==> ~Q
Statement-3: Which infers that "I am not sleepy" => ~P
Proof by Truth table:
3. Hypothetical Syllogism:
The Hypothetical Syllogism rule state that if P→R is true whenever P→Q is true, and
Q→R is true. It can be represented as the following notation:
Example:
Statement-1: If you have my home key then you can unlock my home. P→Q
Statement-2: If you can unlock my home then you can take my money. Q→R
Conclusion: If you have my home key then you can take my money. P→R
Proof by truth table:
4. Disjunctive Syllogism:
The Disjunctive syllogism rule state that if P∨Q is true, and ¬P is true, then Q will
be true. It can be represented as:
Example:
Statement-1: Today is Sunday or Monday. ==>P∨Q
Statement-2: Today is not Sunday. ==> ¬P
Conclusion: Today is Monday. ==> Q
Proof by truth-table:
5. Addition:
The Addition rule is one the common inference rule, and it states that If P is true, then
P∨Q will be true.
Example:
Statement: I have a vanilla ice-cream. ==> P
Statement-2: I have Chocolate ice-cream.
Conclusion: I have vanilla or chocolate ice-cream. ==> (P∨Q)
Proof by Truth-Table:
6. Simplification:
The simplification rule state that if P∧ Q is true, then Q or P will also be true. It can
be represented as:
Proof by Truth-Table:
7. Resolution:
The Resolution rule state that if P∨Q and ¬ P∧R is true, then Q∨R will also be
true. It can be represented as
Proof by Truth-Table:
