# Questions by vinay chauhan

1
Galvin, 9th edition on page 146 states that Shared memory can be faster than message passing, since message-passing systems are typically implemented using system calls and thus require the more time-consuming task of kernel intervention. In shared-memory systems, system ... I agree that shared memory is bound to be faster, but aren't the mutex and semaphore calls require Kernel intervention?
2
Can anyone please compare the level of Questions in BARC and ISRO.
3
Does anyone have any idea on what is the cut off for BARC interview via gate score?
4
Let L = (0+1)*1(0+1)^(n−1) and following statements regrading language L: The language L can be recognised by a non-deterministic automaton with (n+1) states. Deterministic automaton recognises this language must have at least 2^n states. (Assume n≥1). Which of the following statement(s) is/ ... -------------- According to me, L can be written as (0+1)*1(0+1)* which makes option D most suitable.
5
Is different 2 phase locking a subset of each other? For example, if the schedule is Strict 2PL then it will also be simple 2PL. Something like a 2PL is a subset of Strict 2PL is a subset of rigorous 2PL.
6
How many bits can a 2-dimensional parity detect and correct? Is there any general formula for no of bit detection and correction for N-dimensional parity?
1 vote
7
Consider the following grammar G shown Below : S → abS | ScS | d | c The number of terminals in follow set of non-terminal S is ___________________ Is “\$” symbol considered terminal?
8
Consider the following schedules: S1: r1(A); r1(B); w1(C); w2(D); w1(A); w2(A); r1(D); S2: r1(A); r1(B); r1(C); r1(D); w1(A); w2(B); w3(C); w4(D) Which of the following option is correct? S1 has blind writes ... dba.stackexchange.com/questions/115435/what-is-meant-by-a-blind-write-in-a-schedule also implies that the blind writes are considered at transaction level in the schedule. Please confirm.
1 vote