Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Recent posts tagged testimonials
1
I owe it all to GO
somebody solve here and tell .? that explanation does not suit me well.??
pritishc
3,873
views
pritishc
posted
Jun 5, 2021
2021
testimonials
+
–
2
A Short Guide to GATE
sakharam
17,225
views
sakharam
posted
Apr 10, 2021
2021
study-resources
testimonials
+
–
3
Thank You GateOverflow
(∀x∀yP(x,y))→(∀x∀yP(y,x)) Here the LHS will be true only if P(x,y) is true for every possible x and y. Since both x and y are coming fro...
PrimeJJG
2,745
views
PrimeJJG
posted
Mar 31, 2021
2021
testimonials
gate2021
gatecse
gateoverflowbook
+
–
4
GATE 2021 Testimonials - Request to add
soujanyareddy13
645
views
soujanyareddy13
posted
Mar 21, 2021
From GO Admins
testimonials
+
–
5
I got GATE-2021-CSE-AIR("152") , THANK YOU GATEOVERFLOW!!!(99.99% accurate RANK-PREDICTOR)
its 3. draw a graph and colour it and check
Sarvagya S Mamgain
3,930
views
Sarvagya S Mamgain
posted
Mar 20, 2021
2021
testimonials
gatecse-2021
+
–
6
IITH CSE interview M Tech RA Winter admission 2021
Can you please give any source which contain r(*)=r*.Previous year question book gave answer band their b is (r*s*)*=(r+s)*
Tuhin Dutta
3,707
views
Tuhin Dutta
posted
Dec 26, 2020
Interview Experience
iith
interview-experience
testimonials
mtech-ra
+
–
7
IITH AI interview M Tech RA Winter admission 2021
i think the language would be L= 00(0000)*if L= 00 + (0000)* then 0000 cant reaches the final state .
Tuhin Dutta
3,606
views
Tuhin Dutta
posted
Dec 26, 2020
Interview Experience
iith-ra-2020
interview-experience
iith
iith-ai
iit-interviews
testimonials
+
–
8
My journey from Wipro to an IISc student - GATE 2019
how?
Chaitrasj
5,526
views
Chaitrasj
posted
Jul 3, 2019
2019
gate2019
gateoverflow
testimonials
iisc-cds-research
+
–
9
Gate Overflow - The best way to utilise your Facebook addiction
For answering there is no need to execute the query, we can directly answer this as $2$How?Group by Student_NamesIt means all name that are same should be kept in one row...
Astitva Srivastava
3,203
views
Astitva Srivastava
posted
Jun 29, 2019
2019
testimonials
gate2019
gateoverflow
+
–
10
From 10374 to 479
Let $G = (V, E)$ be a simple undirected graph, and $s$ be a particular vertex in it called the source. For $x \in V$, let $d(x)$ denote the shortest distance in $G$ from ...
anuraagkansara
2,572
views
anuraagkansara
posted
Jun 28, 2019
2019
testimonials
2019
+
–
11
From being a Failure to getting into IISc - (Rank 888, Score 692)
Ravi Raja
4,515
views
Ravi Raja
posted
Jun 13, 2019
2019
iisc-csa-research
testimonials
+
–
12
GO - The indispensable resource for GATE CS aspirants.
M=14.25=1110.01= 1.11001*2^3M=11001 MSB 1 is for sign bit , since exponent is 8 bit biased so, 2^8 -1= 127.. E= 127 +3= 130=10000010So , 1 foe sign bit 10000010(8 bits) f...
Tejasvi96
4,202
views
Tejasvi96
posted
Mar 16, 2019
2019
testimonials
+
–
13
GO-A Place That Transforms Your Life
It is used for this question only actually whenever m=n the complete bipartite graph is regular. here they want to just test the concept whether we know this or not and h...
VS
4,370
views
VS
posted
Jun 29, 2018
2018
testimonials
gate2018
+
–
14
A journey with GO from Air: 2494 to Air: 223
Given that a language $L_A = L_1 \cup L_2$, where $L_1$ and $L_2$ are two other languages. If $L_A$ is known to be a regular language, then which of the following stateme...
Ahwan
4,491
views
Ahwan
posted
Mar 20, 2018
2018
testimonial-gate2018
testimonials
+
–
15
Thanks to GATE Overflow.
Pritam Dutta
2,344
views
Pritam Dutta
posted
Mar 19, 2018
2018
testimonials
2018
+
–
16
My success story
Let $G$ be a weighted undirected graph and e be an edge with maximum weight in $G$. Suppose there is a minimum weight spanning tree in $G$ containing the edge $e$. Which ...
Rishabh Gupta 2
45,223
views
Rishabh Gupta 2
posted
Mar 18, 2018
2018
testimonials
testimonial-gate2018
gate2018
gateoverflow
preparation-advise
+
–
17
My Journey from a crazy guy to a Technical guy
In a depth-first traversal of a graph $G$ with $n$ vertices, $k$ edges are marked as tree edges. The number of connected components in $G$ is$k$$k+1$$n-k-1$$n-k$
Ashwin Kulkarni
3,551
views
Ashwin Kulkarni
posted
Mar 18, 2018
2018
testimonials
+
–
18
Journey from AIR 3511 to AIR 94
akb1115
5,020
views
akb1115
posted
Mar 17, 2018
2018
testimonials
gate2018
+
–
19
Thanks to GO team and Arjun Sir
Consider a random variable $X$ that takes values $+1$ and $−1$ with probability $0.5$ each. The values of the cumulative distribution function $F(x)$ at $x = −1$ and ...
AmitPatil
1,774
views
AmitPatil
posted
Apr 6, 2017
2017
testimonials
+
–
20
Great Journey with Gateoverflow !!
Consider a B-tree with degree $m$, that is, the number of children, $c$, of any internal node (except the root) is such that $m \leq c \leq 2m-1$. Derive the maximum and ...
mcjoshi
2,856
views
mcjoshi
posted
Apr 1, 2017
2017
testimonials
+
–
21
Long Live Gateoverflow !
Given that $A$ is regular and $(A \cup B)$ is regular, does it follow that $B$ is necessarily regular? Justify your answer.Given two finite automata $M1, M2$, outline an ...
dd
2,515
views
dd
posted
Apr 1, 2017
2017
testimonials
preparation-experience
+
–
22
A Great Journey It was with GO
Time complexity of Bellman-Ford algorithm is $\Theta(|V||E|)$ where $|V|$ is number of vertices and $|E|$ is number of edges. If the graph is complete, the value of $|E|$...
KISHALAY DAS
1,839
views
KISHALAY DAS
posted
Mar 29, 2017
2017
2017
testimonials
+
–
23
Thanks a lot GO
In a $k$-way set associative cache, the cache is divided into $v$ sets, each of which consists of $k$ lines. The lines of a set are placed in sequence one after another. ...
Kai
1,209
views
Kai
posted
Mar 29, 2017
2017
testimonials
2017
+
–
24
Testimonial by Ganesh - One of the best things on the internet these days
(C) Every relation in $\text{BCNF}$ is also in $\text{3NF}.$ Straight from definition of $\text{BCNF}.$More Read: https://gatecse.in/demystifying-database-normalization/
ganeshk30
1,280
views
ganeshk30
posted
Apr 7, 2016
2016
testimonials
gate2016
+
–
25
Testimonial by Himanshu Agarwal
$L= \{\langle M\rangle \mid L(M)\text{ is infinite}\}$$L$ is RE but $L'$ is not REBoth $L$ and $L'$ are RE$L$ is not RE but $L'$ is REBoth $L$ and $L'$ are not RE
Himanshu1
3,065
views
Himanshu1
posted
Apr 5, 2016
2016
testimonials
gate2016
+
–
26
Testimonial by Pooja Palod
Consider the following languages$L_1$ = $\{a^nb^n\mid n \ge 0\}$ $L_2$ = Complement($L_1$)Chose the appropriate option regarding the languages $L_1$ and $L_2$(A) $L_1$ a...
Pooja Palod
2,145
views
Pooja Palod
posted
Apr 4, 2016
2016
testimonials
gate2016
+
–
27
Testimonial by Saurabh Sharma
We can get a DFA for $L = \{x \mid xx ∊ A\}$ as follows:Take DFA for $A$ $\left(Q, \delta, \Sigma, S, F\right)$ with everything same except initially making $F = \p...
Saurabh Sharma
1,617
views
Saurabh Sharma
posted
Apr 4, 2016
2016
testimonials
gate2016
+
–
28
Testimonial by Abhilash Panicker
abhilashpanicker29
1,478
views
abhilashpanicker29
posted
Apr 4, 2016
2016
testimonials
gate2016
+
–
29
Testimonial by Akash Kanase
Let $Σ = \{a, b, c\}$. Which of the following statements is true?For any $A ⊆ Σ^*$, if $A$ is regular, then so is $\{xx \mid x ∊ A\}$For any $A ⊆ Σ^*$, if $A$ is...
Akash Kanase
3,399
views
Akash Kanase
posted
Apr 4, 2016
2016
testimonials
gate2016
+
–
To see more, click for the
full list of questions
or
popular tags
.
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register