menu
Login
Register
search
Log In
account_circle
Log In
Email or Username
Password
Remember
Log In
Register
I forgot my password
Register
Username
Email
Password
Register
add
Activity
Questions
Unanswered
Tags
Subjects
Users
Ask
Prev
Blogs
New Blog
Exams
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
Recent Posts
Update on GO Book for GATE 2022
Barc Interview Experience 2020- CSE stream
JEST 2021 registrations are open
TIFR GS-2021 Online Application portal
IIT Jodhpur Mtech AI - Interview Expierence (Summer Admission)
Subjects
All categories
General Aptitude
(2.1k)
Engineering Mathematics
(8.5k)
Digital Logic
(3k)
Programming and DS
(5.1k)
Algorithms
(4.5k)
Theory of Computation
(6.3k)
Compiler Design
(2.2k)
Operating System
(4.7k)
Databases
(4.3k)
CO and Architecture
(3.5k)
Computer Networks
(4.3k)
Non GATE
(1.2k)
Others
(1.3k)
Admissions
(595)
Exam Queries
(838)
Tier 1 Placement Questions
(16)
Job Queries
(71)
Projects
(19)
Unknown Category
(1.1k)
Recent Blog Comments
Ohh, yeah now turned off. Got it sir, Thank you :)
I guess you might have turn on "Only GATE...
https://gateoverflow.in/280484/tifr2019-b-11 Arju...
Which question disappeared? Can you share a link?
OFFTOPIC:- @Arjun sir why are the questions of...
Network Sites
GO Mechanical
GO Electrical
GO Electronics
GO Civil
CSE Doubts
Recent posts tagged testimonials
1
IITH CSE interview M Tech RA Winter admission 2021
Background: B.Tech in CSE from WBUT (2017) CGPA - 9.1 Work Experience: Subex, Bangalore, and Cognizant, Kolkata. GATE Score: 608, Year: 2020, AIR: 1746 Interview date: 15th Dec 2020 online on Webex. Shortlisting criteria: Visit ... key to open GATE and other opportunities P.S: I declined the CSE offer because AI dept project was more interesting.
Can you please give any source which contain r(*)=r*.Previous year question book gave answer b and their b is (r*s*)*=(r+s)*
posted
Dec 26, 2020
in
Interview Experience
Tuhin Dutta
1,727
views
iith
interview-experience
testimonials
mtech-ra
2
IITH AI interview M Tech RA Winter admission 2021
Background: B.Tech in CSE from WBUT (2017) CGPA - 9.1 Work Experience: Subex, Bangalore, and Cognizant, Kolkata. GATE Score: 608, Year: 2020, AIR: 1746 Interview date: 12th Dec 2020 online on MS Teams. Shortlisting ... and mentors of GO for their selfless contribution to the platform. GateOverflow is the key to open GATE and other opportunities
i think the language would be L= 00(0000)* if L= 00 + (0000)* then 0000 cant reaches the final state .
posted
Dec 26, 2020
in
Interview Experience
Tuhin Dutta
1,311
views
iith-ra-2020
interview-experience
iith
iith-ai
iit-interviews
testimonials
3
My journey from Wipro to an IISc student - GATE 2019
Well, after my BTech in EXTC, I had managed to get a good job at Wipro in Telecom domain. However, after few months in the IT work, I started feeling that this is not the place where I belong, I felt I am born to do something more, ... for reading guys, if you have any queries feel free to reach out to me, I would be happy to help :) Cheers!!
how?
posted
Jul 4, 2019
in
2019
Chaitrasj
3,193
views
gate2019
gateoverflow
testimonials
iisc-cds-research
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
testimonials
gate2019
gateoverflow
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
testimonials
2019
6
From being a Failure to getting into IISc - (Rank 888, Score 692)
*This is my first post, so forgive me if its written badly* After preparing twice (Gate 17 & 18) and failing twice I was frustrated and disheartened. I left the hope of getting into premium institutions and ... Gate Overflow, it'll help you throughout your preparation. Thank you Arjun sir for gifting us with Gate Overflow!
posted
Jun 13, 2019
in
2019
Ravi Raja
2,408
views
iisc-csa-research
testimonials
7
GO - The indispensable resource for GATE CS aspirants.
Reading the past year's toppers testimonials on GO and thinking whether I will be able to perform well and be an example for future aspirants always seemed to be a motivating factor for giving my best, and now this feeling is totally ... has to invest a lot of time for the same and there is no substitute for that. Thanks GO for everything..
M=14.25=1110.01= 1.11001*2^3 M=11001 MSB 1 is for sign bit , since exponent is 8 bit biased so, 2^8 -1= 127.. E= 127 +3= 130=10000010 So , 1 foe sign bit 10000010(8 bits) for exponent and 1100100000....0(23bits)= C1640000H
posted
Mar 16, 2019
in
2019
Tejasvi96
2,745
views
testimonials
8
GO-A Place That Transforms Your Life
GATE 2018 AIR: 352 NIELIT Scientist-B Rank(17 Dec 2017): 11 NIELIT Scientific Assistant Rank (17 Dec 2017): 59 ISRO Written Rank(22 April 2018) : 35 IIT Kanpur M.Tech. TA Selected (Test Experience) IIT Delhi M.Tech. Computer Technology Selected ( ... GO a lot! I seriously would consider it as my privilege if I could be of any help to GO and the future aspirants.
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 how patiently we go through all options.
posted
Jun 29, 2018
in
2018
VS
3,270
views
testimonials
gate2018
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
testimonial-gate2018
testimonials
10
Thanks to GATE Overflow.
I owe my success to GO. This is the best place for previous year question and explanation. Never thought I will get into top 100 . I can surely tell one thing, doing all the previous year questions honestly , will land you in top 100 ( I am ... him answering the most difficult math questions) and many more . I know only these words will do no justice , but thanks again.
How, Please explain
posted
Mar 19, 2018
in
2018
Pritam Dutta
1,841
views
testimonials
2018
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
testimonials
testimonial-gate2018
gate2018
gateoverflow
preparation-advise
12
My Journey from a crazy guy to a Technical guy
Hello Everyone, I'm Ashwin Kulkarni GATE 2018 AIR 323, in my first attempt. Though the rank is not very very much attractive But it is quite good. I joined GO in mid-October, I guess after that it boosted my confidence drastically. The ... don't miss those days too. But while studying you should be focused and consistent. Thank you so much, GO family.
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$
posted
Mar 18, 2018
in
2018
Ashwin Kulkarni
2,704
views
testimonials
13
Journey from AIR 3511 to AIR 94
A journey from AIR 3511 to AIR 94 I completed my B.Tech. from The NorthCap University Gurgaon in 2017. I have given gate twice once during final year(rank 3511) and now in 2018 with full-time repeat by self-preparation. I really ... your preparation. While giving the GATE exam couldn't able to maintain the cool and panicked because of thinking about the results.
posted
Mar 17, 2018
in
2018
akb1115
3,881
views
testimonials
gate2018
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
testimonials
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
testimonials
16
Long Live Gateoverflow !
Hello, everyone, This post is not about advising or telling preparation strategy or motivating future aspirants. Here I am just going to share my short story behind attempting CS Gate'17 and eventually joining this Gateoverflow platform. I am a B.Tech ... prevailed throughout the entire year. Thank you all and hope that I will be able to contribute more in upcoming years.
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 algorithm to decide if $L(M1) \subset L(M2)$. (note: strict subset)
posted
Apr 1, 2017
in
2017
dd
1,889
views
testimonials
preparation-experience
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
2017
testimonials
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
testimonials
2017
19
Testimonial by Ganesh - One of the best things on the internet these days
The thing with Online learning is, that there are too many resources offering what you think you need (and in the process confusing you ), but only few that know what you exactly require and give you that. Gateoverflow gives ... enough , you guys have set a standard in helping students, Thanks a Ton Ganesh - AIR 96, GATE-2016
(C) Every relation in BCNF is also in 3NF. Straight from definition of BCNF.
posted
Apr 7, 2016
in
2016
ganeshk30
1,006
views
testimonials
gate2016
20
Testimonial by Himanshu Agarwal
Hi, I got AIR 4 in Gate Cse 2016. I will like to share about Gate Overflow. Gate Overflow is a a very good website for Gate CSE Preparation. It has an edge over other preparation material & coaching classes. It's free you can ... from trusted, selected answers & practice a lot here. Best wishes to all future Gate Aspirants. Himanshu Agarwal AIR 4, Gate 2016
$L= \{\langle M\rangle \mid L(M)\text{ is infinite}\}$ $L$ is RE but $L'$ is not RE Both $L$ and $L'$ are RE $L$ is not RE but $L'$ is RE Both $L$ and $L'$ are not RE
posted
Apr 5, 2016
in
2016
Himanshu1
2,527
views
testimonials
gate2016
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
testimonials
gate2016
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
testimonials
gate2016
23
Testimonial by Abhilash Panicker
www.gatecse.in and www.gateoverflow.in are two websites that provide extensive information for most of the GATE CSE queries - Almost complete coverage all the required information one needs to know about GATE, right from preparations to the ... . I would recommend future aspirants to make full use of this platform available. Abhilash Panicker AIR 34, GATE 2016
posted
Apr 4, 2016
in
2016
abhilashpanicker29
1,094
views
testimonials
gate2016
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
testimonials
gate2016
To see more, click for the
full list of questions
or
popular tags
.
...