Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Filter
Profile
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
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?
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...
1.2k
views
commented
May 6, 2019
Operating System
operating-system
process-synchronization
semaphore
shared-memory
+
–
0
answers
2
Level of Questions
Can anyone please compare the level of Questions in BARC and ISRO.
Can anyone please compare the level of Questions in BARC and ISRO.
539
views
asked
Feb 19, 2019
BARC
isro-preparation
barc-preparation
+
–
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$
If $C$ is a skew-symmetric matrix of order $n$ and $X$ is $n\times 1$ column matrix, then $X{^T} CX$ is ascalar matrixnull matrixunit matrixmatrix will all elements $1$
2.7k
views
commented
Feb 17, 2019
Linear Algebra
isrodec2017
matrix
+
–
0
answers
4
BARC interview
Does anyone have any idea on what is the cut off for BARC interview via gate score?
Does anyone have any idea on what is the cut off for BARC interview via gate score?
636
views
commented
Feb 13, 2019
BARC
interview
cutoffs
+
–
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
Consider the following two statements about database transaction schedules:Strict two-phase locking protocol generates conflict serializable schedules that are also recov...
17.7k
views
commented
Feb 7, 2019
Databases
gatecse-2019
databases
transaction-and-concurrency
1-mark
+
–
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
with respect to the B+ TREE index method .select the true statements?1 records are physically stored in primary key order2 B+ tree use a hashing algo.3 the index tree may...
1.2k
views
commented
Feb 2, 2019
2
answers
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 ___________.
The number of possible commutative binary operations that can be defined on a set of $n$ elements (for a given $n$) is ___________.
6.6k
views
commented
Feb 1, 2019
Set Theory & Algebra
gate1989
descriptive
set-theory&algebra
binary-operation
+
–
0
answers
8
Self Doubt
Is the dual of TOSET, a TOSET always?
Is the dual of TOSET, a TOSET always?
342
views
commented
Jan 31, 2019
Set Theory & Algebra
partial-order
+
–
0
answers
9
Partial order
242
views
commented
Jan 31, 2019
2
answers
10
MadeEasy Subject Test: Computer Networks - Routing
please explain the answer thnx.
please explain the answerthnx.
873
views
commented
Jan 30, 2019
Computer Networks
made-easy-test-series
computer-networks
routing
+
–
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?
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 su...
2.8k
views
commented
Jan 29, 2019
Theory of Computation
theory-of-computation
recursive-and-recursively-enumerable-languages
context-sensitive
context-sensitive-languages
closure-property
+
–
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
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 o...
2.8k
views
answered
Jan 27, 2019
Operating System
operating-system
context-switch
process-scheduling
+
–
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
Which of the following statements on Viable Prefixes is incorrect?A viable prefix does not extend past the right end of the handleFor any context-free grammar, the set of...
1.6k
views
commented
Jan 26, 2019
Compiler Design
go-mockgate-1
lr-parser
compiler-design
parsing
viable-prefix
+
–
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
S - >aSb | cGive viable prefix for this with details of how to find viable prefix? for string - - aacbb
756
views
commented
Jan 26, 2019
Compiler Design
compiler-design
viable-prefix
zeal-workbook
+
–
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
given GrammarE → E + EE → E * EE → ( E )E → idFind set of handles and viable prefixes for the input string id1 + id2 * id3
4.4k
views
commented
Jan 26, 2019
Compiler Design
compiler-design
viable-prefix
+
–
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.
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 i...
6.0k
views
commented
Jan 25, 2019
Theory of Computation
nielit2017dec-scientistb
theory-of-computation
finite-automata
npda
dpda
+
–
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
Which of the following problems is/are P-problems?I. Equivalence of DFA'sII. Equivalence of NFAIII. Equivalence of RE(a) Only I(b) Only I and II(c) Only II and III(d) All...
343
views
answered
Jan 25, 2019
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.
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 outputii...
474
views
commented
Jan 25, 2019
Digital Logic
testbook-test-series
digital-logic
digital-counter
+
–
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 ?
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...
927
views
commented
Jan 23, 2019
Programming in C
tree-traversal
binary-tree
+
–
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.
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. Determinis...
344
views
asked
Jan 22, 2019
Theory of Computation
finite-automata
theory-of-computation
+
–
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 _______.
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 with...
18.3k
views
commented
Jan 21, 2019
Computer Networks
gatecse-2014-set2
computer-networks
numerical-answers
lan-technologies
ethernet
normal
+
–
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
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 ...
1.1k
views
commented
Jan 19, 2019
Operating System
go-mockgate-1
context-switch
operating-system
+
–
0
answers
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.
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...
610
views
asked
Jan 18, 2019
Databases
databases
2phaselocking
transaction-and-concurrency
concurrency
+
–
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$
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...
413
views
commented
Jan 15, 2019
Algorithms
tbb-algorithms-2
+
–
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
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 ...
13.6k
views
commented
Jan 8, 2019
Theory of Computation
gatecse-2001
theory-of-computation
decidability
normal
+
–
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?
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.8k
views
comment edited
Jan 4, 2019
Computer Networks
computer-networks
error-detection
error-correction
+
–
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?
Consider the following grammar G shown Below :S → abS | ScS | d | cThe number of terminals in follow set of non-terminal S is ___________________ Is “$” symbol cons...
1.3k
views
commented
Dec 30, 2018
Compiler Design
first-and-follow
made-easy-test-series
grammar
+
–
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 )$
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 ...
466
views
commented
Dec 27, 2018
Theory of Computation
tbb-mockgate-4
theory-of-computation
finite-automata
minimal-state-automata
+
–
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 )$
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\lo...
915
views
commented
Dec 19, 2018
DS
tbb-mockgate-4
time-complexity
binary-heap
+
–
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
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 (w...
684
views
commented
Dec 18, 2018
GATE
tbb-mockgate-3
computer-networks
tcp
sliding-window
+
–
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register