Logo

BIT Database Management System

bitsemester 3
Chapter Wise NotesQuestion BanksSyllabusChapter Wise QuestionsVivaPractical

BIT Semester 3 Database Management System Question Paper 2080 – Solved

tu-logo

Institute of Science and Technology

2080

Bachelor in Information Technology

Database Management System

BIT202

Full Marks: 60

Pass Marks: 24

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

"Section A"

Long Answer Questions. Attempt any TWO questions.

[2 × 10 = 20]

1.

Define serial, non-serial and serializable schedules with example. How can you test serializability of a schedule? Explain with an example

[6+4]
2.

What is Transaction? State and explain the states of transaction with transition diagram.

[2+8]
3.

From the the relations given below, answer the following questions.

EMPLOYEE (Ssn, Ename, Bdate, Address, Sex, Salary, Super_ssn, Dno)

DEPARTMENT (Dname, Dnumber, Mgr_ssn, Mgr_start_date)

PROJECT (Pname, Pnumber, Plocation, Dnum)

DEPENDENT (Essn, Dependent_name, Sex, Bdate, Relationship)

DEPT_LOCATIONS (Dnumber, Dlocation)

a) Retrieve the name and address of all employees who work for the 'Computer' department in SQL

b) For each Department, retrieve the department number, the number of employees in the department, and their average salary using SQL.

c) Retrieve the employees name and their Dname and Pname ordered by the employee's Dname.

d) Retrieve the name and salary of all employees who work in department number 5 using Relational Algebra.

e) Retrieve the name of the manager of each department using Relational Algebra.

[5×2=10]