GTU · BE Computer · Semester 3
GTU 3130703 Database Management Systems (DBMS) Old Question Papers PDF
Official Gujarat Technological University (GTU) old question papers PDF (Regular & Remedial) and step-by-step solved questions for Database Management Systems (DBMS) across 2023 – 2026 examinations.
41 questions GTU asked more than onceAsked in all 7 papers: Explain ACID properties of transaction.See listExam papers
Most repeated questions
41 questions GTU set in two or more of 7 papers, most repeated first. Tap a year to open that paper at the question.
Explain ACID properties of transaction.
Summer 2026 Q3a Winter 2025 Q4b OR Summer 2025 Q3a OR Winter 2024 Q4b OR Summer 2024 Q4b Winter 2023 Q4a Summer 2023 Q4c
Discuss various steps of query processing with diagram.
Summer 2026 Q4c OR Winter 2025 Q4c Winter 2024 Q4c OR Summer 2024 Q3c OR Winter 2023 Q4c Summer 2023 Q3c OR
Consider the following relations and write SQL queries for given statements. Assume suitable constraints. Passengers(passenger_id, name, age, gender) Trains(train_id, train_name, source, destination) Bookings(booking_id, passenger_id, train_id, booking_date, fare)
Summer 2026 Q5c Summer 2026 Q5c OR Winter 2025 Q5c OR Summer 2025 Q5c OR Summer 2024 Q5c Winter 2023 Q5c Winter 2023 Q5c OR Summer 2023 Q5c
Explain the advantages of Database Management Systems over file processing system.
Winter 2025 Q2c Summer 2025 Q1c Winter 2024 Q1c Winter 2023 Q1b
Explain Armstrong’s axioms.
Summer 2026 Q2b Summer 2025 Q3c OR Winter 2024 Q3b OR Summer 2024 Q2c
Explain Cursors in PL/SQL with example.
Summer 2026 Q5a OR Summer 2025 Q4b OR Summer 2024 Q5b Winter 2023 Q5a OR
What do you mean by Serializable Schedule? Explain View Serializability with example.
Explain the two-phase locking protocol in detail.
Draw E-R diagram for canteen management system showing at least four entity types and their relationships with necessary assumptions.
Summer 2026 Q2c Summer 2026 Q2c OR Winter 2025 Q3c OR Winter 2024 Q2c
Consider the relation R(ABCD) with dependencies F ={AB->C, BC-> D}. Does the above relation appear in 3NF? If not, normalize it in 3NF.
Show 31 more repeated questionsHide the 31 more
Explain different types of database users.
Explain three level architecture of DBMS.
Briefly explain Generalization and Specialization in E-R diagram.
Differentiate Sparse and Dense dense index in DBMS.
Explain Triggers in PL/SQL with example.
List and explain different types of locks in transactions.
What is log-based recovery? List and explain various fields use in log records for log-based recovery.
Consider following relations and write queries in the form of relational algebra. Student(std_id, std_name, semester, dept_id) Department(dept_id,dept_name,no_of_faculties)
Summer 2026 Q2a Summer 2024 Q1c Winter 2023 Q3b Winter 2023 Q3b OR
Explain database system 3-tier architecture with diagram in detail.
What is normalization? Explain 2NF, 3NF and BCNF with suitable examples.
What is Normalization? Explain 1NF, 2NF and 3NF with suitable example.
What is a deadlock? How to detect deadlock? Explain with example.
Explain Query Optimization with example.
Explain the concepts of strong entity and weak entity using real world example.
Let R = (A, B, C, D, E, F) be a relation schema with the following dependencies {C → F, E → A, EC → D, A → B} What is the Candidate key of the relation R?
Write a short note on Intrusion Detection in DBMS.
Draw and explain transaction state diagram.
Describe Grant and Revoke commands with suitable example.
Define referential integrity constraint with example.
Explain SQL Injection in brief.
Categorize joins in the SQL. Explain each with suitable example.
Write a PL/SQL function which takes 3 integer numbers as parameters and return an average of same.
Explain candidate key, primary key and foreign key.
What is Functional Dependency? Explain armstrong’s axioms.
Explain Two phase commit protocol.
Discuss conflict serializability in transactions.
Differentiate between conflict and view serializability with respect to transaction.
Differentiate dynamic hashing and static hashing.
List and explain mapping cardinalities of E-R diagram with example.
Explain Logical & Physical data independence supported by DBMS
Explain insertion and deleting anomalies with respect to normalization.
Which branches take this subject
GTU's syllabus lists 3130703 for 11 branches. One set of papers serves all of them.
Semester 3: 11 branches
Artificial Intelligence and Data Science, Artificial Intelligence and Machine Learning, Computer Engineering, Computer Science & Design, Computer Science & Engineering, Computer Science & Engineering (Artificial Intelligence and Machine Learning), Computer Science & Engineering (Cyber Security), Computer Science & Engineering (Data Science), Computer Science & Engineering (Internet of Things and Cyber Security Including Block Chain Technology), Information & Communication Technology, Information Technology
Other Semester 3 subjects
Common questions
Are these GTU 3130703 Database Management Systems papers valid for both Regular and Remedial exams?
Yes. Gujarat Technological University (GTU) follows the same 70-mark syllabus, exam blueprint, and 23-mark passing cutoff for both Regular and Remedial (ATKT/backlog) examinations. All 7 past exam sessions (2023 – 2026) serve as comprehensive preparation for either attempt.
How can I download GTU 3130703 Database Management Systems old question papers PDF?
You can download official GTU 3130703 original question paper PDFs directly from the table above with 1 click and zero deceptive ads or wait timers. Every paper also includes interactive online questions with AI study prompts.
What is the passing mark for GTU Database Management Systems (3130703)?
The external theory exam carries 70 marks. The minimum passing cutoff is 23 marks (33%). Exam duration is 2.5 hours.
What is the GTU exam pattern for 3130703?
The examination contains 5 main questions of 14 marks each, totaling 70 marks. Questions 2 through 5 provide internal OR choices, typically split into 3-mark, 4-mark, and 7-mark questions.