ENCT 301Bachelor in Computer Engineering · Semester 54 Papers Available

Database Management System

Past examination question papers and complete curriculum syllabus for Database Management System (ENCT 301), Bachelor in Computer Engineering Semester 5 under Institute of Engineering (IOE), Tribhuvan University.

Past Question Papers (PDF)

Switch tabs to view different exam papers
Available Papers:

5th-sem_Database Management System.pdf

IOE Past Examination Paper

Download PDF
Served via fast CDN. Read in full view or download for offline study.

Document information: This past examination paper is identified as an IOE/TU academic document and was cataloged from a public Google Drive archive. This independent website did not create the examination paper and is not affiliated with TU or IOE.

Rights holders can request correction or removal by emailing subeshgaming@gmail.com with this page URL and supporting details.

Most Frequently Asked Questions

Top recurring IOE board exam questions for Database Management System with verified mark schemes, formula notation, and recurrence frequency.

Showing 40 of 40 top repeated questions
9 Chapters · Click any chapter to expand
·

Year-wise & Session-wise Exam Papers

Complete questions from each exam session (Regular & Back exams from 2082 to 2069) for Database Management System. Click any session paper to expand.

Showing 262 questions across 20 exam session papers
Institute of Engineering • 2082 Chaitra Board Examination
Q1[3 Marks]Introduction
Describe major drawbacks of file processing system that led to the development of DBMS.
Q2[2 Marks]Introduction
Define data independence. Explain logical and physical data independence with examples.
Q3[6 Marks]Data Models
Draw ER diagram for online pharmacy that manages medicines supplied by manufacturers and distributed via warehouses. The pharmacy also records online sales of medicines through a virtual shopping cart. Medicines have a unique Drug_ID, price, generic name, and expiration date. Manufacturers have a name, location, contact number, and website. Warehouses have a warehouse code, address, and contact phone. Customer details include name, address, email, and phone number. Assume any other necessary attributes and relationships to make the system complete. Explain how you can convert a many to many relationship in ER diagram to a relational schema diagram along with illustrative example.
Q4[2 Marks]Data Models
What are the different types of keys? A hospital plans to develop a hospital management system. The system should maintain patient details and allow patients to book appointments with doctors. A patient can book many appointments, but each appointment is linked to one patient and one doctor. Similarly, a doctor can attend many appointments. Doctors work in departments. Each department can have many employees, doctors, nurses, and other staffs, but each belongs to only one department. Patients may receive treatment from multiple doctors, and a doctor may treat multiple patients. Doctors can also issue prescriptions to patients; a doctor can write many prescriptions, and a patient can receive many prescriptions. If a patient requires hospitalization, the patient may be admitted multiple times, but each admission is associated with only one patient. For every admission, exactly one bill is generated, and each bill corresponds to only one admission. Design ER diagram for this system, clearly representing the entities, their attributes, and the relationships with appropriate cardinalities.
Q5[8 Marks]Relational Query Languages
Consider the following relational database model: [3×2] FARMER (FarmerID, FarmerName, Address, Phone) FARM (FarmID, Location, Area, FarmerID) CROP (CropID, CropName, Season) CULTIVATION (FarmID, CropID, Year, QuantityProduced) MARKET (MarketID, MarketName, City) SALE (SaleID, FarmID, CropID, MarketID, SaleDate, Amount) Write relational algebra expressions for the following queries: (a) Retrieve the names of farmers who cultivate crops during the "Winter" season. (b) Find the farm locations where no crop cultivation has been recorded. (c) List the CropID and CropName of crops that are cultivated in more than one farm.
Q6[8 Marks]Relational Query Languages
Considering the same database in question 3, write SQL expressions for the following queries: [3×2] (a) Display the crop name and total quantity produced for each crop, showing only those crops whose total production exceeds 1,000 units. (b) Consider there is a database user FarmOfficer. Grant insert and update privilege and Revoke delete privilege from FarmOfficer on FARMER table. (c) Write stored procedure to insert a new record in FARMER table using INSERT SQL query.
Q7[8 Marks]Relational Query Languages
Consider the following relational schema. Student (Rno, Sname, Address, city, Mobile) Department (Did, Dname) Academic (Rno, Did, SPI, CPI, Backlog_count) Guide (Rno, Project_name, Fid) Faculty (Fid, Faculty_name, Subject, Did, Salary) Write relational algebra for the following: [] (a) List the name of students with their department name having backlog 0. (b) List the name of faculties with their department name and salary having salary more than 125,000 and belongs to "BCT" department. (c) Insert a new data (10, 'Dhawa', 'Prithivi Chowk', 'Pokhara', '9891123456'). (d) List the name of students with their department name doing project "Chatbot" under the guidance (faculty_name) of "Ram".
Q8[8 Marks]Relational Query Languages
Consider the above relational schema. [] (a) Write a SQL to count the faculty per department only if the department have more than 5 employees. (b) Write a SQL query to display the total salary of teachers according to department name in descending order of total salary. (c) Write SQL to update the salary of employees by 15% if salary is less than 50 k, by 10% if salary is in between 50 k to 100 k and by 5 % if salary is greater than 100 k. (d) Write SQL query to show the details of employee with highest earning.
Q9[4 Marks]Database Constraints and Normalization
Why is normalization necessary? Explain. What are the criteria for a relational schema to be in BCNF and what factors differentiate it from 3NF.
Q10[4 Marks]Database Constraints and Normalization
How do you convert un-normalized database schema to 3NF? Explain in detail with the help of example.
Q11[2 Marks]Database Constraints and Normalization
In a given relational schema(A,B,C,D,E) we have the following FDs • • • Find attribute closure of AB. Using the concept of attribute closure, determine the combination of keys that best fit to be candidate keys.
Q12[3 Marks]Query Processing and Optimization
Explain with diagram about process of query processing in RDBMS. How are equivalence rules for relational algebra helpful for query optimization? Explain with example.
Q13[3 Marks]File Structure and Hashing
What is indexing in a database? Explain primary indexing and secondary indexing with example.
Q14[3 Marks]File Structure and Hashing
Explain the working of B+ tree index along with suitable example. Differentiate between static hashing and dynamic hashing along with examples.
Q15[3 Marks]Transaction Processing and Concurrency Control
Explain ACID properties in database transaction with an example. Define deadlock and explain how wait-die scheme and wound-wait scheme helps to prevent deadlock.
Q16[3 Marks]Transaction Processing and Concurrency Control
Explain the state transition diagram for database transactions. Consider a schedule having 4 transaction having data items A, B and C ordered as Check whether the schedule is conflict serializable or not.
Q17[3 Marks]Crash Recovery
What are the types of failures in database? What is check pointing in a database system? Explain its purpose and describe how it is performed to improve database recovery.
Q18[4 Marks]Crash Recovery
Explain in detail the working of log-based recovery method.
Q19[2 Marks]Advanced Database Concepts
Write short notes of NoSQL and distributed databases.
Q20[8 Marks]Advanced Database Concepts
Write short notes on: (Any Two) [2x4] (a) Object oriented database (b) Serializability (c) Functional dependency and its types
Q21[8 Marks]Query Processing and Optimization
What are the different steps involved in query processing? Explain with an example.
Q22[8 Marks]Introduction
What are the criteria for a relational schema to be in BCNF and what factors differentiate it from 3NF.
Q23[8 Marks]Query Processing and Optimization
Explain the basic steps in query processing. Make distinctions between cost based optimization and heuristic optimization.
Q24[8 Marks]Database Constraints and Normalization
Why is normalization necessary? Explain.
Q25[8 Marks]File Structure and Hashing
Explain primary indexing and secondary indexing with example.
Q26[4 Marks]Query Processing and Optimization
Explain the basic steps in query processing. Make distinctions between cost based optimization and heuristic optimization.
Q27[4 Marks]Crash Recovery
How does Log Based Recovery help in recovering from DBMS crashes? Explain with example.

Curriculum Syllabus & Course Topics

Sourced from TU curriculum portal
Chapter-wise Units & Micro-Syllabus Topics (9 Units)
  1. 1. Introduction

    • 1.1Application and evolution of database
    • 1.2Data abstraction (Physical, logical, and view level) and data independence
    • 1.3Schema and instances
  2. 2. Data Models

    • 2.1Introduction to data models (Entity-relationship, relational, object model, hierarchical, network, graph data models)
    • 2.2E-R model 2.2.1 Entities and entity sets 2.2.2 Attributes and keys 2.2.3 Strong and weak entity sets 2.2.4 Relationship and relationship sets (Mapping cardinalities) 2.2.5 Specialization, generalization and aggregation
    • 2.3Relational model 2.3.1 Concept of relational model, key constraints 2.3.2 Converting ER model into relational model
  3. 3. Relational Query Languages

    • 3.1Relational algebra
    • 3.2Concept of DDL, DML and DCL
    • 3.3Overview of the SQL query language-DDL and DML queries
    • 3.4Set operations
    • 3.5Aggregate functions – GROUP BY – HAVING
    • 3.6Joins and types of joins
    • 3.7Nested sub queries
    • 3.8Database modification (Insert, update, delete)
    • 3.9Views
    • 3.10Triggers and stored procedures
    • 3.11Privilege and roles management – GRANT and REVOKE statements
  4. 4. Database Constraints and Normalization

    • 4.1Integrity constraints and domain constraints
    • 4.2Assertions
    • 4.3Functional dependencies
    • 4.4Different normal forms (1NF, 2NF, 3NF, BCNF)
  5. 5. Query Processing and Optimization

    • 5.1Query processing, optimization and evaluation
    • 5.2Transformation of relational expressions
    • 5.3Techniques of implementing query optimization - Cost based optimization and heuristic optimization
    • 5.4Query evaluation - Materialization and pipelining
    • 5.5Denormalization for performance
    • 5.6Materialized view
    • 5.7Performance tuning
  6. 6. File Structure and Hashing

    • 6.1Disks and storage
    • 6.2Records organizations
    • 6.3Ordered indices
    • 6.4B+ tree index
    • 6.5Hashing concepts - Static and dynamic hashing
  7. 7. Transaction Processing and Concurrency Control

    • 7.1Transaction and transaction model - State diagram
    • 7.2ACID properties
    • 7.3Concurrent execution of transactions
    • 7.4Serializability (Conflict and view serializability)
    • 7.5Lock based protocols
    • 7.6Deadlock handling and prevention
    • 7.7Multiple granularity
  8. 8. Crash Recovery

    • 8.1Failure classification
    • 8.2Recovery and atomicity
    • 8.3Log-based recovery
    • 8.4Shadow paging
    • 8.5High availability using remote backup systems
  9. 9. Advanced Database Concepts

    • 9.1Concept of object-oriented databases
    • 9.2Distributed database model
    • 9.3Concept of data warehousing and online analytical processing
    • 9.4Basic concepts of NoSQL and big data

Examination Scheme & Marks Distribution

Evaluation Structure

  • Final Board Theory Exam: 60 Marks (Pass mark: 24)
  • Internal Assessment: 40 Marks (Pass mark: 16)
  • Practical / Lab Exam: 25 or 50 Marks (Continuous lab evaluation + viva, where applicable)

* This is the general current IOE 60/40 scheme; verify course-specific details in the syllabus above.

Exam Preparation Guidelines

  • Review the 4 available past examination papers to identify recurring patterns, core problem types, and chapter weightage.
  • Practice writing clean algorithms and code implementations, tracing dry runs with sample inputs, and explaining complexity trade-offs.
  • Structure answers with labeled diagrams, concise bullet points, and highlight final answers in numerical solutions.
Authentic IOE Past Papers
Free Direct PDF Download
Curriculum Syllabus & Marking Scheme