ExamSIDE
Questions (Powered by ExamGOAL)
Database Management System
Er Diagrams
Marks 1Marks 2
Functional Dependencies and Normalization
Marks 1Marks 2
Structured Query Language
Marks 1Marks 2
Relational Algebra
Marks 1Marks 2
Transactions and Concurrency
Marks 1Marks 2
File Structures and Indexing
Marks 1Marks 2
Previous Next
1
GATE CSE 2024 Set 2
MCQ (Single Correct Answer)
+1
-0.33

Once the DBMS informs the user that a transaction has been successfully completed, its effect should persist even if the system crashes before all its changes are reflected on disk. This property is called

A

durability

B

atomicity

C

consistency

D

isolation

2
GATE CSE 2024 Set 2
MCQ (More than One Correct Answer)
+1
-0

Which of the following statements about the Two Phase Locking (2PL) protocol is/are TRUE?

A

2PL permits only serializable schedules

B

With 2PL, a transaction always locks the data item being read or written just before every operation and always releases the lock just after the operation

C

With 2PL, once a lock is released on any data item inside a transaction, no more locks on any data item can be obtained inside that transaction

D

A deadlock is possible with 2PL

3
GATE CSE 2021 Set 1
MCQ (More than One Correct Answer)
+1
-0

Suppose a database system crashes again while recovering from a previous crash. Assume checkpointing is not done by the database either during the transactions or during recovery.

Which of the following statements is/are correct?

A
The same undo and redo list will be used while recovering again.
B
The database will become inconsistent.
C
All the transactions that are already undone and redone will not be recovered again.
D
The system cannot recover any further.
4
GATE CSE 2019
MCQ (Single Correct Answer)
+1
-0.33
Consider the following two statements about database transaction schedules:

I. Strict two-phase locking protocol generates conflict serializable schedules that are also recoverable.

II. Timestamp-ordering concurrency control protocol with Thomas Write Rule can generate view serializable schedules that are not conflict serializable.

Which of the above statements is/are TRUE?
A
Both I and II
B
I only
C
II only
D
Neither I nor II
Previous Next
Questions Asked from Marks 1
GATE CSE 2025 Set 2 (1) GATE CSE 2025 Set 1 (1) GATE CSE 2024 Set 2 (2) GATE CSE 2021 Set 1 (1) GATE CSE 2019 (1) GATE CSE 2016 Set 2 (1) GATE CSE 2016 Set 1 (1) GATE CSE 2015 Set 2 (1) GATE CSE 2010 (1) GATE CSE 2005 (1) GATE CSE 2004 (1) GATE CSE 2003 (1)
GATE CSE Subjects
Theory of Computation
Operating Systems
Algorithms
Digital Logic
Database Management System
Data Structures
Computer Networks
Software Engineering
Compiler Design
Web Technologies
General Aptitude
Discrete Mathematics
Programming Languages
Computer Organization