How many serial schedules are possible using n-transactions? – McqOptions

MCQOPTIONS

1.	How many serial schedules are possible using n-transactions?
A.	(n-1)!
B.	n!
C.	n(n-1)!
D.	n(n+1)! / 2
Answer» C. n(n-1)!

Discussion

No Comment Found

Related MCQs

Consider the following circuit. Which one of the following is true?
Identify which of the following prime implicant is not valid?
The following truth table represents the Boolean function
What is the minimum number of 2 – input NAND gates are required for realizing the following function?
Consider the following circuit composed of XOR gates and non-inverting buffers.
Consider the following circuit. Except the Buffers, no gate and no connecting lead is having the delay and All inputs and outputs of gates are zero initially. Consider the timining diagram X has made. How many changes does Y undergone?
The following diagram shows, which addressing mode?
Consider on (n+k) bit instruction with a k-bit opcode and single n-bit address. Then this instruction allows…………….. Operations and …………… addressable memory cells.?
Consider the combinational decoder, then find out the expression for the function.
Consider the following state table. What will be the minimum length of input required to table the machine into state ‘C’?