ExamSIDE (Powered by ExamGOAL)
Questions
PREVIOUS NEXT
1
GATE CSE 2007
MCQ (Single Correct Answer)
+2
-0.6
Consider the following schedules involving two transactions. Which one of the following statements is TRUE?

S1: r1(X); r1(Y); r2(Y); r2(X); w2(Y); w1(X);

S2: r1(X); r2(X); r2(Y); w2(Y); r1(Y); w1(X);

A
Both S1 and S2 are conflict serializable.
B
S1 is conflict serializable and S2 is not conflict serializable.
C
S1 is not conflict serializable and S2 is conflict serializable.
D
Both S1 and S2 are not conflict serializable.
2
GATE CSE 2007
MCQ (Single Correct Answer)
+2
-0.6
Consider the following two transactions: T1 and T2. 
T1: read (A);                  T2: read (B);
    read (B);                      read (A);
    if A = 0 then B ← B + 1;       if B ≠ 0 then A ← A - 1;
    write (B);                     write (A);
Which of the following schemes, using shared and exclusive locks, satisfy the requirements for strict two phase locking for the above transactions?
A
S1 : lockS(A); 	        S2 : lockS(B);
     read (A);               read (B);
     lockS(B);               lockS(A);
     read (B);               read (A);
     if A = 0                if B ≠ 0
     then B ← B + 1;        then A ← A - 1;
     write (B);              write (A);
     commit;                 commit;
     unlock (A);             unlock (B);
     unlock (B);             unlock (A);
B
S1 : lockX(A);          S2 : lockX(B);
     read (A);               read (B);
     lockX(B);               lockX(A);
     read (B);               read (A);
     if A = 0                if B ≠ 0
     then B ← B + 1;        then A ← A - 1;
     write (B);              write (A);
     unlock (A);             unlock (A);
     commit;                 commit;
     unlock (B);             unlock (A);
C
S1 : lockS(A);           S2 : lockS(B);
     read (A);                read (B);
     lockX(B);                lockX(A);
     read (B);                read (A);
     if A = 0                 if B ≠ 0
     then B ← B + 1;         then A ← A - 1;
     write (B);               write (A);
     unlock (A);              unlock (B);
     commit;                  commit;
     unlock (B);              unlock (A);
D
S1 : lockS(A);           S2 : lockS(B);
     read (A);                read (B);
     lockX(B);                lockX(A);
     read (B);                read (A);
     if A = 0                 if B ≠ 0
    then B ← B + 1;        then A ← A - 1;
     write (B);               write (A);                                                                                                     
     unlock (A);              unlock (A);
     unlock (B);              unlock (B);
     commit;                  commit;
3
GATE CSE 2004
MCQ (Single Correct Answer)
+2
-0.6
Consider the following schedule S of transactions T1 and T2: GATE CSE 2004 Database Management System - Transactions and Concurrency Question 27 English Which of the following is TRUE about the schedule S?
A
S is serializable only as T1,T2
B
S is serializable only as T2,T1
C
S is serializable both as T1, T2 and T2, T2
D
S is not serializable either as T1 or as T2
4
GATE CSE 2003
MCQ (Single Correct Answer)
+2
-0.6
Consider three data items D1, D2, and D3, and the following execution schedule of transactions T1, T2, and T3. In the diagram, R(D) and W(D) denote the actions reading and writing the data item D respectively. GATE CSE 2003 Database Management System - Transactions and Concurrency Question 28 English

Which of the following statements is correct?

A
The schedule is serializable as T2; T3; T1
B
The schedule is serializable as T2; T1; T3
C
The schedule is serializable as T3; T2; T1
D
The schedule is not serializable
PREVIOUS 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
Network Security Data Link Layer and Switching Application Layer Protocol Network Layer Routing Algorithm Concepts of Layering Lan Technologies and Wi-Fi TCP UDP Sockets and Congestion Control
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
Mathematical Logic Probability Set Theory & Algebra Combinatorics Linear Algebra Graph Theory 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