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
Answers by shivam001
User shivam001
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
User shivam001
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
0
votes
1
No. of states in the minimal finite automata which accepts the binary strings whose equivalent is divisible by 32 is ________?
answered
3 days
ago
in
Theory of Computation

1.1k
views
theoryofcomputation
finiteautomata
0
votes
2
GATE200336
How many perfect matching are there in a complete graph of $6$ vertices? $15$ $24$ $30$ $60$
answered
4 days
ago
in
Graph Theory

5.2k
views
gate2003
graphtheory
graphmatching
normal
0
votes
3
TIFR2019A11
Suppose there are $n$ guests at a party (and no hosts). As the night progresses, the guests meet each other and shake hands. The same pair of guests might shake hands multiple times. for some parties stretch late into the night , and it is hard to keep track.Still, they don't shake ... $2 \mid \text{Even} \mid  \mid \text{Odd} \mid$ $2 \mid \text{Odd} \mid  \mid \text{Even} \mid$
answered
6 days
ago
in
Numerical Ability

316
views
tifr2019
generalaptitude
numericalability
logicalreasoning
0
votes
4
Exam Approach
As I have no prior knowledge of TIFR pattern then any suggestion from any experienced practitioner of TIFR that how much time to be given for Section A and Section B of 15 question each ? Which to pick 1st and which to next ? Any othet points are appreciated :)
answered
Dec 7
in
TIFR

62
views
0
votes
5
TIFR Exam Pattern
If anyone had analysed the previous TIFR papers, which subjects/topics of GATE they dont or rarely ask ? Please do share.
answered
Dec 6
in
TIFR

139
views
0
votes
6
GATE2016210
A processor has $40$ distinct instruction and $24$ general purpose registers. A $32$bit instruction word has an opcode, two registers operands and an immediate operand. The number of bits available for the immediate operand field is_______.
answered
Dec 5
in
CO and Architecture

3.2k
views
gate20162
machineinstructions
coandarchitecture
easy
numericalanswers
0
votes
7
GATE200772
Consider the following program segment. Here $\text{R1, R2}$ and $\text{R3}$ ... memory is word addressable. After the execution of this program, the content of memory location $2010$ is: $100$ $101$ $102$ $110$
answered
Dec 5
in
CO and Architecture

2.5k
views
gate2007
coandarchitecture
machineinstructions
interrupts
normal
0
votes
8
GATE2016130
Consider the two cascade $2$ to $1$ multiplexers as shown in the figure . The minimal sum of products form of the output $X$ is $\overline{P} \ \overline {Q}+PQR$ $\overline{P} \ {Q}+QR$ $PQ +\overline{P} \ \overline{Q}R$ $\overline{Q} \ \overline{R} + PQR$
answered
Nov 23
in
Digital Logic

2.9k
views
gate20161
digitallogic
multiplexer
normal
0
votes
9
GATE20012.11
Consider the circuit shown below. The output of a $2:1$ MUX is given by the function $(ac' + bc)$. Which of the following is true? $f=X_1'+X_2$ $f=X_1'X_2+X_1X_2'$ $f=X_1X_2+X_1'X_2'$ $f=X_1+X_2'$
answered
Nov 23
in
Digital Logic

2.3k
views
gate2001
digitallogic
normal
multiplexer
0
votes
10
GATE201618
We want to design a synchronous counter that counts the sequence $010203$ and then repeats. The minimum number of $\text{JK}$ flipflops required to implement this counter is _____________.
answered
Nov 23
in
Digital Logic

16.5k
views
gate20161
digitallogic
digitalcounter
flipflop
normal
numericalanswers
0
votes
11
How to calculate propogation delay for a synchronous counter ?
answered
Nov 23
in
Digital Logic

181
views
0
votes
12
GATE2010 TF: GA10
A student is answering a multiple choice examination with $65$ questions with a marking scheme as follows$:$ $i)$ $1$ marks for each correct answer $,ii)$ $\frac{1}{4}$ for a wrong answer $,iii)$ $\frac{1}{8}$ for a question that has not been attempted ... gets $37$ marks in the test then the least possible number of questions the student has NOT answered is$:$ $6$ $5$ $7$ $4$
answered
Nov 18
in
Numerical Ability

75
views
generalaptitude
numericalability
gate2010tf
numericalcomputation
0
votes
13
GOCompiler1: Parsing3
Which of the following statements is FALSE? Any DCFL has an equivalent grammar that can be parsed by a SLR(1) parser with end string delimiter Languages of grammars parsed by LR(2) parsers is a strict super set of the languages of grammars parsed by LR(1) parsers ... parsed by LL(1) parsers There is no DCFL which is not having a grammar that can be parsed by a LR(1) parser
answered
Nov 16
in
Compiler Design

298
views
go2019cd1
parsing
0
votes
14
GOCompiler1: Parsing14
Which of the below relations does hold TRUE regarding GRAMMARS? $LL(1) \subset SLR(1) \subset LR(1)$ $SLR(1) \subset \epsilon\text{free}\; LL(1) \subset LR(1)$ $\epsilon\text{free}\;LL(1) \subset SLR(1) \subset LR(1)$ $LL(1) \subset SLR(1) = LR(1)$
answered
Nov 16
in
Compiler Design

207
views
go2019cd1
0
votes
15
Operating Systems concepts(Galvin)
Hello I am reading chapters from Galvin and attempting its back exercises. However, there is nothing to compare my answers to, I mean there are no answers given anywhere. Do you guys have any idea of any answer key thank you
answered
Nov 8
in
Operating System

530
views
operatingsystem
0
votes
16
GATE2015225
A computer system implements a $40bit$ virtual address, page size of $8$ $\text{kilobytes}$, and a $128entry$ translation lookaside buffer ($TLB$) organized into $32$ sets each having $4$ ways. Assume that the $TLB$ tag does not store any process id. The minimum length of the $TLB$ tag in bits is ____.
answered
Nov 4
in
Operating System

5.3k
views
gate20152
operatingsystem
virtualmemory
easy
numericalanswers
0
votes
17
single precision number Made easy CBT 2019
how to solve this
answered
Nov 2
in
Digital Logic

196
views
floatingpointrepresentation
0
votes
18
GATE2014131
An operating system uses the Banker's algorithm for deadlock avoidance when managing the allocation of three resource types $X, Y,$ and $Z$ to three processes $P0, P1,$ and $P2.$ The table given below presents the current system state. Here, the ... REQ1 can be permitted. Only REQ2 can be permitted. Both REQ1 and REQ2 can be permitted. Neither REQ1 nor REQ2 can be permitted.
answered
Oct 31
in
Operating System

4.6k
views
gate20141
operatingsystem
resourceallocation
normal
0
votes
19
cpu scheduling
explanation please...??? and what is the difference between convoy effect and starvation?
answered
Oct 31
in
Operating System

889
views
cpuscheduling
operatingsystem
+1
vote
20
GATE200012
An instruction pipeline has five stages where each stage take 2 nanoseconds and all instruction use all five stages. Branch instructions are not overlapped. i.e., the instruction after the branch is not fetched till the branch instruction is completed. ... and 50% of the conditional branch instructions are such that the branch is taken, calculate the average instruction execution time.
answered
Oct 31
in
CO and Architecture

5k
views
gate2000
coandarchitecture
pipelining
normal
descriptive
0
votes
21
GATE2014343
An instruction pipeline has five stages, namely, instruction fetch (IF), instruction decode and register fetch (ID/RF), instruction execution (EX), memory access (MEM), and register writeback (WB) with stage latencies $1$ ns, $2.2 $ ns, $2$ ns, $1$ ... of this program on the old and the new design are $P$ and $Q$ nanoseconds, respectively. The value of $P/Q$ is __________.
answered
Oct 20
in
CO and Architecture

6.7k
views
gate20143
coandarchitecture
pipelining
numericalanswers
normal
+1
vote
22
GATE201064
$5$ skilled workers can build a wall in $20$ days; $8$ semiskilled workers can build a wall in $25$ days; $10$ unskilled workers can build a wall in $30$ days. If a team has $2$ skilled, $6$ semiskilled and $5$ unskilled workers, how long it will take to build the wall? $20$ days $18$ days $16$ days $15$ days
answered
Oct 2
in
Numerical Ability

2.2k
views
gate2010
numericalability
normal
worktime
+1
vote
23
GATE2015 EC2: GA 8
A tiger is $50$ leaps of its own behind a tree. The tiger takes $5$ leaps per minute to the deer's $4.$ If the tiger and the deer cover $8$ meter and $5$ meter per leap respectively, what distance in meters will the tiger have to run before it catches the deer$?$
answered
Sep 29
in
Numerical Ability

1.7k
views
gate2015ec2
numericalability
numericalanswers
speedtimedistance
+1
vote
24
GATE2014 EC1: GA9
The exports and imports (in crores of Rs.) of a country from $2000$ to $2007$ are given in the following bar chart. If the trade deficit is defined as excess of imports over exports, in which year is the trade deficit $1/5$th of the exports? $2005$ $2004$ $2007$ $2006$
answered
Sep 26
in
Numerical Ability

848
views
gate2014ec1
numericalability
datainterpretation
bargraph
normal
0
votes
25
ISRO 2008 ECE Odd parity
Odd parity generator uses _____ logic (a) XNOR (b) XOR (c) Sequential (d) OR
answered
Sep 19
in
Digital Logic

827
views
isroece
digitallogic
0
votes
26
GATE19991.10
Which of the following disk scheduling strategies is likely to give the best throughput? Farthest cylinder next Nearest cylinder next First come first served Elevator algorithm
answered
Sep 17
in
Operating System

2.8k
views
gate1999
operatingsystem
diskscheduling
normal
0
votes
27
pseudo code
int zap(int n) { if (n<=1) then zap =1; else zap = zap(n3)+zap(n1); } then the call zap(6) gives the values of zap Give the proper explanation
answered
Sep 11
in
Programming

134
views
programminginc
recursion
0
votes
28
GATE2017135
Consider the following two functions. void fun1(int n) { if(n == 0) return; printf("%d", n); fun2(n  2); printf("%d", n); } void fun2(int n) { if(n == 0) return; printf("%d", n); fun1(++n); printf("%d", n); } The output printed when $\text{fun1}(5)$ is called is $53423122233445$ $53423120112233$ $53423122132435$ $53423120213243$
answered
Sep 11
in
Programming

5.3k
views
gate20171
programming
normal
tricky
recursion
+1
vote
29
GATE19937.9, UGCNETDec2012III41
Consider a system having m resources of the same type. These resources are shared by $3$ processes $A$,$B$, and $C$ which have peak demands of $3$, $4$ and $6$ respectively. For what value of m deadlock will not occur? $7$ $9$ $10$ $13$ $15$
answered
Aug 18
in
Operating System

8.5k
views
gate1993
operatingsystem
resourceallocation
normal
ugcnetdec2012iii
0
votes
30
GATE201915
For $\Sigma = \{a ,b \}$, let us consider the regular language $L=\{x \mid x = a^{2+3k} \text{ or } x=b^{10+12k}, k \geq 0\}$. Which one of the following can be a pumping length (the constant guaranteed by the pumping lemma) for $L$ ? $3$ $5$ $9$ $24$
answered
Aug 4
in
Theory of Computation

4.6k
views
gate2019
theoryofcomputation
pumpinglemma
0
votes
31
ACE TEST SERIES QUESTION
answered
Aug 1
in
Algorithms

56
views
+1
vote
32
Virtual Gate Test Series: Operating System  ForkJoin Concurrency Structure
Consider the code fragment: count = 3; S1; Fork L1; L1: S3; S2; goto L3; S4; Fork L2; L2: S6; goto L3; S5; L3: join count S7 Which one of the following represents correct precedence graph of the above code fragment? the answer is given but I’m getting where am I wrong?
answered
Jul 24
in
Operating System

229
views
operatingsystem
precedencegraph
fork
concurrency
virtualgatetestseries
0
votes
33
GATE201212
What is the complement of the language accepted by the NFA shown below? Assume $\Sigma = \{a\}$ and $\epsilon$ is the empty string. $\phi$ $\{\epsilon\}$ $a^*$ $\{a , \epsilon\}$
answered
Jul 22
in
Theory of Computation

4.8k
views
gate2012
finiteautomata
easy
theoryofcomputation
0
votes
34
broadcast
In L.B.A. , we send message from a host to all host in the same network. if NID=11.0.0.0 then a/c to definition of L.B.A we should write it as 11.255.255.255 but we write 255.255.255.255 , so it means we send message from a host to entire world's network host , which is wrong a/c to definition??????
answered
Jul 5
in
Computer Networks

608
views
+1
vote
35
GATE201928
Consider three machines M, N, and P with IP addresses $100.10.5.2, \: 100.10.5.5$, and $100.10.5.6$ respectively. The subnet mask is set to $255.255.255.252$ for all the three machines. Which one of the following is true? M, N, and P all belong to the same subnet Only M and N belong to the same subnet Only N and P belong to the same subnet M, N, and P belong to three different subnets
answered
Jun 10
in
Computer Networks

2.1k
views
gate2019
computernetworks
subnetting
0
votes
36
RegulaR Expression
Find the regular expression No 2 a's and 2 b's should come together?
answered
May 21
in
Theory of Computation

798
views
theoryofcomputation
50,645
questions
56,579
answers
195,772
comments
101,775
users