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

I forgot my password
All Activity
Questions
Unanswered
Tags
Subjects
Users
Ask
Previous
Blogs
New Blog
Exam Category
Exams
First time here? Checkout the
FAQ
!
x
×
Close
Use the google search bar on side panel. It searches through all previous GATE/other questions.
Recent activity by Kapil
User Kapil
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
User Kapil
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
2
answers
1
TIFR2017B1
A vertex colouring with three colours of a graph $G=(V, E)$ is a mapping $c: V \rightarrow \{R, G, B\}$ so that adjacent vertices receive distinct colours. Consider the following undirected graph. How many vertex colouring with three colours does this graph have? $3^9$ $6^3$ $3 \times 2^8$ $27$ $24$
answer edited
1 day
ago
in
Graph Theory

321
views
tifr2017
graphtheory
graphcoloring
1
answer
2
How to draw register allocation interference graph ?
answer selected
Nov 9
in
Compiler Design

225
views
compilerdesign
registerallocation
3
answers
3
TIFR2016A15
In a tournament with 7 teams, each team plays one match with every other team. For each match, the team earns two points if it wins, one point if it ties, and no points if it loses. At the end of all matches, the teams are ordered in ... the minimum total number of points a team must earn in order to be guaranteed a place in the next round? 13 12 11 10 9
answer selected
Nov 2
in
Combinatory

204
views
tifr2016
permutationsandcombinations
2
answers
4
ISRO200836
An interrupt in which the external device supplies its address as well as the interrupt requests is known as vectored interrupt maskable interrupt non maskable interrupt designated interrupt
answer selected
Oct 31
in
CO & Architecture

1k
views
isro2008
coandarchitecture
iohandling
interrupts
3
answers
5
GATE200389
Consider the C program shown below: #include<stdio.h> #define print(x) printf("%d", x) int x; void Q(int z) { z+=x; print(z); } void P(int *y) { int x = *y + 2; Q(x); *y = x  1; print(x); } main(void) { x = 5; P(&x); print(x); } The output of this program is 12 7 6 22 12 11 14 6 6 7 6 6
commented
Oct 27
in
Programming

1.5k
views
gate2003
programming
programminginc
normal
1
answer
6
BottomUp Parsing
Consider the folllowing grammar $ S\rightarrow AaS \ \ b$ $ A\rightarrow c \ \ d \ B$ $ B\rightarrow AgC \ \ AhC \  \ DgC  \ DhC$ $C\rightarrow c \ \ d \  \ D$ $ D\rightarrow eBf$ Which of the following are viable prefix ? $ \left ( 1 \right )Aab$ $ \left ( 2 \right )ca$ $ \left ( 3 \right )cab$ $\left ( 4 \right )AgCS$
commented
Oct 14
in
Compiler Design

436
views
compilerdesign
viableprefix
parsing
1
answer
7
algorithms
I think the options given for this questions are incorrect, i thing answer would be nk log nk, please correct me if i'm wrong.
answered
Oct 7
in
Algorithms

39
views
0
answers
8
Reducibility
Consider the language L, L = {< M >M is a turing machine and L(M) ≤p {0p 12pp > 0}} Where the symbol ‘≤p’ refers to polynomial time reducible which of the following is true regarding the above language? a. L is undecidable b. L is decidable c. L is regular d. none
commented
Oct 2
in
Theory of Computation

37
views
theoryofcomputation
reduction
2
answers
9
Data structure
Ttotal number of BST's possible with 6 nodes numbered 1,2,3,4,5 and 6 having a height of 4 are ??
commented
Oct 2
in
DS

139
views
1
answer
10
Reducibility
Why this is incorrect? For any two languages A and B, if A ⊆ B, then A is reducible to B.
commented
Oct 2
in
Theory of Computation

57
views
theoryofcomputation
reduction
2
answers
11
Find Number Of Tokens and Lexemes
commented
Sep 26
in
Compiler Design

1.7k
views
compilerdesign
tokens
lexeme
5
answers
12
GATE200758
Two processes, P1 and P2, need to access a critical section of code. Consider the following synchronization construct used by the processes: /* P1 */ while (true) { wants1 = true; while (wants2 == true); /* Critical ... . It requires that processes enter the critical section in strict alteration. It does not prevent deadlocks, but ensures mutual exclusion.
answer edited
Aug 17
in
Operating System

2.8k
views
gate2007
operatingsystem
processsynchronization
normal
0
answers
13
Turing Machine Rice's Theorem
L = {MM is a TM that accepts all even numbers} For the above language i can have Tyes machine which has all even numbers.And Tno as machine whose language is empty.So i can say it is undecidable. But to show it ... here that the property of the language as "Only all even numbers",i guess the same has been given in the question.
commented
Aug 11
in
Theory of Computation

81
views
decidability
ricetheorem
theoryofcomputation
turingmachine
selfdoubt
2
answers
14
TOC Turing machines Decidability
commented
Aug 8
in
Theory of Computation

80
views
theoryofcomputation
turingmachine
decidability
2
answers
15
TIFR2010A8
Which of the following is NOT necessarily true? { Notation: The symbol ''$\neg$''notes negation; $P (x, y)$ means that for given $x$ and $y$, the property $P(x, y)$ is true }. $(∀x∀y P(x, y)) \Rightarrow (∀y∀x P(x, y))$ $(∀x∃y \neg P(x, y)) \Rightarrow \neg ... x, y))$ $(∃x∀y P(x, y)) \Rightarrow (∀y∃x P(x, y))$ $(∀x∃y P(x, y)) \Rightarrow (∃y∀x P(x, y))$
answer edited
Jul 24
in
Mathematical Logic

515
views
tifr2010
mathematicallogic
firstorderlogic
6
answers
16
GATE2017239
Let $\delta$ denote the transition function and $\widehat{\delta}$ denote the extended transition function of the $\epsilon$NFA whose transition table is given below: $\delta$ $\epsilon$ $a$ $b$ $\rightarrow \: q_0$ $\{q_2\}$ $\{q_1\}$ $\{q_0\}$ $q_1$ $\{q_2\}$ $\ ... }(q_2, aba)$ is $\emptyset$ $\{q_0, q_1, q_3\}$ $\{q_0, q_1, q_2\}$ $\{q_0, q_2, q_3 \}$
answer selected
Jul 19
in
Theory of Computation

1.6k
views
gate20172
theoryofcomputation
finiteautomata
1
answer
17
Doubt on Regular and unambiguous
commented
Jul 18
in
Theory of Computation

48
views
theoryofcomputation
4
answers
18
GATE200318
In a bottomup evaluation of a syntax directed definition, inherited attributes can always be evaluated be evaluated only if the definition is Lattributed be evaluated only if the definition has synthesized attributes never be evaluated
answer edited
Jul 17
in
Compiler Design

3.4k
views
gate2003
compilerdesign
syntaxdirectedtranslation
normal
1
answer
19
Proof of whether a TM accepts epsilon is semi decidable
commented
Jul 15
in
Theory of Computation

70
views
theoryofcomputation
decidability
1
answer
20
toc gatebook test Q 2
Let $R$ be a regular language and $L$ is a language which accepts only even length strings from $R$. Then $L$ is Always Regular Always Not Regular Sometimes Regular, but not always None
edited
Jul 13
in
Theory of Computation

155
views
regularlanguages
1
answer
21
Series Summation
Series summation of $S_n$ in closed form? $\begin{align*} &S_n = \frac{1}{1.2.3.4} + \frac{1}{2.3.4.5} + \frac{1}{3.4.5.6} + \dots + \frac{1}{n.(n+1).(n+2).(n+3)} \end{align*}$
commented
Jul 12
in
Set Theory & Algebra

113
views
numbertheory
summation
discretemathematics
0
answers
22
Minimum No. of vertices required
commented
Jul 2
in
Graph Theory

133
views
graphtheory
proof
2
answers
23
ISRO201515
The queue data structure is to be realized by using stack. The number of stacks needed would be It cannot be implemented 2 stacks 4 stacks 1 stack
answer selected
Jun 29
in
DS

1.1k
views
isro2015
datastructure
stack
2
answers
24
ISRO201150
Data is transmitted continuously at 2.048 Mbps rate for 10 hours and received 512 bits errors. What is the bit error rate? 6.9 e9 6.9 e6 69 e9 4 e9
answer selected
Jun 29
in
Computer Networks

1.4k
views
isro2011
computernetworks
errordetection
1
answer
25
discrete math
Give an example where distributive lattice is not complemented lattice? Is always distributive lattice bounded?
commented
Jun 14
in
Set Theory & Algebra

1.2k
views
2
answers
26
min heap
The number of binary min. heaps that can be formed from a set of 7 distinct integers is _________?
commented
Jun 13
in
DS

658
views
2
answers
27
COA DMA doubt
What is formula for % of time CPU gets blocked?? Is it X(X+Y) or X/Y only??? What is formula for % of time CPU is consumed in Interuppt driven IO??? Formula for % of CPU slow down in interrupt driven IO???
comment edited
Jun 8
in
CO & Architecture

930
views
coandarchitecture
dma
interrupts
1
answer
28
HamacherDMA
The average seek time and rotational delay in a disk system are 6ms and 3ms, respectively. The rate of data transfer to or from the disk is 30 Mbytes/sec and all disk accesses are for 8 Kbytes of data. Disk DMA controller, the ... a disk unit, on average over a long period of time during which a sequence of independent 8Kbyte transfers takes place?
commented
Jun 4
in
CO & Architecture

828
views
coandarchitecture
dma
2
answers
29
DMA operation
A) Consider $1$mbps harddisk is interfaced to the processor in a cycle stealing mode of DMA whenever $64$ bytes of data is available in the buffer,then it is transferred to main memory (1 word = $64$ bits) and machine cycle time is $2$ ... time consumed for DMA operation is ? B) Percentage of CPU time consumed for DMA operation, if burst mode is used ?
commented
Jun 3
in
CO & Architecture

1.1k
views
dma
coandarchitecture
2
answers
30
ISRO201716
Given two statements Insertion of an element should be done at the last node of the circular list Deletion of an element should be done at the last node of the circular list Both are true Both are false First is false and second is true None of the above
commented
May 25
in
DS

2.3k
views
isro2017
datastructure
linkedlists
badquestion
2
answers
31
Write Through Cache Policy Questions  As per me answer should be 30, Given as 46 ns !
commented
May 22
in
CO & Architecture

808
views
write_through
cachememory
2
answers
32
ISRO201771
At a particular time the value of counting semaphore is 10. It will become 7 after: 3 V operations 3 P operations 5 V operations and 2 P operations 2 V operations and 5 P operations
commented
May 11
in
Operating System

1.7k
views
isro2017
operatingsystem
semaphore
3
answers
33
GATE1999_2.15
A grammar that is both left and right recursive for a nonterminal, is Ambiguous Unambiguous Information is not sufficient to decide whether it is ambiguous or unambiguous None of the above
answer edited
May 9
in
Compiler Design

1k
views
gate1999
compilerdesign
grammar
normal
2
answers
34
Best source to study Calculus
Hello, kindly consider for a second that I've just passed my 10th class and just got admit to 11th standard. So, where would you suggest me to learn calculus from the very scratch. Kindly mention the video sources which can be very helpful in learning calculus from the very beginning.
commented
May 9
in
Calculus

97
views
engineeringmathematics
calculus
0
answers
35
Gate 2004 cse syntax directed translations
closed
May 9
in
Compiler Design

72
views
1
answer
36
ISRO201747
Capability maturity Model (CMM) is the methodology to develop and refine an organization's software development process develop the software test the software All of the above
answer selected
May 8
in
IS&Software Engineering

1.1k
views
isro2017
is&softwareengineering
nongate
cmm
2
answers
37
GATE199103,ii
Choose the correct alternatives (more than one may be correct) and write the corresponding letters only: (ii). Advantage of synchronous sequential circuits over asynchronous ones is: faster operation ease of avoiding problems due to hazards lower hardware requirement better noise immunity none of the above
edited
May 8
in
Digital Logic

2.5k
views
gate1991
digitallogic
normal
synchronousasynchronouscircuits
1
answer
38
Selection sort and Insertion sort
commented
May 6
in
Algorithms

273
views
sorting
algorithms
1
answer
39
GATE201351
The procedure given below is required to find and replace certain characters inside an input character string supplied in array A. The characters to be replaced are supplied in array oldc, while their respective replacement characters are supplied in array ... cases will be successful in exposing the flaw in this procedure? None 2 only 3 and 4 only 4 only
answer selected
May 3
in
DS

380
views
gate2013
datastructure
arrays
normal
0
answers
40
GATE 2015 Q.54
Consider the operations f (X,Y,Z ) = X′YZ + XY′+Y′Z′ and g (X,Y,Z ) = X′YZ + X′YZ′ + XY Which one of the following is correct? (A) Both {f} and {g} are functionally complete (B) Only {f} is functionally complete (C) Only {g} is functionally complete (D) Neither {f} nor {g} is functionally complete
closed
May 3
in
Digital Logic

50
views
29,153
questions
36,971
answers
92,116
comments
34,815
users