CSC265 Database Management System

Database Management System TU Board 2082 question paper

12 questionsSit this paper (timed)

Tribhuvan University

Bachelor of Science in Computer Science and Information Technology

Semester 4 · TU Board 2082

Course Title: Database Management System (CSC265)

Full Marks: 60Pass Marks: 24Time: 3 hours

Candidates are required to give their answers in their own words as far as practicable. The figures in the margin indicate full marks.

Group A

Attempt any TWO(2 × 10 = 20)

  1. 1.

    Consider an online Bookstore, from which customers can buy books. Each customer can place multiple orders. Each order has one or more books. The Bookstore needs to store information about each customer, their orders, and the books available in the store.

    • a) Draw an ER diagram for the online Bookstore system including appropriate attributes, keys, and relationships.
    • b) Convert the ER diagram into a relational schema. Show all the primary keys and foreign keys.
    10
  2. 2.

    Consider the following relational schema:

    Student(, SName, Dept, Year)

    Course(, CName, Credit)

    Enroll(, CID, Grade)

    Specify the following queries in both SQL and Relational Algebra on this database schema:

    • a) List names of students from the "CSIT" department whose name starts from A.
    • b) Display student names and course names they have enrolled in.
    • c) Count total students enrolled in each course.
    • d) Update grade 'B' to 'A' for all students in "DBMS".
    • e) Delete records of students whose Year is 2024.
    10
  3. 3.

    Define Normalization. Explain 1NF, 2NF and 3NF with a suitable example.

    10

Group B

Attempt any EIGHT(8 × 5 = 40)

  1. 4.

    Differentiate between traditional file processing system and database approach.

    5
  2. 5.

    Explain the concepts of schema, instance, and data independence.

    5
  3. 6.

    Define relational constraints. Explain domain, entity integrity, and referential integrity with examples.

    5
  4. 7.

    Explain the basic operations of relational algebra: UNION, INTERSECTION, DIFFERENCE, and CARTESIAN PRODUCT with suitable examples.

    5
  5. 8.

    Explain different types of functional dependencies with example.

    5
  6. 9.

    Explain ACID properties in database.

    5
  7. 10.

    What is concurrency control? Explain optimistic and multiversion concurrency control techniques.

    5
  8. 11.

    What is a schedule in transaction processing? Explain how concurrency control ensures serializability.

    5
  9. 12.

    Explain any one database recovery technique.

    5

— The End —