search
Log In

Questions by vinay chauhan

0 votes
0 answers
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?
asked May 5, 2019 in Operating System 167 views
0 votes
0 answers
2
Can anyone please compare the level of Questions in BARC and ISRO.
asked Feb 19, 2019 in BARC 264 views
0 votes
0 answers
3
Does anyone have any idea on what is the cut off for BARC interview via gate score?
asked Feb 12, 2019 in BARC 272 views
0 votes
1 answer
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.
asked Jan 22, 2019 in Theory of Computation 58 views
0 votes
0 answers
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.
asked Jan 18, 2019 in Databases 98 views
0 votes
1 answer
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?
asked Jan 4, 2019 in Computer Networks 321 views
1 vote
1 answer
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?
asked Dec 30, 2018 in Compiler Design 293 views
0 votes
0 answers
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.
asked Nov 11, 2018 in Databases 92 views
1 vote
0 answers
9
The keys 44, 63, 29, 78, 23, 6, 81, 14, 13, 12 and 52 are inserted into an initially empty hash table of length 12 using linear probing with hash function h(k)= k mod 12. What is the probability that the 10th slot will be filled next? i. 11/12 ii. 1 ... slot is left which have a probability of filling as 1 because no matter what index we get for the next insert we are going to fill 10th slot only.
asked Oct 31, 2018 in DS 232 views
0 votes
1 answer
10
A ripple counter with J-K flip-flop can be made to count down rather than up by i. Connecting the Q dash output to the input of the next stage, rather than the Q output ii. Making the output transition to occur at the rising edge rather than the falling edge iii. Designing ... for up counter the output will be 0,1,2,3.... and if we invert the binary output of each gate then the count is reversed.
asked Oct 28, 2018 in Digital Logic 127 views
–1 vote
0 answers
11
I am looking for an online coaching for GATE is there anyone here who can suggest and review some of the online coaching options I have for example gate forums eGATE plus etc...are they worth enrolling I am targeting GATE 2019.
asked Feb 2, 2018 in Others 642 views
...