ExamSIDE (Powered by ExamGOAL)
Questions
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.33

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 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
4
GATE CSE 2016 Set 2
MCQ (Single Correct Answer)
+1
-0.3
Suppose a database schedule $$S$$ involves transactions $${T_1},\,...,\,{T_n}.$$ Construct the precedence graph of $$S$$ with vertices representing the transactions and edges representing the conflicts. If $$S$$ is serializable, which one of the following orderings of the vertices of the precedence graph is guaranteed to yield a serial schedule?
A
Topological order
B
Depth-first order
C
Breadth-first order
D
Ascending order of transaction indices
NEXT
GATE CSE Subjects
Theory of Computation
Undecidability Finite Automata and Regular Language Push Down Automata and Context Free Language Recursively Enumerable Language and Turing Machine
Operating Systems
Process Concepts and Cpu Scheduling Synchronization and Concurrency Deadlocks Memory Management File System IO and Protection
Algorithms
Complexity Analysis and Asymptotic Notations Searching and Sorting Divide and Conquer Method Greedy Method Dynamic Programming P and NP Concepts
Digital Logic
Number Systems Boolean Algebra K Maps Combinational Circuits Sequential Circuits
Database Management System
Er Diagrams Functional Dependencies and Normalization Structured Query Language Relational Algebra Transactions and Concurrency File Structures and Indexing
Data Structures
Arrays Stacks and Queues Linked List Trees Graphs Hashing
Computer Networks
Concepts of Layering Lan Technologies and Wi-Fi Data Link Layer and Switching Network Layer Routing Algorithm TCP UDP Sockets and Congestion Control Application Layer Protocol Network Security
Software Engineering
Software Engineering
Compiler Design
Lexical Analysis Parsing Syntax Directed Translation Code Generation and Optimization
Web Technologies
Web Technologies
General Aptitude
Numerical Ability Logical Reasoning Verbal Ability
Discrete Mathematics
Graph Theory Set Theory & Algebra Combinatorics Mathematical Logic Probability Linear Algebra Calculus
Programming Languages
Basic of Programming Language Function and Recursion Pointer and Structure in C
Computer Organization
Computer Arithmetic Memory Interfacing Machine Instructions and Addressing Modes IO Interface Pipelining Alu Data Path and Control Unit Secondary Memory
EXAM MAP
Joint Entrance Examination
JEE MainJEE AdvancedWB JEEBITSATMHT CETKCETCOMEDKVITEEEAP EAPCET
Medical
NEETAIIMS
Graduate Aptitude Test in Engineering
GATE CSEGATE ECEGATE EEGATE MEGATE CEGATE PIGATE IN
Civil Services
UPSC Civil Service
Defence
NDA
Staff Selection Commission
SSC CGL Tier I
CBSE
Class 12