Home/Notes/Computer Science / IT/Cs Dbms
Engineering Exam Notes

Cs Dbms Notes

Questions

5 questions

Difficulty

Medium

Importance

High scoring subject

Overview

Database Management Systems (DBMS) form the backbone of software architecture in PSU IT departments, focusing on data organization, storage, and retrieval. For competitive exams, the focus lies on relational models, SQL queries, and transaction management, which are frequently tested for their conceptual clarity and application.

Relational Model and Normalization

The relational model uses tables to represent data and relationships, while normalization is the process of organizing data to reduce redundancy. PSU exams often require you to identify the highest normal form of a given relation or identify functional dependencies.

  • 1NF: Atomic values and no repeating groups
  • 2NF: No partial dependency
  • 3NF: No transitive dependency
  • BCNF: Every determinant must be a candidate key
  • Lossless decomposition is a mandatory requirement for normalization

SQL and Relational Algebra

SQL is the standard language for querying databases, and relational algebra provides the theoretical foundation for these operations. Questions often involve interpreting complex joins or writing small snippets to filter records.

  • SELECT: Projects required columns
  • WHERE: Filters based on conditions
  • JOIN types: Inner, Left, Right, and Full Outer
  • Aggregate functions: COUNT, SUM, AVG, MIN, MAX
  • Difference between DELETE, DROP, and TRUNCATE

Transaction Management and Concurrency

Transaction management ensures the ACID properties, which are critical for data integrity in large-scale enterprise systems. Understanding concurrency control mechanisms like locking is essential to prevent data anomalies.

  • Atomicity: All or nothing execution
  • Consistency: Transitions from one valid state to another
  • Isolation: Concurrent execution maintains independence
  • Durability: Committed data persists after crashes
  • Deadlock detection via Wait-For-Graph

Formula Sheet

Number of candidate keys calculation

Closure of an attribute set: X+

Lossless Join property: R1 INTERSECT R2 -> R1 or R1 INTERSECT R2 -> R2

Exam Tip

Focus heavily on functional dependency problems and normalization steps, as these are the most 'guaranteed' marks in every PSU technical paper.

Common Mistakes

  • Confusing BCNF with 3NF by ignoring dependencies where the determinant is not a superkey
  • Misinterpreting the difference between NATURAL JOIN and CROSS JOIN in query outputs
  • Overlooking the impact of NULL values on aggregate functions like COUNT(*)

More Revision Notes

Ready to test yourself?

Play topic-wise Cs Dbms questions in Aspirant Arcade — gamified MCQ practice.

Download Free