B.TechSemester 62024-25Basics Of Data Base Management SystemBOE067
View PDFDownload

Basics Of Data Base Management System (BOE067) - AKTU Question Paper 2024-25

B.Tech · Semester 6 · Free PDF Download

This is the official AKTU Basics Of Data Base Management System Previous Year Question Paper for B.Tech Semester 6, academic session 2024-25. Published by Dr. A.P.J. Abdul Kalam Technical University (AKTU/UPTU), Lucknow. Free PDF download — no login required.

Course:B.Tech
Semester:Semester 6
Session:2024-25
University:AKTU / UPTU

Rate this paper

Questions Asked in 2024-25

Basics Of Data Base Management System (BOE067) — complete question paper · 70 marks · 3 Hours

Section AAttempt all questions in brief. 02 x 7 = 14
  • a
    What are the three levels of da ta abstraction in a DBMS?
  • b
    Differentiate between entity in tegrity and referential integrity
  • c
    Differentiate between DDL and DM L with one example each
  • d
    List all prime and non-prime attributes In Relation R(A,B,C,D, E) with FD set F = {AB→C, B→E, C→D}
  • e
    When is a transaction Rolled Back?
  • f
    What are ACID properties of Transaction?
  • g
    What is Lock in Transaction Management?
Section BAttempt any three of the following: 07 x 3 = 21
  • a
    A database is being constructed to keep track of the teams a nd games of a sport league. A team has a number of players, not all of whom p articipate in each game. It is desired to keep track of players participat ing in each game for each team, the positions they play in that game and th e result of the game. (i) Design an E-R schema diagram for this application. (ii) Map the E-R diagram into relational Model
  • b
    Explain the method of testing the serializability. Consider the schedule S1 and S2 given below Check whether the given schedules are conflict equivalent or not?
  • c
    What is Log? How is it maintained? Discuss the features of d eferred database modification and immediate database modification in brief
  • d
    Discuss the types of users in DBMS. How does a database admi nistrator (DBA) differ from an end-user? Explain the roles and responsibi lities of a DBA
  • e
    What is Aggregate function in SQL? Write SQL query for aggre gate function
Section CAttempt any one part of the following: 07 x 1 = 07
  • a
    Create a table STUDENT wi th the following structure:  StudentID (Primary Key)  Name (VARCHAR)  Age (Integer)  Department (VARCHAR)  Marks (Number) Include constraints for primary key, NOT NULL, and CHECK (Marks >= 0).Also, write SQL statements to: Insert 3 student records
  • b
    Explain the following types of database security with examples:  Physical security  OS-level security  Network-level security  Database-level security Also, mention how these layers co mplement each other in a secur e architecture
  • a
    Consider the following schema for institute library: Student ( R o l l N o , Name, Father_ Name, Branch) Book (ISBN, Title, Author, Publishe r) Issue (RollNo, ISBN, Date-of –Issue) Write the following queries in SQL: (i) List roll number and name of all students of the branch ‘CSE’. (ii) Find the name of student who has issued a book published by ‘ABC’ publisher. (iii) List title of all books and their authors issued to a student ‘RAM’. (iv) List title of all books issued on or before December 1, 2020. (v) List all books published by publisher ‘ABC’
  • b
    Write a short descripti on of following terms: Super Key, Candidate Key, Primary Key, Alternate Key, Foreign Key and Composite Key
  • a
    Explain different types of j oin operations in relational alg ebra: inner join, natural join, outer join, equi-join with examples
  • b
    Given the following set of FDs on schema R (V,W,X,Y,Z) {Z →V, W→Y, XY→Z, V→WX}.State whether the following decomposition are loss- less-join decompositions or not. (i) R1=(V,W,X) and R2= (V, Y, Z) (ii) R1=(V,W,X) and R2=(X, Y, Z)
  • a
    Let relation R(A, B, C, D) h ave the following functional dependencies:
    F = {A → B, B → D, A → C}
G = {A → BD, A → C}
Check whether F and G are equivalent. Use closure of F and G and explain
your reasoning clearly
  • b
    Discuss the procedure of dead lock detection and recovery in transaction
  • a
    Consider the relation R(A, B, C , D, E) with functional dependencies: (i) Find the candidate keys. (ii) Determine if the relation is in 2NF or 3NF. (iii) Normalize the relation to BCNF
  • b
    Explain Recovery from C oncurrent Transaction

Question text is extracted from the official AKTU question paper PDF above. Hindi translations are omitted — every question is printed in English in the original paper. Last verified: 2026-08-23.

Basics Of Data Base Management System — Other Year Papers

AKTU Basics Of Data Base Management System PYQs from other sessions

Basics Of Data Base Management System2021-22Basics Of Data Base Management System2022-23Basics Of Data Base Management System2023-24

More B.Tech Semester 6 (2024-25) Papers

Other subjects from same semester and session

CMOS Digital Design Techniques2024-25Special Electrical Machines2024-25Augmented Virtual Reality2024-25Software Engineering2024-25River Engineering2024-25Data Compression2024-25Repair And Rehabilitation Of Structures2024-25Idea To Business Model2024-25
View all B.Tech Semester 6 2024-25 papers →

Syllabus & More PYQs

Paper solve karne se pehle unit-wise syllabus dekh lo

📘 Basics of Data Base Management System — Unit-wise SyllabusBOE067AKTU 3rd Year SyllabusAKTU 3rd Year PYQs — All BranchesCSE 3rd Year SyllabusIT 3rd Year Syllabus