Dark Mode

Recent activity by vinay chauhan

0 answers

1

Operating System - Galvin - Chapter 3
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 ... that shared memory is bound to be faster, but aren't the mutex and semaphore calls require Kernel intervention?

commented in Operating System May 6, 2019

904 views

0 answers

2

Level of Questions
Can anyone please compare the level of Questions in BARC and ISRO.

asked in BARC Feb 19, 2019

453 views

3 answers

3

ISRO-DEC2017-17
If $C$ is a skew-symmetric matrix of order $n$ and $X$ is $n\times 1$ column matrix, then $X{^T} CX$ is a scalar matrix null matrix unit matrix matrix will all elements $1$

commented in Linear Algebra Feb 17, 2019

2.3k views

0 answers

4

BARC interview
Does anyone have any idea on what is the cut off for BARC interview via gate score?

commented in BARC Feb 13, 2019

444 views

5 answers

5

GATE CSE 2019 | Question: 11
Consider the following two statements about database transaction schedules: Strict two-phase locking protocol generates conflict serializable schedules that are also recoverable. Timestamp-ordering concurrency control protocol with Thomas' Write Rule can generate view serializable ... the above statements is/are TRUE? I only II only Both I and II Neither I nor II

commented in Databases Feb 8, 2019

13.8k views

1 answer

6

b + TREE explain..??
with respect to the B+ TREE index method .select the true statements? 1 records are physically stored in primary key order 2 B+ tree use a hashing algo. 3 the index tree may become unbalanced as a result of updates 4 none of the above

commented in Databases Feb 2, 2019

956 views

1 answer

7

GATE CSE 1989 | Question: 1-v
The number of possible commutative binary operations that can be defined on a set of $n$ elements (for a given $n$) is ___________.

commented in Set Theory & Algebra Feb 1, 2019

4.9k views

0 answers

8

Self Doubt
Is the dual of TOSET, a TOSET always?

commented in Set Theory & Algebra Jan 31, 2019

261 views

0 answers

9

commented in Set Theory & Algebra Jan 31, 2019

167 views

2 answers

10

MadeEasy Subject Test: Computer Networks - Routing
please explain the answer thnx.

commented in Computer Networks Jan 30, 2019

520 views

0 answers

11

Are CSL, RE, Recursive languages closed under Subset operation?
Regular languages are not closed under Subset - Example anbn is subset of a*b* which is non-regular. DCFL/CFL languages are not closed under Subset - Example anbncn is subset of anbnc* which is non-cfl. Are the languages CSL,Recursive or Recursively Enumerable lanuages closed under Subset operation?

commented in Theory of Computation Jan 29, 2019

2.2k views

4 answers

12

operating system cpu utilization
in a round robin scheduling s represents the time of context switching, q represents the time quantum and r represents the average time the process runs before blocking on i/o. if s<q<r, then cpu efficiency? a )q/q+s b) q/r+s c) r/r+s d) qr/r+s

answered in Operating System Jan 27, 2019

2.4k views

1 answer

13

GATE Overflow | Mock GATE | Test 1 | Question: 57
Which of the following statements on Viable Prefixes is incorrect? A viable prefix does not extend past the right end of the handle For any context-free grammar, the set of viable prefixes is a regular language A viable prefix by default is a suffix of the handle As long as a parser has viable prefixes on the stack no parsing error has been detected

commented in Compiler Design Jan 26, 2019

864 views

1 answer

14

Compiler Zeal sheet
S - >aSb | c Give viable prefix for this with details of how to find viable prefix? for string - - aacbb

commented in Compiler Design Jan 26, 2019

447 views

4 answers

15

#compiler
given Grammar E → E + E E → E * E E → ( E ) E → id Find set of handles and viable prefixes for the input string id1 + id2 * id3

commented in Compiler Design Jan 26, 2019

3.3k views

6 answers

16

NIELIT 2017 DEC Scientist B - Section B: 39
Which of the following is true? Mealy and Moore machine are language acceptors. Finite State automata is language translator. NPDA is more powerful than DPDA. Melay machine is more powerful than Moore machine.

commented in Theory of Computation Jan 25, 2019

4.9k views

1 answer

17

theory of computation
Which of the following problems is/are P-problems? I. Equivalence of DFA's II. Equivalence of NFA III. Equivalence of RE (a) Only I (b) Only I and II (c) Only II and III (d) All

answered in Theory of Computation Jan 25, 2019

164 views

1 answer

18

Testbook Test Series: Digital Logic - Digital Counter
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 ... output will be 0,1,2,3.... and if we invert the binary output of each gate then the count is reversed.

commented in Digital Logic Jan 25, 2019

276 views

1 answer

19

Number of Binary tree
Q.Consider a four labeled 1, 2, 3, 4. The number of distinct binary tree are possible such that whose inorder traversal is 1, 2, 3, 4 are _________ Answer must be 14 right ?

commented in Programming Jan 23, 2019

764 views

1 answer

20

Geekforgeeks full length
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 ... ---------- According to me, L can be written as (0+1)*1(0+1)* which makes option D most suitable.

asked in Theory of Computation Jan 22, 2019

171 views

4 answers

21

GATE CSE 2014 Set 2 | Question: 25
In the diagram shown below, $L1$ is an Ethernet LAN and $L2$ is a Token-Ring LAN. An $IP$ packet originates from sender $S$ and traverses to $R$, as shown. The links within each $\text{ISP}$ and across the two $\text{ISP}$s, are all ... $\text{TTL}$ field is $32$. The maximum possible value of the $\text{TTL}$ field when $R$ receives the datagram is _______.

commented in Computer Networks Jan 21, 2019

14.4k views

1 answer

22

GATE Overflow | Mock GATE | Test 1 | Question: 37
Consider the context switch of a CPU from the context of process $P1$ to that of process $P2$. Consider the following two events in the chronological order of the events during the context switch. (P) The Stack Pointer (SP) shifts ... via an atomic hardware instruction The relative ordering of $P$ and $Q$ varies from one context switch to the other

commented in Operating System Jan 19, 2019

730 views

1 answer

23

Self doubt, 2PL
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 in Databases Jan 18, 2019

355 views

3 answers

24

Test by Bikram | Algorithms | Test 2 | Question: 18
The following elements are inserted in sequence to create an AVL tree: $31, 36, 40, 19, 14, 24, 50$ What is the pre-order traversal of the created AVL tree? $36, 19, 14, 31, 24, 40, 50$ $36, 14, 19, 31, 24, 40, 50$ $31, 19, 14, 24, 40, 36, 50$ $31, 19, 14, 24, 36, 40, 50$

commented in Algorithms Jan 15, 2019

193 views

1 answer

25

GATE CSE 2001 | Question: 2.7
Consider the following problem $X$. Given a Turing machine $M$ over the input alphabet $\Sigma$, any state $q$ of $M$ and a word $w \in \Sigma^*$, does the computation of $M$ on $w$ visit the state of $q$? Which of the ... ? $X$ is decidable $X$ is undecidable but partially decidable $X$ is undecidable and not even partially decidable $X$ is not a decision problem

commented in Theory of Computation Jan 8, 2019

11.5k views

1 answer

26

Parity Check Self Doubt
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?

comment edited in Computer Networks Jan 4, 2019

1.1k views

1 answer

27

MadeEasy Test Series: Compiler Design - Grammar
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?

commented in Compiler Design Dec 30, 2018

939 views

2 answers

28

Test by Bikram | Mock GATE | Test 4 | Question: 23
The definition of a language $N$ with alphabet set $\left \{ x \right \}$ is given below: $N= \{ x^{mp} \mid p > \: 0, \text{where m is a positive integer constant} \}$ The minimum number of states needed in a $\text{DFA}$ to recognize $N$ is _________. $p+m$ $p+1$ $m+1$ $2^\left ( p+1 \right )$

commented in Theory of Computation Dec 27, 2018

218 views

3 answers

29

Test by Bikram | Mock GATE | Test 4 | Question: 5
The time complexity of the best known algorithm to find $p^{th}$ ${\left ( p<n \right )}$ smallest element from a $minheap$ of $n$ elements is _______. $\Theta\left ( p\log p \right )$ $\Theta\left ( p\log n \right )$ $\Theta\left ( pn \right )$ $\Theta\left ( n\log p \right )$

commented in DS Dec 19, 2018

493 views

1 answer

30

Test by Bikram | Mock GATE | Test 3 | Question: 52
Read the below mentioned statements: The size of the $TCP$ advertised window never changes throughout the duration of the connection. With the Selective Repeat protocol (which uses selective acknowledgement) it is not possible for the sender to receive ... current window. Which of the above statements is FALSE? I and II II only II and III I only

commented in GATE Dec 18, 2018

308 views