GATE CSE 2015 Set 2 | Transactions and Concurrency Question 11 | Database Management System

GATE CSE 2015 Set 2

MCQ (Single Correct Answer)

-0.3

Consider the following transaction involving two bank accounts x and y.

read (x) ; x: = x - 50; write (x); read (y); y: = y + 50;   write (y)

The constraint that the sum of the accounts x and y should remain constant is that of

Atomicity

Consistency

Isolation

Durability

GATE CSE 2010

MCQ (Single Correct Answer)

-0.3

Which of the following concurrency control protocols ensure both conflict serializability and freedom from deadlock?

I. 2-phase locking
II. Time-stamp ordering

I only

II only

Both I and II

Neither I nor II

GATE CSE 2005

MCQ (Single Correct Answer)

-0.3

Amongst the ACID properties of a transaction, the 'Durability' property requires that the changes made to the database by a successful transaction persist

Except in case of an Operating System crash

Except in case of a Disk crash

Except in case of a power failure

Always, even if there is a failure of any kind

GATE CSE 2004

MCQ (Single Correct Answer)

-0.3

Which level of locking provides the highest degree of concurrency in a relational database?

Page.

Table.

Row.

Page, table and row level locking allow the same degree of concurrency.

PREVIOUS NEXT

GATE CSE Subjects

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

Theory of Computation

Finite Automata and Regular Language Push Down Automata and Context Free Language Recursively Enumerable Language and Turing Machine Undecidability

Operating Systems

Process Concepts and Cpu Scheduling Synchronization and Concurrency File System IO and Protection Deadlocks Memory Management

Digital Logic

Number Systems Boolean Algebra K Maps Combinational Circuits Sequential Circuits

Computer Organization

Computer Arithmetic Memory Interfacing Pipelining Machine Instructions and Addressing Modes Alu Data Path and Control Unit IO Interface Secondary Memory

Database Management System

Structured Query Language Transactions and Concurrency Functional Dependencies and Normalization Relational Algebra File Structures and Indexing Er Diagrams

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

Algorithms

Complexity Analysis and Asymptotic Notations Searching and Sorting Divide and Conquer Method Greedy Method P and NP Concepts Dynamic Programming

Compiler Design

Lexical Analysis Parsing Syntax Directed Translation Code Generation and Optimization

Software Engineering

Web Technologies

General Aptitude

Numerical Ability Verbal Ability