The Gateway to Computer Science Excellence
For all GATE CSE Questions
Toggle navigation
Facebook Login
or
Email or Username
Password
Remember
Login
Register

I forgot my password
Activity
Questions
Unanswered
Tags
Subjects
Users
Ask
Prev
Blogs
New Blog
Exams
Recent activity by vinay chauhan
User vinay chauhan
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
User vinay chauhan
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
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 messagepassing systems are typically implemented using system calls and thus require the more timeconsuming 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
May 6, 2019
in
Operating System

102
views
operatingsystem
processsynchronization
semaphore
sharedmemory
0
answers
2
Level of Questions
Can anyone please compare the level of Questions in BARC and ISRO.
asked
Feb 19, 2019
in
BARC

139
views
isropreparation
barcpreparation
3
answers
3
ISRODEC201717
If $C$ is a skewsymmetric 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
Feb 17, 2019
in
Linear Algebra

1.7k
views
isrodec2017
matrices
0
answers
4
BARC interview
Does anyone have any idea on what is the cut off for BARC interview via gate score?
commented
Feb 13, 2019
in
BARC

187
views
interview
cutoffs
3
answers
5
GATE201911
Consider the following two statements about database transaction schedules: Strict twophase locking protocol generates conflict serializable schedules that are also recoverable. Timestampordering concurrency control protocol with Thomas' Write Rule can generate view serializable schedules that are ... of the above statements is/are TRUE? I only II only Both I and II Neither I nor II
commented
Feb 8, 2019
in
Databases

2.9k
views
gate2019
databases
transactions
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
Feb 2, 2019
in
Databases

350
views
1
answer
7
GATE19891v
The number of possible commutative binary operations that can be defined on a set of $n$ elements (for a given n) is ___________.
commented
Feb 1, 2019
in
Set Theory & Algebra

1.8k
views
gate1989
descriptive
settheory&algebra
binaryoperation
0
answers
8
Self Doubt
Is the dual of TOSET, a TOSET always?
commented
Jan 31, 2019
in
Set Theory & Algebra

72
views
partialorder
0
answers
9
Partial order
commented
Jan 31, 2019
in
Set Theory & Algebra

30
views
0
answers
10
MadeEasy Subject Test: Computer Networks  Routing
some one please explain the answer
commented
Jan 30, 2019
in
Computer Networks

151
views
madeeasytestseries
computernetworks
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 nonregular. DCFL/CFL languages are not closed under Subset  Example anbncn is subset of anbnc* which is noncfl. Are the languages CSL,Recursive or Recursively Enumerable lanuages closed under Subset operation?
commented
Jan 29, 2019
in
Theory of Computation

640
views
theoryofcomputation
recursiveandrecursivelyenumerablelanguages
contextsensitive
contextsensitivelanguages
closureproperty
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
Jan 27, 2019
in
Operating System

1k
views
operatingsystem
contextswitch
processschedule
1
answer
13
GO2019FLT157
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 contextfree 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
Jan 26, 2019
in
Compiler Design

199
views
go2019flt1
lrparser
compilerdesign
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
Jan 26, 2019
in
Compiler Design

175
views
compilerdesign
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
Jan 26, 2019
in
Compiler Design

827
views
compilerdesign
viableprefix
2
answers
16
NIELIT ScientistB Dec 2017_60
Which of the following is true ? (A) Mealy and Moore machine are language acceptors (B) Finite State automata is language translator (C) NPDA is more powerful than DPDA (D) Mealy machine is more powerful than Mealy machine
commented
Jan 25, 2019
in
Theory of Computation

781
views
1
answer
17
theory of computation
Which of the following problems is/are Pproblems? 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
Jan 25, 2019
in
Theory of Computation

44
views
1
answer
18
Testbook Test Series: Digital Logic  Digital Counter
A ripple counter with JK flipflop 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
Jan 25, 2019
in
Digital Logic

65
views
testbooktestseries
digitallogic
digitalcounter
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
Jan 23, 2019
in
Programming

411
views
treetraversal
binarytree
0
answers
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 nondeterministic 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
Jan 22, 2019
in
Theory of Computation

18
views
nfadfa
#dfa
theoryofcomputation
4
answers
21
GATE2014225
In the diagram shown below, $L1$ is an Ethernet LAN and $L2$ is a TokenRing 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 pointtopoint ... of the $\text{TTL}$ field is $32$. The maximum possible value of the $\text{TTL}$ field when $R$ receives the datagram is _______.
commented
Jan 21, 2019
in
Computer Networks

6.5k
views
gate20142
computernetworks
numericalanswers
lantechnologies
ethernet
tokenring
normal
0
answers
22
GO2019FLT137
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 from pointing ... occur simultaneously via an atomic hardware instruction The relative ordering of $P$ and $Q$ varies from one context switch to the other
commented
Jan 19, 2019
in
Operating System

188
views
go2019flt1
contextswitch
operatingsystem
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.
asked
Jan 18, 2019
in
Databases

57
views
databases
2phaselocking
transactions
concurrency
1
answer
24
GATE20012.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 following ... correct? $X$ is decidable $X$ is undecidable but partially decidable $X$ is undecidable and not even partially decidable $X$ is not a decision problem
commented
Jan 8, 2019
in
Theory of Computation

3.6k
views
gate2001
theoryofcomputation
decidability
normal
0
answers
25
Parity Check Self Doubt
How many bits can a 2dimensional parity detect and correct? Is there any general formula for no of bit detection and correction for Ndimensional parity?
comment edited
Jan 4, 2019
in
Computer Networks

112
views
computernetworks
errordetection
errorcorrection
1
answer
26
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 nonterminal S is ___________________ Is “$” symbol considered terminal?
commented
Dec 30, 2018
in
Compiler Design

124
views
first
follow
madeeasytestseries
grammar
0
answers
27
Made easy test series
The best effort delivery services such as an IP does not include (a) error checking (b) datagram acknowledgment (c) error correction (d) All of these
commented
Dec 3, 2018
in
Computer Networks

81
views
networkprotocols
computernetworks
0
answers
28
ME: GATE2005
A is a 3 x 4 real matrix and A x = b is an inconsistent system of equations. The highest possible rank of A is:____________
commented
Nov 18, 2018
in
Linear Algebra

708
views
linearalgebra
0
answers
29
Testbook Test Series: Programming & DS  Hashing
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 ... 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.
commented
Nov 15, 2018
in
DS

182
views
testbooktestseries
datastructures
hashing
0
answers
30
GeeksforGeeks test Series.
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 ... .com/questions/115435/whatismeantbyablindwriteinaschedule also implies that the blind writes are considered at transaction level in the schedule. Please confirm.
asked
Nov 11, 2018
in
Databases

53
views
databases
transactionandconcurrency
5
answers
31
#DBMS ER Model  Minimum Number of tables
What are minimum number of tables required for the following given ER models such that they satisfy 1NF ?
commented
Nov 10, 2018
in
Databases

349
views
databases
erdiagram
ertorelational
relational
1
answer
32
ACE Model Grand Test 2003 Operating System
The state of a process during context switching is 1. May be busy 2. May be idle 3. Always idle 4. always busy
commented
Oct 9, 2018
in
Operating System

169
views
operatingsystem
contextswitch
2
answers
33
TIFR2018B8
In an undirected graph $G$ with $n$ vertices, vertex $1$ has degree $1$, while each vertex $2,\ldots,n1$ has degree $10$ and the degree of vertex $n$ is unknown, Which of the following statement must be TRUE on the graph $G$? There is a path from vertex $1$ to ... $n$ has degree $1$. The diameter of the graph is at most $\frac{n}{10}$ All of the above choices must be TRUE
commented
Sep 5, 2018
in
Graph Theory

977
views
tifr2018
graphtheory
degreeofgraph
1
answer
34
GATE200467
The microinstructions stored in the control memory of a processor have a width of $26$ bits. Each microinstruction is divided into three fields: a microoperation field of $13$ bits, a next address field $(X),$ and a MUX select field $(Y).$ There are $8$ status bits in the input of ... size of the control memory in number of words? $10, 3, 1024$ $8, 5, 256$ $5, 8, 2048$ $10, 3, 512$
commented
Aug 25, 2018
in
CO and Architecture

4.3k
views
gate2004
coandarchitecture
microprogramming
normal
9
answers
35
GATE200369
The following are the starting and ending times of activities $A, B, C, D, E, F, G$ and $H$ ... in a room only if the room is reserved for the activity for its entire duration. What is the minimum number of rooms required? $3$ $4$ $5$ $6$
answered
Aug 13, 2018
in
Algorithms

3.4k
views
gate2003
algorithms
normal
greedyalgorithm
0
answers
36
Preparation
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

440
views
gatepreparation
general
50,741
questions
57,234
answers
197,994
comments
104,580
users