Scribd
Upload
166 views2 pages

DBMS CSC 253 Model

The document is a sample exam paper for a database management systems course. It contains 6 questions that assess understanding of key database concepts: 1) It asks short questions about database management systems, data independence, database schemas and instances, weak entities, and data abstraction levels. 2) It asks for an entity-relationship diagram modeling data about universities, colleges, courses, and students. 3) It provides a relational database schema and asks SQL queries about customers, accounts, loans, and branches. 4) It discusses normal forms in database design and performing lossless join decomposition based on functional dependencies. 5) It defines transactions and the ACID properties, and distinguishes between serial and serializable

Uploaded by

Mohan Dutt Bhatt
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
166 views2 pages

DBMS CSC 253 Model

The document is a sample exam paper for a database management systems course. It contains 6 questions that assess understanding of key database concepts: 1) It asks short questions about database management systems, data independence, database schemas and instances, weak entities, and data abstraction levels. 2) It asks for an entity-relationship diagram modeling data about universities, colleges, courses, and students. 3) It provides a relational database schema and asks SQL queries about customers, accounts, loans, and branches. 4) It discusses normal forms in database design and performing lossless join decomposition based on functional dependencies. 5) It defines transactions and the ACID properties, and distinguishes between serial and serializable

Uploaded by

Mohan Dutt Bhatt
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

Tribhuvan University Institute of Science and Technology Model Question Paper Bachelor Level/ Second Year/ Second Semester/

Science Full Marks: 60 Computer Science and Information Technology (CSC 253) Pass Marks: 24 (Database Management System) Time: 3 hours. Candidates are required to give their answers in their own words as for as practicable. The figures in the margin indicate full marks. Attempt all the questions. 1. Answer the following questions in short. (5x2=10) (a) What is database management system? Compare it with file system. (b) Explain the difference between physical and logical data independence. (c) What do you mean by instance and schema of the database? (d) What is the difference between a string and weak entity set? What type of integrity constraint a weak entity represents. (e) Explain three levels of abstraction of data? 2. (a) Give an E-R diagram for a database showing University. The University maintains data about Affiliated Colleges, Courses, and Students. (6) (b) Describe the fundamental operations of relational Algebra. (4) 3. (a) The following is a relational database. Customer(Cname, Cstreet, Ccity) Account(bname, acno, balance) Depositor(Cname, acno) Loan(bname, loanno, amount) Borrower(Cname, loanno) Branch(bname, bcity, assets) Express the following in SQL: (a) Find the customer who lives in Kathmandu (b) Find all customers who have an account but not loan. (c) Find the largest account balance in the bank. (d) Find all customers who have an account at all branches located in Pokhara. (5) (b) What are constraints? Explain the various constraints with their uses. (1+4) 4. (a) Describe the advantages of using first, second and third normal forms in relational database design. (4) (b) Suppose that we decompose the schema R = (A, B, C, D, E) into (A, B, C) and (A, D, E). Show that the decomposition is a loss less join decomposition if the following set F of functional dependencies holds A -> BC CD -> E B -> D E -> A. (6) OR

Why certain functional dependencies are called trivial functional dependencies? Explain with proper example. (6) 5. (a) Define a transaction and list of ACID properties. Explain the usefulness of each. (1+2+2) (b) Explain the distinction between the terms serial schedule and serializable schedule. (5) 6. (a) What benefit is provided by strict two phase locking? What disadvantages result? (3+2) (b) Indicate how the recovery scheme works in a single user environment if the system fails. I. After the transaction starts and before the read. II. After the read and before the write. III. After the write and before the commit. IV. After the commit and before all databases entries are flushed onto disk. (5)

You might also like