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
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.
Answers by Tesla!
User Tesla!
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
User Tesla!
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
0
votes
1
JEST Exam
Two gamblers have an argument. The first one claims that if a fair coin is tossed repeatedly, getting two consecutive heads is very unlikely. The second, naturally, is denying this.They decide to settle this by an actual trial; if within n coin ... . What happens for larger values of n? Is it true that P(n) only increases with n? Justify your answer.
answered
Feb 17
in
Probability

60
views
jest
0
votes
2
how to solve
answered
Feb 16
in
Set Theory & Algebra

67
views
+2
votes
3
GATE201847
Consider the following undirected graph G: Choose a value for x that will maximize the number of minimum weight spanning trees (MWSTs) of G. The number of MWSTs of G for this value of x is ____
answered
Feb 14
in
Algorithms

1.3k
views
gate2018
algorithms
graphalgorithms
minimumspanningtrees
numericalanswers
+1
vote
4
Complement of CFL
How to prove that "complement of L = {WWR  W ∈ {a,b}*} is CFL" ?
answered
Feb 14
in
Theory of Computation

63
views
contextfreelanguage
theoryofcomputation
+4
votes
5
time complexity
let S be a String containing either 0 or 1 .further there are no two consecutive 0s in S. No of solution on an input size S(N) is bounded by a) O(n^2) b)O(nlogn) c)O(2^n) d)O(n)
answered
Feb 14
in
Algorithms

58
views
0
votes
6
operating system
Context switching time in FCFS scheduling algorithm have less than equal to RoundRobin. explain this statement
answered
Feb 7
in
Operating System

65
views
0
votes
7
CMI2017B3
Let Σ = {a, b}. Given words u, v ∈ Σ* , we say that v extends u if v is of the form xuy for some x, y ∈ Σ* . Given a fixed word u, we are interested in identifying whether a finite state automaton accepts some word that extends u. ... Σ* and reports Yes if some word in the language of A extends u and No if no word in the language of A extends u.
answered
Feb 6
in
Theory of Computation

53
views
cmi2017
theoryofcomputation
+1
vote
8
CMI2017B2
There are a number of tourist spots in a city and a company GoMad runs shuttle services between them. Each shuttle plies between a designated origin and destination, and has a name. Due to lack of coordination, the same name may be allotted to multiple ... are carrying a GoMad pass or a GoCrazy pass, you can start at s and arrive at t using the sequence σ.
answered
Feb 6
in
Algorithms

32
views
cmi2017
algorithms
0
votes
9
CMI2017B1
Let Σ = {a, b, c}. Let Leven be the set of all even length strings in Σ* (a) Construct a deterministic finite state automaton for L$_{EVEN}$. (b) We consider an operation Erase$_{ab}$ that takes as input a string w ∈ Σ* and erases all occurrences ... Erease$_{ab}$(L):= { Erease$_{ab}$(w)  w$\in$ L} Show that Erase$_{ab}$(L$_{even}$) is a regular language.
answered
Feb 6
in
Theory of Computation

53
views
cmi2017
theoryofcomputation
0
votes
10
CMI2017B4
In a party there are 2n participants, where n is a positive integer. Some participants shake hands with other participants. It is known that there are no three participants who have shaken hands with each other. Prove that the total number of handshakes is not more than n2
answered
Feb 6
in
Combinatory

54
views
cmi2017
handshake
permutationsandcombinations
+2
votes
11
CMI2017A02
An FM radio channel has a repository of 10 songs. Each day, the channel plays 3 distinct songs that are chosen randomly from the repository. Mary decides to tune in to the radio channel on the weekend after her exams. What is the probability that no song gets ... 3 \end{pmatrix}*\begin{pmatrix} 7\\ 3 \end{pmatrix}*\begin{pmatrix} 10\\ 6 \end{pmatrix}^{1}$
answered
Feb 5
in
Probability

88
views
permutationsandcombinations
probability
cmi2017
0
votes
12
CMI2017A04
City authorities are concerned about traffic accidents on major roads. They would like to have ambulances stationed at road intersections to quickly reach the scene of any accident along these roads. To minimize response time, ambulances are to be ... Find a spanning tree with minimum (c) Find a minimal coloring. (d) Find a minimum size vertex cover.
answered
Feb 5
in
Graph Theory

36
views
algorithms
graphalgorithms
cmi2017
0
votes
13
CMI2017A09
Suppose we constructed the binary search tree shown below by starting with an empty tree and inserting one element at a time from an input sequence, without any rotations or other manipulations. Which of the following assertions about the order of elements in the ... (c) 1 came after 12 and 29 came before 42. (d) 3 came before 14 and 16 came before 28.
answered
Feb 5
in
Algorithms

57
views
cmi2017
algorithms
+2
votes
14
CMI2017A10
We have constructed a polynomial time reduction from problem A to problem B. Which of the following is a valid inference? (a) If the best algorithm for B takes exponential time, there is no polynomial time algorithm for A (b) If the best ... we don't know whether there is a polynomial time algorithm for B, there cannot be a polynomial time algorithm for A.
answered
Feb 5
in
Algorithms

46
views
cmi2017
algorithms
theoryofcomputation
+1
vote
15
Gate_2018_Mock
How to find eigen value in this type of matrix?
answered
Jan 30
in
Mathematical Logic

36
views
engineeringmathematics
0
votes
16
ME test series
answered
Jan 28
in
Algorithms

60
views
madeeasytestseries
recurrence
recursion
+1
vote
17
#1 Testbook Mock Test (COA)
A register to register machine supports 2address, 1address, and 0address instructions. Instruction register size is 24 bits and register set size is 480. If there are 48 2address instructions and 2048 0address instructions then what is the maximum possible number of 1address instructions?
answered
Jan 24
in
CO & Architecture

22
views
computerarchitecture
testbookmocktest
+2
votes
18
Paging OS
Consider a byte addressable virtual memory system with 34bit addresses where the first 23 bits are used as a page number, and the last 11 bits is the offset. Suppose the system using twolevel paging, with first n bits (n>11) of the address used as an index into the ... Thanks in advance Options 224 / 2(34n) 2(34n11) x 211 224 /2(34n11) 2(n11) x 211
answered
Jan 23
in
Operating System

111
views
paging
operatingsystem
+1
vote
19
test series
Consider a computer system having 20 physical page frames numbered from 1 to 20 which are initially empty. Now, a program accesses the pages numbered 1, 2 ..........100 twice. The number of page fault generated by optimal page replacement policy is __________.
answered
Jan 23
in
Operating System

69
views
number
of
page
faults
madeeasytestseries
0
votes
20
BFS No of Teversals
How to solve these kind of questions?
answered
Jan 17
in
DS

57
views
bfs
algorithms
datastructure
graphalgorithms
0
votes
21
made easy test series
I'm getting 4, can someone verify
answered
Jan 10
in
Compiler Design

88
views
madeeasytestseries
compilerdesign
+2
votes
22
made easy test series
Here i'm not able to get after how much time X and Y will face first collision
answered
Jan 10
in
Computer Networks

113
views
computernetworks
madeeasytestseries
0
votes
23
remove recursion
which one is coorect option c or d??
answered
Jan 7
in
Programming

23
views
0
votes
24
testbook
i dont understand the solution! can anyone elaborate?
answered
Jan 7
in
Operating System

21
views
+2
votes
25
Max heap no. of interchange required
answered
Jan 7
in
DS

49
views
datastructure
binaryheap
0
votes
26
DMA module
A DMA module is transferring characters to memory using cycle stealing, from a device transmitting at 12800 bits per second.The processor is fetching instructions at the rate of 2MIPS. By how much % the processor be slowed down due to DMA activity?
answered
Jan 2
in
CO & Architecture

60
views
+3
votes
27
Cache size
If a 16 – way set associative cache is made up of 64 bit words, 16 words per line and 8192 sets, how big is the cache in mega bytes?
answered
Jan 1
in
CO & Architecture

96
views
coandarchitecture
cachememory
+1
vote
28
Determinent of matrix
answered
Dec 27, 2017
in
Linear Algebra

144
views
matrices
engineeringmathematics
+1
vote
29
Transmission window size
Assume that TCP congestion window is set to 32KB and a timeout occurs. If next five transmissions are all successful then what will be the new transmission window size? Ans is 18KB or 20KB?
answered
Dec 25, 2017
in
Computer Networks

71
views
computernetworks
+3
votes
30
#graph theory
answered
Dec 23, 2017
in
Graph Theory

100
views
graphtheory
discretemathematics
+2
votes
31
# made easy demo test #Q 60
answered
Dec 23, 2017
in
Programming

49
views
0
votes
32
Exponential Back off Algorithm
Assume that X and Y are the only two stations on an ethernet. Each has a steady queue of frames to send. Both X and Y attempt to transmit a frame, collide and Y wins the first backoff race. At the end of this successful transmission by Y ... second backoff race is I think it should be 0.03125 or 1/32. But the answer given is 0.125 or 1/8.
answered
Dec 21, 2017
in
Computer Networks

146
views
computernetworks
exponentialbackoffalgorithm
+1
vote
33
Verify
If our graph has isolated vertices then it can have euler circuit. But with isolated vertices we can never have hamiltonian circuit. so we can have euler circuit even in a disconnected graph but hamiltonian circuit is possible always on a connected graph. Am I right?
answered
Dec 14, 2017
in
Graph Theory

27
views
0
votes
34
TIFR2018B14
Define the language $INFINITE_{DFA}\equiv \{(A)\mid A \text{ is a DFA and } L(A) \text{ is an infinite language}\},$ where $(A)$ denotes the description of the deterministic finite automata (DFA).Then which of ... is Turing decidable (recursive). It is Turing recognizable but not decidable. Its complement is Turing recognizable but it is not decidable.
answered
Dec 11, 2017
in
Theory of Computation

185
views
tifr2018
identifyclasslanguage
+1
vote
35
TIFR2018B15
$G$ respresents an undirected graph and a cycle refers to a simple cycle (no repeated edges or vertices). Define the following two languages. $SCYCLE=\{(G,k)\mid G \text{ contains a cycle of length at most k}\}$ and $LCYCLE=\{(G,k) ... NPcomplete. $SCYCLE \leq_{p} LCYCLE$ (i.e, there is a polynomial time manytoone reduction from $SCYCLE$ to $LCYCLE$).
answered
Dec 11, 2017
in
Others

143
views
tifr2018
+1
vote
36
TIFR2018A11
We are given a (possibly empty) set of objects.Each object in the set is colored either black or white, is shaped either circular or rectangular, and has a profile that is either fat or thin, Those properties obey the following principles: Each white ... $(i) \text{ and } (iii)$ only None of the statements must be TRUE All of the statements must be TRUE
answered
Dec 11, 2017
in
Others

150
views
tifr2018
0
votes
37
TIFR2018A7
Consider the following function definition. void greet(int n) { if(n>0) { printf("hello"); greet(n1); } printf("world"); } If you run greet(n) for some nonnegative integer n, what would it print ... n times "helloworld" (d) n+1 times "helloworld" (e) n times "helloworld", followed by "world"
answered
Dec 10, 2017
in
Programming

129
views
tifr2018
programminginc
0
votes
38
TIFR2018A6
What is the minimum number of student needed in a class to guarantee that there are at least 6 student whose birthday fall in same month ? (a) 6 (b) 23 (c) 61 (d) 72 (e) 91
answered
Dec 10, 2017
in
Combinatory

164
views
tifr2018
pigeonhole
+4
votes
39
TIFR2018B4
The notation "$\Rightarrow$" denotes "implies" and "$\wedge$" denotes "and" in the following formulae. Let X denote the formula: (b $\Rightarrow$ a ) $\Rightarrow$ ( a $\Rightarrow$ b) Let Y denote the formula: ... satisfiable. (d) X is not tautology and Y is satisfiable. (e) X is a tautology and Y is satisfiable,
answered
Dec 10, 2017
in
Mathematical Logic

130
views
tifr2018
mathematicallogic
+3
votes
40
TIFR2018B8
In an undirected graph G with n vertices, vertex 1 has degree 1, while each vertex 2,...,n1 has degree 10 and the degree of vertex n is unknown, Which of the following statement must be TRUE on the graph G? (a) There is a path from vertex 1 to ... degree 1. (d) The diameter of the graph is at most $\frac{n}{10}$ (e) All of the above choices must be TRUE
answered
Dec 10, 2017
in
Graph Theory

126
views
tifr2018
graphtheory
Page:
1
2
3
4
5
6
next »
33,715
questions
40,263
answers
114,378
comments
38,900
users