menu
search
Log In
Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true

Subjects

Network Sites

 GO Mechanical
 GO Electrical
 GO Electronics
 GO Civil
 CSE Doubts

Recent posts tagged testimonials

4
Gate Overflow - The best way to utilise your Facebook addiction
I got GS : 618, rank : 1855 and marks : 53.67 in GATE 2019. I'm not a topper, I didn't get even under 1000 rank, so why will you read my testimonial about GO? Totally depends on you. GO doesn't need any ... the best institutes in India; and without GO it would've been almost impossible. Thanks to each and every member of GO Community.
For answering there is no need to execute the query, we can directly answer this as $2$ How? Group by Student_Names It means all name that are same should be kept in one row. There are $3$ names. But in that there is a duplicate with Raj being repeated $\implies$ Raj produces ...
posted Jun 30, 2019 in 2019 Astitva Srivastava 1,745 views
5
From 10374 to 479
I would like to share my story with you all. My rank in gate 2018 was 10374 with marks 27.67. I didn't sit in college placements because I wanted to give it one more shot. Didn't wanted to be a financial burden on my family so I decided to stay at ... much better in the main exam. I scored 64.67 marks with rank 479 and will join IIT Kanpur Mtech(TA). Thank you GateOverflow !!!
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 $s$ to $x$. A breadth first search (BFS) is performed starting at $s$. Let $T$ ... of $G$ that is not in $T$, then which one of the following CANNOT be the value of $d(u) - d(v)$? $-1$ $0$ $1$ $2$
posted Jun 28, 2019 in 2019 anuraagkansara 1,403 views
9
A journey with GO from Air: 2494 to Air: 223
I am Ahwan Mishra, Air: 223 in gate 2018, This is all about my journey with gateoverflow. I had started my preparation for gate 2017 from a long time before the exam. I could not get what I wanted in my first ... sir, @Debashish Deka bro, @Sachin Mittal bro, @Shiva Kulshreshtha bro, @Habib bro, @Digvijay Pandey bro, @balaeinstein, @Vineet, @Hemant.
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 statements is necessarily TRUE? If $L_1$ is regular then $L_2$ will also be regular If $L_1$ is regular and finite then $L_2$ will be regular If $L_1$ is regular and finite then $L_2$ will also be regular and finite None of these
posted Mar 20, 2018 in 2018 Ahwan 3,318 views
11
My success story
Hi everyone! My name is Rishabh Gupta and I secured AIR - 2 in GATE 2018. Marks: 83.00. Credit goes to my parents and GATE OVERFLOW. I am a final year student in a tier-3 college. It was my first attempt. Even being in a central university, we have ... preparing with you people :) All the best to future aspirants. You can message me anytime, I will be glad to help :) Thank You!
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 of the following statements is always TRUE? There exists a cutset in $G$ having all edges of maximum ... in $G$ having all edges of maximum weight. Edge $e$ cannot be contained in a cycle. All edges in $G$ have the same weight.
posted Mar 18, 2018 in 2018 Rishabh Gupta 2 37,102 views
14
Thanks to GO team and Arjun Sir
I am Amit Sadashiv Patil, GATE 2017 AIR 31. GO played a wonderful uplifter in my GATE preparation. All what I wanted to mention is already done by most of the toppers. My feelings are not so different from them. I thank all GO team and especially to Arjun sir for such a big support.
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 $+1$ are $0$ and $0.5$ $0$ and $1$ $0.5$ and $1$ $0.25$ and $0.75$
posted Apr 6, 2017 in 2017 AmitPatil 1,388 views
15
Great Journey with Gateoverflow !!
So, Finally it comes to write a testimonial after writing answers, asking questions, comments here. I must say that CS students are extremely lucky/fortunate to have GO for GATECSE preparation. So, first thanks to @Arjun Sir, for creating this platform, maintaining GO and answering ...
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 minimum number of records in the leaf nodes for such a B-tree with height $h, h \geq 1$. (Assume that the root of a tree is at height 0).
posted Apr 1, 2017 in 2017 mcjoshi 2,194 views
17
A Great Journey It was with GO
I joined Gate overflow last yr this time and I am active here from September.What I found here best is its reliability of Answers.Most of the questions are discussed by all aspirants.So it is such a platform which is open for arguments and ... those questions you facing tricky,discuss and clear ur doubt. Thank You... Kishalay Das AIR-37,Gate 2017;ISRO-SC Selected
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|$ becomes $\Theta\left(|V|^2\right)$. So overall time complexity becomes $\Theta\left(|V|^3\right)$. And given here is $n$ vertices. So, the answer ends up to be $\Theta\left(n^3\right)$. Correct Answer: $C$
posted Mar 30, 2017 in 2017 KISHALAY DAS 1,475 views
18
Thanks a lot GO
AIR: 72. I'm originally from ECE branch. Preparing for GATE in a separate branch within 10 months felt like an impossible task at first. Fortunately in the early days itself I somehow got introduced to GO. The real strength of the GO platform lies in the ... I'm reasonably confident the preparation would have been hell for me and I very highly doubt I would have got a decent rank.
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. The lines in set $s$ are sequenced before the lines in set $(s+1)$. The main memory blocks are numbered 0 onwards. The main memory block ... $(j \text{ mod } k) * v \text{ to } (j \text{ mod } k) * v + (v-1) $
posted Mar 30, 2017 in 2017 Kai 954 views
21
Testimonial by Pooja Palod
Gateoverflow is not only the best online resource for previous year gate questions but also best resource for other related computer science exams like TIFR and many others. It is a forum where all your doubts get resolved, queries get answered by ... future gate aspirants to make best use of this platform. Wishing all future aspirants good luck. Pooja Palod AIR 51,2016
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$ and $L_2$ are context free (B) $L_1$ is context free but $L_2$ is regular (C) $L_1$ is context free and $L_2$ is context sensitive (D) None of the above
posted Apr 4, 2016 in 2016 Pooja Palod 1,730 views
22
Testimonial by Saurabh Sharma
I would like to share my experience from the point of view of student who had coaching. I joined Made Easy while I was in my final year. Some teachers were quite awesome but others were just fine. The most important advantage ... quantity. If you find any difficulty during your preparation you can always contact me ([email protected]) AIR 119 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 = \phi$. Now for each state $D \in Q$, consider 2 separate DFAs, one with $S$ as the start state and $D$ as the final ... . But if we make $L$ from $A$ as per (d), it'll be $L = \{a^nb^nc^n \mid n \ge 0\}$ which is not context free..
posted Apr 4, 2016 in 2016 Saurabh Sharma 1,296 views
24
Testimonial by Akash Kanase
Gateoverflow is best source of previous year question and place to get your doubts solved. Answers on Gateoverflow are very nice and informative, they not only tell what answer is but also entire process how answer is derived and give total idea about ... study strategy and many other issues related to GATE. Keep doing good work :) Akash Kanase AIR 28, Gate 2016
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 regular, then so is $\{x \mid xx ∊ A\}$ For any $A ⊆ Σ^*$, if $A$ is context-free, then so is $\{xx \mid x ∊ A\}$ For any $A ⊆ Σ^*$, if $A$ is context-free, then so is $\{x \mid xx ∊ A\}$
posted Apr 4, 2016 in 2016 Akash Kanase 2,580 views
To see more, click for the full list of questions or popular tags.
Dark theme
Muffin by Hélio Chun
Thanks to Q2A
...