Most viewed posts

81

Just wanted to give some information on the GO Test series. Though about 200 people have registered for the tests, there have been less than 30 taken on average for tests. This shows that most of you are either postponing the tests or ignoring the subject tests.

  1. Actually the questions in subject tests are made to ensure no topic or question type is left out
  2. We have tried to include maximum twists in these questions so that it becomes easy in actual GATE
  3. Dont get demotivated by the marks – even 30% is good enough as long as you are understanding the mistakes and on second attempt you can score 90% or more
  4. Some people are scoring 80% or more in these tests and I hope them to make a top 30 rank in GATE.  
  5. So if you are postponing the takes the distance between you and the toppers are just increasing

From now onwards the tests will be live on every Mondays. There have been very good debates and hoping for healthy discussions to continue. Questions won’t be getting easier at least until the full length mock tests – where we shall try to simulate the actual GATE.

82
Compared to 2017, what was 2018 like?

Comment down below in Easier/Same/Tougher ...

I was interested in knowing how others felt. I thought it was difficult.
83

Hi everyone,
I am Sakshi Joshi, currently pursing my MS CSE at IIT Madras. Since the GATE results are out, I have wanted to write this post for a long time because I was in a similar phase as you, struggling to get a good rank but miserably failing because of a lack of consistent efforts from my side. Still, I managed to get into IIT Madras, which taught me huge life lessons. Philosophy aside, I wanted you to know that My gate rank was just 2890 when I joined as an MS student here, So the route that I followed is a bit different from that of a regular GATE student, which will still require hard work, but in case your GATE didn’t go as you expected it to be and you can’t afford to take year drop then, I think the resources which I share here and my approach might help you to get into your dream college.

My Score statistics:

GATE 2021[First Attempt]:

  • Score: 405
  • Rank: ~7800

In GATE 2021, I didn’t apply anywhere as I feel that my concepts are not very clear, and I need to prepare more rigorously for the examination. I joined GO classes this year and realised I had a lot of gaps in my concepts and also I lacked practice.

GATE 2022 [Drop year after B.Tech]

  • Score 455
  • Rank  4384

For GATE 2022, I prepared some subjects well, and have a foundation in Computer Science but, again, lacked practice, so I decided to join somewhere. I have never had industry exposure or research experience coming from a tier-3 college. I am very much interested in pursuing research in AI/ML (that was my main reason for pursuing a master's degree). This time I applied to all TOP IITs whose research area matches mine. So I applied even to PhD programs because I was not sure if a direct Ph.D. was a good thing or not, but for the sake of interview experience, I applied. So In order to gain interview experience, I applied to all top IITs, Industries, and Project Positions in some labs that were of interest. Along with it, I filled out the forms for various other exams like JEST, PGEE, ISI, and CMI.

I maintained a sheet that covers all the information regarding the application [1]. You can follow the same format for your area of interest. 

Even if you apply in any area for CS, these topics are a must

For interviews, I was watching GoClasses, Foundations CSE + Logic + Functions and relations

AI/ML

Extra Resources Which I didn’t follow at that time but might be useful for you. 

[1] Counselling sheet for Myself – https://docs.google.com/spreadsheets/d/1bxEyyT1XIfcud3AQ-ylQpW7enGkaIfP7cURQUgWiwIE/edit?usp=sharing 

GATE 2023[After joining as Project Associate at IIT M]

  • Score 505
  • Rank  2890

I did two courses, one Linear Algebra and the other VLSI, in December 2022, but I also switched labs within IIT Madras; hence I got shortlisted for an interview in May 2023.

 

How to apply for project positions?

Either on the IITs website page or go through their professors list, which works in your area of interest. Mail them and ask if there are any opportunities available. 
List of professors at IIT Madras CSE:http://www.cse.iitm.ac.in/listpeople.php?arg=MSQw

Labs at IIT Madras CSE: http://www.cse.iitm.ac.in/labs.php

There is a new department of AI and Data Science at IIT Madras, So do apply if you’re interested in AI/ML: https://dsai.iitm.ac.in/academics/mtech-in-data-science-and-ai/

This is for IIT Madras, but there are similar categories of admission for other IITs as well. You need to look into their website, read the brochure, and apply. Don’t just think that your GATE score is low, so you will not be called for interviews.

I got calls for 

  • IISC PhD Written  clear written + Interview: I didn’t clear the interview (Winter admission)
  • IIT Bombay Cminds – written: I didn't clear the written. (Winter admission)
  • IIT Delhi MS yardi School of AI – Didn’t attend the test (Winter, summer both)
  • IIT Kanpur written test for MS, but because it was offline hence I didn’t go (Winter + summer admission)
  • IIT Hyderabad MTech CSE RA (Winter) Written + Interview (Cleared Both)
  • IIT Hyderabad MTech AI RA (Winter) Written + Interview (Cleared Both)
  • IIIT Hyderabad PhD  Cleared written(PGEE) but didn't go for an interview. (Summer)
  • IIT Madras Research Park project associate CEET Lab – Applied through LinkedIn – Got selected and joined.
  • IIT Madras Project Position (Speech lab interview through gate portal ) – Winter admission  (Sometimes, when you apply for MS at IIT M but your score is not good enough for MS, then you might get a call for a project position it’s rare but professors may shortlist you for the project instead of ms directly so write good SOP which aligns with your interest and skills don't leave it blank. )
  • IIT Madras AI4bharat Lab Project Associate (Winter): Mailed to the professor; they took two interview rounds Deep Learning related. I Got selected and joined.

Resources for extra stuff:

Post GATE Playlist, which I make for some useful videos: https://youtube.com/playlist?list=PL87y3xJCMzO5wGa6z_MGunpsV0KBMqmx_&si=N2FaNqI0hTSge3ru 

Sample SOP/SOR – https://www.yourpedia.in/courses/post-gate-counseling/sample-sop-sor 

latest Notification of all the IITs forms https://www.yourpedia.in/notifications/latest-notification (This helps me a lot to keep track for deadlines )

You can make a directory for keeping all your important documents at one place. It will be handy for you last time 


[Main directory ]Post_gate
                              ------Documents

                              ------Certificates/ Resumes

                              ------Each college folder you are applying in (to save all the receipts and forms )

                              ------password.txt (to save all your portal passwords)

 

Some important points 

  • Read college admission brochures properly
  • Apply even if the data says otherwise
  • Keep learning and practising

 

ALL THE VERY BEST EVERYONE.DON’T LOSE HOPE! :)

I want to thank GO classes from the deepest of my heart for giving me things I never believed would be mine. Deepak sir and Sachine sir lectures not only help you in GATE but also for clearing the interviews, and acing the subjects here in IITs as well. 

 

Hope is a good thing, maybe the best of things, and no good thing ever dies.

 

84
Just a point that before starting gate preparation one must know that tough and easy topics from the syllabus.

According to me most difficult to grab is COA(Comp. Organization and Arch.) and second is CN(Comp. Networks).

Most Easy and Scoring are Programming  and Data Structures and TOC(Theory of computation).

 

My Personal Advise would be:- Even if you go to coaching ,  and have not studied COA in ur college or not done in depth,plz try to do COA beforehand(lots of free stuff can be found on youtube,or diff  gate websites and coaching) , so that when you are tought in coaching your main focus is on understanding it more in depth and not just sitting there and all understanding nothing.When I did COA for the first time, though the lectures seemed as if i could do all the quetions easily , but when i starte to do PYQs, i literally gave up all hope, it was taking around 25-30 min each question to solve , in which i used to do 10 questions normally. So, I just did COA completely again and this time i got more in depth and finally ended up understanding it. COA is difficult to grab but once you grab it, it becomes most interesting subject.

 

Talking about CN, actually it is bit less difficult than COA, but super wide subject, with very very bug course. Just keep in mind , in coaching you will be taught all important parts , all which in 99.99% asked in gate, but that 0.01% in CN is actually again a very big part. IF u want to leave it u can as very rarely such questions are asked ,  but no one knows how rarely so better be prepared. Just find CN syllabus and match what you have studied and what is left. do those all.

 

Lastly , bit difficult is probability in Math, specially Random Variables. Try to not just mug the formula but understand how to apply those, as question may be confusing sometimes, which random variable to be used and which not.

Rest subject can be done easily, just keep good revision of all.(If u need how to revise I have already posted revision strategy post :)

 

one can start with easy subject , but not just go randomly but in connectivity, ie,

Programming, DS    goes well with Algorithms.   

TOC goes well with CD(Compiler Design).

Digital Logics(DL) goes well COA, and COA complements OS(Operating System)

DBMS and Discrete Maths

Aptitude goes with Discrete maths and probability from(Engg Maths)

Rest of Engg maths and CN usually goes unconnected .

                                 All The Best !!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!
85

Guys, there is no post regarding the gate 2021 set 1. So i thought of creating one.

So guys start commenting and share your experience regarding the gate 2021 set 1.

I am an ECE graduate gave GATE CSE 2021. This was my second attempt, in gate 2020 CSE i got 1645 rank and 52 marks.

My experience:I was in set 1 and felt paper was a little lengthy just because of the MSQ's .i saw set 2 analysis also, it was moderate and not that tough as some people are saying,  questions were doable but yes, 100% agree  that paper for set 2 was very very lengthy.But people are comparing it with 2006 paper and that's really wrong. Anyone who has practiced gate ques from 2006 knows that how tough 2006 gate paper questions were.

I personally feel set 2 was tougher overall than set 1 but not to the extent these online discussions are talking about.

how much are you guys expecting ???

 Lets hope for the best:)

 

EDIT: if someone want’s to see all the questions and their solutions then they can refer to the link provided by applied, i found the questions and the answers very accurate ,there are 64/65 ques from set 1 here.

https://drive.google.com/file/d/1eipJ11iSL5Vfx00dpeLTsUtWxP5mTNg7/view

EDIT 2: Arjun sir said praggy App will be active from tomorrow i.e 19 feb

86

Hello everyone!

I am Aravind and I appeared for GATE CS in 2020, and I scored 82.67 marks and got 6th rank. This was my first attempt, in my final year of BTech. I have seen many students (including some of my friends) worked really hard for GATE but still not getting a good enough rank. My experience tells me that GATE CS requires smart work, and not just hard work, and I feel that was one of my biggest strengths. In this blog, I’ll share my own experience as well as some useful strategies and tips for future aspirants as well. I have broadly divided my preparation into 3 phases for convenience. (This is a long post, if you want to read only my tips for future GATE aspirants, you may skip my preparation experience and scroll to the bottom).

Phase 1 (Jan 2018 to May 2019):

Most of the core Computer Science subjects in the GATE syllabus are covered in 2nd year and 3rd year of BTech. So if you are a college student and thinking about giving GATE in future, 2nd year would be the ideal time to start your preparation (my personal opinion) so that you can study in parallel with your college. 

I myself started preparing in 4th semester of BTech, and started with Algorithms and Data Structures, which was one of my strong subjects. I also enrolled in an offline coaching, so that I don’t get carried away and complete syllabus on time. During this phase, I was able to finish most of the GATE syllabus in my coaching and also since I prepared well for my semester exams, I got a good grip on all the core subjects by this time. I also prepared neat and organized handwritten-notes for all subjects in my coaching itself.

Phase 2 (June 2019 to September 2019):

I started solving GATE Previous Year Questions (PYQs) from June, and also revised all of the subjects in parallel. After solving each PYQ, I would check the answer on GO website, and also read all the discussions and comments. This is very important, as solving a question correctly does not necessarily imply that you have fully understood the concept. This is where GO helped me the most- reliable answers for every GATE question or concept. I also spent a lot of time in solving questions from Maths, Aptitude and Verbal Ability because these 3 subjects are the most scoring subjects, and I didn’t want to lose a single mark here. Also, whenever I faced difficulty in solving any of the PYQs, I would write down that question/concept in my mistakes copy (I maintained a mistakes copy for keeping track of all the questions I found difficult / solved incorrectly). This helped me to not repeat the same mistakes, and my accuracy improved as a result. 

I allotted around 1 week per subject for solving all GATE PYQs. I also attempted a full-length mock test in the beginning of June, just to check how well I have prepared so far. But I failed miserably in that test, and could score only 26/100 marks. After giving that one test, I realized that it’s not enough to just study a concept. I made lots of careless mistakes/calculation errors, and lacked practice. After that, I decided not to give any more tests for a few months and completely focused on solving PYQs, to improve both accuracy and problem solving ability.

I also participated in my campus placements during this period, so I took a break of approximately 1 month to prepare for interviews and coding rounds. In my view, taking a break for campus placements is totally justified because if you have a backup job-offer in hand, you will feel less pressure in the months of December and January, leading to better performance in GATE. We don’t know what might happen in those 3 hours, so it’s good to have a backup. I managed to bag offers from both TCS (7lpa) and Infosys (8lpa), even though I didn’t prepare that much for interviews. If you prepare well for GATE, cracking interviews of software companies also becomes easier. In fact, in my Infosys interview, I was asked a few questions on Computer Networks, and I was able to answer them only because I prepared for GATE.

Phase 3 (Oct 2019 to Feb 2020):

Since I had already completed the PYQs and revision of all subjects, and also had backup job, I focused only on giving lots of mock tests during this phase. I started with topic-wise and subject-wise tests, and later moved on to full-length tests. I attempted multiple tests every day, and after every test I noted down all my mistakes in my mistake copy (whether it’s silly mistake or conceptual mistake). If I come across any new concept in Test Series, I first check whether it’s included in the GATE syllabus, and then studied that concept from Wikipedia or some standard resource, and included it in my mistake copy. From time to time, I also revised all my mistakes that I have noted down, so that I don’t repeat the same mistakes. For e.g., if you previously made a mistake in a Pipelining question in COA, the next time you see a similar question in another test, it should immediately click in your mind that you made a mistake here previously, and you would be more careful while attempting that question. Whether you get a single-digit rank or 2-digit rank or 3-digit rank will ultimately depend on how many silly mistakes you made in the exam hall. That’s why it’s crucial to properly analyze all your tests. Also, I always revised a subject after giving it’s test, not before giving the test. This way, it’s easier for me to analyze which concepts I’m forgetting.

I attempted more than 300 tests during this period. I know that it’s not required to give so many tests, but since I already completed my syllabus and had plenty of free time (I didn’t go to college after getting placed), I thought why not give as many tests as I can 🤣. When I finished all tests of one coaching, I would purchase yet another test series and continue giving more tests, just to keep the flow going. I also took a break of 3-weeks in December to prepare for my BTech semester exams, lab exams, etc.

After my semester exams, I had a lot of free time so I made short notes for each subject (15-20 pages per subject). I made short notes for all subjects in 3-4 days. Making short notes is very easy- Just read 10 pages of your main notes and compress it to make 1 page of short note, by including only the most important concepts and formulae. Short notes help you to revise all subjects very quickly just before the exam, and one more benefit is that while preparing the short notes, you become aware which concepts are the most important which needs to be kept at fingertips all the time.

In January, I was able to score 85-90 marks in most full-length mock tests, so I thought of giving the final touches to my GATE preparation. One last time, I solved all the PYQs of all subjects very quickly (I focused on medium/difficult problems and skipped the easy ones in which I was confident), and also kept on revising the full-length notes of all subjects in round-robin manner. Revision is the most important part of GATE preparation- after all, on the day of GATE exam, what matters is how much you remember, not how much you studied. 

I also attempted the Made easy Centre Based Test (CBT): it’s a mock test which you have to give in a real, proctored exam centre. The thing is, you might be very comfortable in giving mock tests while sitting in your home, but traveling to the exam centre and being seated in the exam hall with hundreds of other candidates can make you nervous and lose concentration. After preparing for GATE for 1-2 years, after putting so much effort, getting nervous in the exam hall is the last thing you want. So it’s good to be prepared for such situations by giving CBTs (Centre Based Tests).

During the last 1 week before GATE (1st Feb to 7th Feb), I decided to relax a bit, gave only one mock test, and just revised all my notes one last time. Still, after so much efforts and precautions, I became nervous in the exam hall due to some unforeseen circumstances, and ended up doing many silly mistakes, that too in easy questions (I attempted 64/65 questions in GATE). Luckily, I somehow managed to get 82 marks in GATE (Even I couldn’t believe it till I saw my GATE response sheet with my own eyes).

Some tips/pointers for future GATE aspirants:

  1. GATE is NOT just a test of your knowledge. It’s also a test of your aptitude (ability to solve problems), speed (solving 65 questions in 3 hours), accuracy (identifying and controlling silly mistakes), observation skills (reading and interpreting all questions properly), ability to remain calm under exam pressure, and even the ability to use the virtual calculator properly. So just having good knowledge is not enough for getting a top rank, you have to work on all the above points too.
  1. Give lots of mock tests and analyze them properly. You won’t know your mistakes and weak-topics till you start giving tests. Not giving tests or giving tests but not analyzing them properly, can be fatal. And maintaining a separate notebook for keeping record of your mistakes and weak-topics can be very helpful. 
  1. Don’t ignore Aptitude and Verbal Ability. Many students study the technical subjects for years, but completely ignore the Aptitude and Verbal section, and end up losing significant marks in the Aptitude section itself. I agree that Aptitude is very easy compared to core subjects, but still it’s good to practice them. Even solving the Aptitude and Verbal PYQs would be more than enough for GATE, do that atleast.
  1. Give equal importance to all subjects. Don’t check the subject-wise marks distribution and all. If you want to top GATE, you cannot afford to leave any subject, since easy questions can come from any subject.
  1. Don’t go into too much depth in any subject. It would mean less time for other subjects, and moreover GATE questions require just the basic concepts. Know what to study, and more importantly, know what NOT to study. Also, it’s good to follow standard resources but again, make sure you’re not spending too much time on one subject. And if you are following some coaching and want to clear doubts from standard resources, searching in books can be time-consuming. Alternatively, you can also use Wikipedia as a standard resource to clear doubts, it saves time (I did that for some subjects).
  1. Limit your usage of social media. This is very subjective and varies from person to person, but I personally find it difficult to manage time for both social media and preparing for competitive exams at the same time (maybe it’s just me, I don’t know). Since I was determined to top GATE at any cost, I did not want to take any chances, so I deleted every social media account during the last 7-8 months of my preparation, even Facebook and WhatsApp. You may keep a separate Facebook account for GO.
  1. Don’t follow any topper’s advice blindly (not even mine 🤣). Don’t just copy someone else’s preparation schedule or strategy, instead, create your own strategy (so that you can post it here when you top GATE next year). And don’t blindly trust any coaching or tutor to guide you in your journey. Don’t be afraid to think independently for yourself, and ask lots of questions. If some solution or concept doesn’t make sense to you, use the internet. Google let’s you search for anything in the world and gives you results in a few seconds, so use Google more often. If you can’t find your answers on Google, ask questions on GO. But at the same time, try not to argue with anyone during your discussions. It’s important to have an open mind while learning new concepts and solving new problems.

I will end this blog with one of my favorite quotes: 

Jaan laga do, ya jaane do!

87

Decidability Slides, Parsing Notes and Pipelining Slides/Video have been added. 

Adding all the previous Notes which I have made for GATE CSE here:

 

TOC:

Decidability Slides

Last year Discussions: 

Compiler Design:

DBMS

Combinatorics:

Mathematical Logic

Previous discussions: 

Graph Theory

 

Algorithms

Previous discussions: 

Programming:

Previous Discussions:

CO & Architecture

PIPELINING

https://gatecse.in/cache-misses/

Previous discussions: 

Operating Systems

Multi-level Paging

Previous discussions:

89
My interview was on 18th may as my registration number was even. People with odd registration number were called on 19th may.

Students were called for MS and M.tech. Prof. Sarang said that MS is their premier course.  Interview will be conducted accordingly. MS interview will be difficult as compared to M.tech. According to him the difficulty of M.tech interview will be 5/10. and for MS it's 9/10.

they took interview in 2 slots. a.) 10:30- 1:00      b.) 2:30- 5:00.

they called in alphabetical order. so mine was in the 2nd slot.

Average interview duration was around 15-20 min. but if someone was not able to answer questions then it got over in less than 10 minutes too. my panel consisted of 2 profs.

prof: whats your fav subject.?(they asked this question to everyone.)

me: algorithms

prof: do you know quick sort?

me: yes.

prof: how it works? time complexity? recurrence relation?

me: I explained partition algorithm. explained all the cases. and recurrence relation too and also solved that.

prof: ok good. now do you know what is the median of an array?

me: yes. middle element of a sorted array.

prof: ok good. sorting takes O(N log N). but we have to find the median in linear time. how to do that?

me: use count sort algorithm for sorting and then find middle of array.(this is not appropriate answer in all cases)

prof: what is count sort and why quick sort is considered to be the best sorting algorithm.

me: explained count sort. and told its limitation.

prof: now assume that count sort cant be applied there. i.e applying count sort is costly for given array.now find median in linear time.

me: (after thinking for around 10-20sec.) we can use partition algorithm.

prof: they asked me to explain.

me: i explained it. i also explained recurrence relation as they asked for it too.

then they gave me a recurrence relation. and i solved that using recursion tree method. i got stuck while writing its general term. but they helped me in solving that problem.

prof: write structure of binary tree.

 i wrote that.

prof: write a program to find product of leaves of a binary tree using recursion.

=>it was simple problem, initially i explained them how to find that. then i wrote the code. i missed one step which they pointed out. actually, I got nervous. I wrote the major steps(like the return statement, branch checking, whether the node is leaf or not, etc) but messed up in recursion step. Code was around 75-80% correct.

(their remark:

prof 1: programming thoda dheere  krta hai.

prof 2: yha to bhut programming krni hogi.)

prof: you have an array in which initially elements are in increasing order and after that elements are in decreasing order. find the point where change occured.

=>i told them that i will use modified binary search here. they asked what is it?. i told them that instead of dividing n(size of the array) by 2. i will start with first element and keep multiplying it by 2. i.e i will search for 1,2,4,8,16 .....  they asked some que related to it. i.e how will you keep your search within array.? I explained all that.

this logic was ok. then they gave me a situation where the change occurred at a distance of (3/4)n. they asked me to run the algorithm which i suggested. They asked for its recurrence relation and time complexity.

i said O(logn). but they were not convinced and they gave me its recurrence relation acc to which ans was O(logn^2).

(but acc to me its still O(logn).)

note: applying simple binary search would have been better and conventional answer for above problem. I made my life difficult by using modified binary search.

prof: ok. we are done. send next student.

#mine interview went for around 30min.

As mentioned in IIT Delhi brochure, weightage is 70:30. (70% for gate score).

#they said that result will be announced in a week.

After interview i can say these things:

1. Profs are really cool. they will help you if you got stuck anywhere.

2. If you are preparing for IITD interview then algorithms and Mathematics is must. even if you say that your fav subject is COA they will definitely ask problems from DS or algorithms. So it's better to chose algorithms as your fav subject.

3. Only basic problems are asked. So its better to focus on basics.

4. Dont get nervous and try to answer problems in hurry. Take your time ,they provide enough time.

5. Your gate score is not a guarantee that you will get IITD for sure. you have to perform in interview too. they dont publish any formal sheet where interview marks and gate score are added in specified ratio.

 

Result: I got selected for M.tech. :)
91

This year IITB decided to completely change the pattern. There was no written test (objective test). There was only 2 hours programming test. They extended the time by around 15-20 minutes during the coding test. So the total time was around 2 hours and 15 minutes.

There were 6 questions - 2 questions of 5 marks, 2 questions of 10 marks and 2 questions of 20 marks. The programming language allowed were C/C++. It was on a homegrown platform. They provided systems with Ubuntu. Editor was gedit. Basic instructions were provided on how to use the platform and to compile and submit the code.

 

These were the questions - 

 

1) Election (5 marks)

 

There are N number of people who are voting for leaders who are represented by numbers ranging from 1 to 100. So basically the input was like this:

Example input -

5
3
3
1
2
10
Output -

3

Here N is 5 (first line). Then the next five lines is the number of a particular leader. The output should be the leader with maximum number of votes.

 

2) Salary increment (5 marks)

 

I did not attempt this one so I don't remember the exact question. First line of the input was the number of lines to follow, say N. Then N lines following it in the following form - employee id, boss id, salary. After that the employee id of the employee whose salary has to be incremented is provided. I am not sure if the increment was provided with the input or if it was fixed. Let as assume that it was provided with the input.

 

This is an example input - 

3

100 200 10000
200 300 15000
400 800 5000
100 10000

 

Here employee id 100 has a boss whose id is 200 and employee id 100 has a salary of 10000. The constraint was if the salary of the employee increases the salary of the boss, then the salary of the boss has to be incremented by the same amount. So this will have a cascading effect where multiple employee's salary will have to be incremented.

 

3) Remove duplicates (10 marks)

 

In this problem, duplicate characters had to be removed (or compressed into single character). If there was any other character than a-z, "error" should be appended to the end after removing duplicates and invalid characters.

 

Single line was provided in the input. For example -

 

Input -

xxxyyyyyy
Output -

xy

 

Another input example -

Input - 

xxxxx1yy23
Output -

xy error

 

4) Reverse word in sentence (10 marks)

 

Given a string, reverse only the words in the string. Fist line of the input were number of inputs, say N. Then N inputs were on the next N lines.

 

Example input - 

3
this is a test
foo bar
i love CS

 

Output -

siht si a tset
oof rab
i evol SC

 

5) Line intersection (20 marks)

 

x, y coordinates of two line segments were provided. Output should be 1 if they intersect, otherwise 0. There were 4 lines in the input. First two lines were x and y coordinates of the fist line's end points. Third and fourth line were the coordinates of the end points of the second line segment.

 

Sample input - 

1 2
4 6
-3 5
10 12

 

6) Graph (20 marks)

 

In this problem, we had to remove all the nodes whose degree is greater than k. The value of k will be provided with the input. If a node has a degree greater than or equal to k, the node will be removed and all of its edges will be removed as well. The output should be the number of edges remaining in the graph after all the edges from the nodes of degree >= k is removed. The graph is an undirected graph. Self edges were allowed.

 

Sample input - 

5
1 2
2 3
2 5
4 4
5 6
2

 

First line is N, the number of edges. It is 5 in this sample input. Then N number of edges. In the end, the value of k which is 2 here. In this sample input, only node 2 and 5 have degree greater than or equal to 2. So we have to remove edges (2,3), (2,5), and (5,6). Therefore output would be - 2

 


 

After the coding test, I think 67 students were shortlisted. The number of positions available for RA were 28. I have listed the groups with the relevant skills. For most of the groups, they are not compulsory, but having those under your belt would certainly help you. Each group will give a presentation after you have been shortlisted. Then you will have to fill a form where you will order these groups according to your preference. This year a student was allowed to interview with exactly 2 reasearch groups. Depending on the results of programming test, the groups were allotted. So if you did well in the programming test, you will likely get your first two preferences.

 

These groups had RA positions available this year -

 

1) CSE SysAd (~5 positions)

  • Unix, Computer Networking

 

2) CC SysAd (~2-3 positions)

  • Unix, Computer Networking

 

3) Asynchronous Helpline (not sure about the number of positions. Probably 2)

  • Prof Kameswari Chebrolu
  • Relevant skills: Django/Python, Android

 

4) Center for Formal Design and Verification (3 positions)

  • Prof. Shetal Shah, Prof. Hrishikesh Karmarkar
  • Relevant skills: C, C++, Boost C++, OpenMPI

 

5) NVLI (5 positions)

  • Prof. Deepak B Phatak
  • Relevant skills: Ubuntu, OpenVstorage, Open_edX, Python, Django, Hadoop+, R etc

 

6) eYantra (2 positions)

  • Prof. Kavi Arya
  • Relevant skills: Machine learning

 

7) CFILT Lab (1 position)

  • Prof. Preethi Jyoti
  • Relevant skills: ML, NLP, CV

 

8) Information Security Research and Development (4 positions)

     

9) Smart Energy Informatics Lab (again not sure about the number of positions (Probably 2)

  • Prof. Krithi Ramamritham
  • Relevant skills: SQL, JS charting library
92

All College Wise Interview Experience Blog Links.

College Name Blog Link
IIT Delhi https://gateoverflow.in/blog/12695/iit-delhi-m-tech-interview-experience-list
IIT Hyderabad https://gateoverflow.in/blog/12600/iit-hyderabad-m-tech-ta-ra-interview-experience-list
IIT Madras https://gateoverflow.in/blog/12697/iit-madras-interview-experience-list
IIIT Hyderabad https://gateoverflow.in/blog/12698/iiit-hyderabad-and-iiit-city-tech-interview-experience-list
IIT Gandhinagar https://gateoverflow.in/blog/12699/iit-gandhinagar-m-tech-interview-experience-list
IIT Kanpur https://gateoverflow.in/blog/12706/iit-kanpur-m-tech-interview-experience-list
IISc Banglore https://gateoverflow.in/blog/12710/iisc-bengaluru-interview-experience-list
IIT Jodhpur https://gateoverflow.in/blog/12713/iit-jodhpur-m-tech-interview-experience-list
IIT Patna https://gateoverflow.in/blog/12738/iit-patna-m-tech-interview-experience-list
IIT Bombay https://gateoverflow.in/blog/12714/iit-bombay-m-tech-ra-interview-experience-list
IIT Tirupati https://gateoverflow.in/blog/12715/iit-tirupati-m-tech-interview-experience-list
IIIT Bangalore https://gateoverflow.in/blog/12722/iiit-banglore-interview-experience-list
IIT Palakkad https://gateoverflow.in/blog/12723/iit-palakkad-interview-experience-list
CMI https://gateoverflow.in/blog/12730/cmi-interview-experience-list
NIT Trichy https://gateoverflow.in/blog/12728/nit-trichy-interview-experience-list
IIIT Sri City https://gateoverflow.in/blog/12737/iiit-sri-city-interview-experience-list
IIST Kerala https://gateoverflow.in/blog/12726/iist-kerala-interview-experience-list
IIT Ropar https://gateoverflow.in/blog/12731/iit-ropar-interview-experience-list
IIT Kharagpur https://gateoverflow.in/blog/12733/iit-kharagpur-interview-experience-list
IIT Guwahati https://gateoverflow.in/blog/12732/iit-guwahati-interview-experience-list
IIT Indore https://gateoverflow.in/blog/12734/iit-indore-interview-experience-list
IIT Bhilai https://gateoverflow.in/blog/12735/iit-bhilai-interview-experience-list
Bits Pilani https://gateoverflow.in/blog/12736/bits-pilani-interview-experience-list
BARC https://gateoverflow.in/blog/12717/barc-interview-experience-list
ISI Kolkata https://gateoverflow.in/blog/12716/isi-kolkata-m-tech-interview-experience-list
TIFR https://gateoverflow.in/blog/12718/tifr-interview-experience-list
ISRO https://gateoverflow.in/blog/12719/isro-interview-experience-list
IOCL https://gateoverflow.in/blog/12720/iocl-interview-experience-list
Company Interviews https://gateoverflow.in/blog/12721/company-interview-experience-list

 

All Year Wise Interview Experience Blog Links.

Year Blog Link
2021 https://gateoverflow.in/blog/14153/iits-2021-interview-experience-list
2020 https://gateoverflow.in/blog/12739/iits-2020-interview-experience-list
2019 https://gateoverflow.in/blog/12743/iits-2019-interview-experience-list
2018 https://gateoverflow.in/blog/12746/iits-2018-interview-experience-list
2017 https://gateoverflow.in/blog/12759/iits-2017-interview-experience-list
2016 https://gateoverflow.in/blog/12760/iits-2016-interview-experience-list
2015 https://gateoverflow.in/blog/12775/iits-2015-interview-experience-list
2014 https://gateoverflow.in/blog/12776/iits-2014-interview-experience-list
2013 https://gateoverflow.in/blog/12777/iits-2013-interview-experience-list
2012 https://gateoverflow.in/blog/12778/iits-2012-interview-experience-list
2011 https://gateoverflow.in/blog/12779/iits-2011-interview-experience-list
2010 https://gateoverflow.in/blog/12780/iits-2010-interview-experience-list
2008 https://gateoverflow.in/blog/12781/iits-2008-interview-experience-list

 

93

Thank you Sachin Mittal for making this wonderful video on how to make use of all GATE Overflow features. The below two videos describes the features of GO site and also GO PDF. 

www.youtube.com/embed/o9fMhTVVYto

www.youtube.com/embed/ANBH8jAEH1c

 

94

 

IIT, Delhi GATE Overflow Interview Experience Links: 2017 to 2020

 

Year Interview Experience Blog Link Program Specialization
2020 https://gateoverflow.in/blog/10680/iit-delhi-cse-ms-r-interview-experience-july-2020 MS Research CSE
2020 https://gateoverflow.in/blog/10572/delhi-school-information-technology-interview-experience MS Research CSE
2020 https://gateoverflow.in/blog/9624/admission-procedure-in-iiitd M.Tech. CSE
2020 https://gateoverflow.in/blog/10587/iitd-ms-cse-systems-experience MS CSE
2019 https://gateoverflow.in/blog/8189/iit-delhi-cse-mtech-interview-14-may M.Tech. CSE
2019 https://gateoverflow.in/blog/8185/iit-delhi-mtech-interview-13th-may-2019 M.Tech. CSE
2018 https://gateoverflow.in/blog/4766/iit-delhi-interview-experience MCR & MSR CSE
2018 https://gateoverflow.in/blog/4596/delhi-interview-experience-tech-computer-technology-2018 M.Tech. CSE
2018 https://gateoverflow.in/blog/5435/iitd-interview M.Tech. CSE
2017 https://www.facebook.com/groups/gateoverflow/permalink/635975086607705/ M.Tech. CSE
2017 https://gateoverflow.in/blog/1950/iitd-interview-experience M.Tech. CSE
2017 https://gateoverflow.in/blog/1913/iit-delhi-interview-experiance M.Tech. CSE

 

IIT, Delhi Other Interview Experience Links: 2011 to 2019

 

Year Interview Experience Blog Link Program Specialization
2019 https://www.geeksforgeeks.org/iit-delhi-m-tech-admission-interview-experience/ M.Tech. CSE
2019 https://madhurimamtechinterviewexperiences.blogspot.com/2019/06/mtech-admission-interview-at-iit-delhi.html M.Tech. CSE
2019 https://chaitrasj.github.io/interview-exp/2019-05-15-my-interviews-exp/ M.Tech.  CSE
2019 https://www.quora.com/q/hqfuevjanjwhutkz/IIT-Delhi-Computer-Technology-15th-May-2019 M.Tech. CSE
2018 https://www.quora.com/q/from0to1/IITD-interview M.Tech. CSE
2017 https://www.techtud.com/blog/mtech-interview-experience-iit-delhi-2017 M.Tech. CSE
2015 http://loosetention.blogspot.com/2015/05/my-gate-struggle-part-7-indian.html M.Tech. CSE
2015 http://loosetention.blogspot.com/2015/05/my-gate-struggle-part-6-indian.html M.Tech. CSE
2015 https://www.quora.com/How-was-your-interview-experience-at-IIIT-Delhi-for-an-M-Tech-in-Computer-Science M.Tech. CSE
2014 https://vivekvsingh14.wordpress.com/2014/08/31/iiit-delhi-2014-m-tech-cse-written-and-interview-experience/ M.Tech CSE
2014 https://www.geeksforgeeks.org/iit-delhi-msr-cs-interview/ MS Research CSE
2011 https://harishiyer57.wordpress.com/2011/05/31/iit-delhi-interview-experience/ M.Tech. CSE

 

95

You can download the ISI/CMI PDF from the below link.

DOWNLOAD

PS: This is the first version of the PDF and though we have spent a lot of time doing tagging, some of the topics might be given wrong unlike GATE PDF which has gone through multiple revisions. 

96
I am planning to give UGC NET exams in Computer Science. I have a big time gap between the duration my PG course and now. I expect proper guidance based on the following points.

* I understand that there are lots of similarities between the pattern of questions between GATE and NET.

* There is always a gap between what we study in theory and what is asked in exams (both theoritical and numerical based questions). Everywhere in blogs, people advise that start solving previous year questions after refreshing the basics. But in reality, for thousands of people (from checking with my friends circle & saw people with same state in many study groups in what's app and facebook, I observed this) who do self study are clueless about how the gap between the theory we study and the questions we face in these exams can be filled.

* I would like to start from the scratch and have no any constraints or issues from learning things in this journey.

* I expect a proper, practical & down to earth support/guidance/suggestions for this. I hope such guidance would be helpful to many people including me. Thanks in advance.
97

GATE 2017 Response is available now.

You can check this by login to your gate Account

http://appsgate.iitr.ac.in/

98

Lets first prove the number of states in the minimal DFA for accepting binary strings divisible by a given number say $12$

We need $3$ states for checking if a binary number is divisible by $3$ - each state corresponding to remainders $0,1,2.$ Here, remainder $0$ will be the final state for divisibility by $3$. If we add a '0' transition from this state to another state and make it FINAL, we get divisibility by $6$ as a '0' at end ensure number is divisible by $2$ and also retains the property that the number is divisible by $3$ which makes it divisible by $6.$ Add one more state like this and we get numbers divisible by $3\times 2\times 2 = 12.$ Thus we need $5$ states in the minimal DFA for divisibility by $12.$


The above construction works because in the DFA for divisibility by $3$, there will be no outgoing edge on $0$ to the final state from any other state. This is because no number not divisible by $3,$ when multiplied by $2$ will become divisible by $3$ (holds for any odd number). But there will be self edge on the final state for '0' - when we add the new state for divisibility by $6,$ we remove this edge and make it go to the new FINAL state. 


The above construction works in general too. To check if a binary number is divisible by $n$

  1. If $n$ is a power of $2$ we need $\log_2 n+1$ states in the minimal DFA 
  2. If $n = 2^k \times m,$ where $m$ is odd, then we need $k + m$ states in the minimal DFA

PS: To be proved: To check a binary number for divisibility by any odd number $k$ requires $k$ states in the minimal DFA.


To find the minimal number of states in the DFA accepting binary strings divisible by $m$ and $n:$

Here, we have to check divisibility by $m$ and divisibility by $n$. So, we can take this as divisibility by $\text{LCM}(m,n).$


To find the minimal number of states in the DFA accepting binary strings divisible by $m$ or $n:$

99

$\text{C programming data structures and algorithms}$

  • Question on function scope on automatic and register addressing mode

  • what would be the output of a function was given inside which there was again a recursive call to that function with pre decrement operator and after that printing the value of x

  • Two questions directly from master method case 2 and case 3

  • 1 question on associativity and precedence order

  • which sorting algorithm is stable the answer was counting sort and merge sort

  • Postfix to infix conversion

  • Maximum N swaps required which algorithm the answer was selection sort

  • INPUT WAS GIVEN AN ARRAY AND AFTER SOMETIME THE ARRAY POSITION WAS GIVEN AND ASKED WHICH SORTING ALGORITHM HAS BEEN USED SO THE ANSWER WAS QUICK SORT

  • ONE QUESTION ON STACK PUSH AND POP INSTRUCTIONS WERE GIVEN AND WE WERE ASKED THE WAY THE ELEMENTS ARE GETTING OUT OF THE STACK

  • RECURSIVELY CALLING THE FUNCTION AND ASKED WHAT WILL THIS FUNCTION IF CALCULATING SO THE ANSWER WAS HEIGHT OF THE TREE

  • FUN QUESTION ON TRUE AND FALSE ON RED-BLACK TREES AND AVL TREES

  • ONE QUESTION ON SOURCE AND SINK ALGORITHM FOR FORD FULKERSON

  • A[i][j][k][l] in pointer form

$\text{Computer Graphics}$

  • COHEN SUTHERLAND LINE CLIPPING: WHICH OF THE LINES NEED NOT BE CLIPPED

$\text{TOC and compiler}$

  • QUESTION ON REGULAR EXPRESSIONS

  • QUESTION GIVEN THE GRAMMAR WHAT WILL BE THE REGULAR EXPRESSION

  • QUESTION ON FINITE AUTOMATA 

  • GRAMMAR WAS GIVEN, ASKED IT IS REGULAR OR NOT?

  • QUESTION ON MINIMUM DFA

  • IS THE GRAMMAR AMBIGUOUS OR NOT

  • WHICH OF THE GRAMMAR IS LL 1

  • LL1 GRAMMAR IS PARSE BY WHICH PARSERS? TOP DOWN, RECURSIVE DESCENT OR PREDICTIVE?

$\text{Operating Systems}$

  • DITTO GATE LIKE THREE PROCESSES P1 P2 AND P3 ARE THERE EACH REQUIRE AT MOST 3 RESOURCES AND CURRENTLY WE HAVE 7 RESOURCES WILL THERE BE DEADLOCK ANSWER IS NO

  • PROCESSES ARE P1 P2 AND P3 E RESOURCES ARE R1 R2 R3 R4 SOME OF THE RESOURCES ARE WITH THE PROCESSES AND THERE IS A DEMAND OF SOME RESOURCES IS THERE A CYCLE YES

  • DIRECT QUESTION ON BANKERS ALGORITHM

  • QUESTION ON ROUND ROBIN SCHEDULING AVERAGE TURNAROUND TIME OF THE PROCESSES IN THE QUEUE WAS ASKED

  • QUESTION ON SJF AND ROUND ROBIN PROCESSES FINISHING ORDER ON COMPLETION TIME ASKED

  • IN A TWO LEVEL PAGE TABLE THE MAIN MEMORY ACCESS TIME EFFECTIVE IS A AND WHEN THERE IS A THREE LEVEL PAGE TABLE THE EFFECTIVE MAIN MEMORY ACCESS TIME IS B, SUPPOSE THE PAGE FAULT RATE IS R WHAT IS THE RELATION BETWEEN A AND B WHEN MAIN MEMORY ACCESS TIME IS M

  • 10% OVERHEAD ON PAGE FAULT, WHAT WILL BE THE PAGE FAULT RATE

  • DIRECT QUESTION ON LOOK DISK SCHEDULING

  • ONE VERY EASY QUESTION ON I NODE WAS GIVEN FOR 3 DIRECT POINTERS TO INDIRECT POINTERS AND 3000 INDIRECT POINTERS AND DISK BLOCK SIZE WAS 1KB WHAT IS THE MAXIMUM FILE SIZE

$\text{Digital Logic and design}$

  • WHAT WILL BE THE OUTPUT AFTER 3 CYCLES ON D FLIP FLOP COUNTER WAS GIVEN

  • N =X MINUS Y TWOS COMPLEMENT WAS ASKED AND X WAS A 11 BIT BINARY NUMBER AND Y WAS 7 BIT BINARY NUMBER

  • (111) IN OCTAL SYSTEM WAS GIVEN THEN WHAT WILL BE THE HEXADECIMAL AND DECIMAL REPRESENTATION FOR THE SAME

  • QUESTION ON 1: 4 DECODER WAS GIVEN WHAT WILL BE Q3 ON SELECT LINES ANSWER WAS S1S0

  • QUESTION ON IEEE 754 SIGN EXPONENT AND MANTISSA (8 bit)

  • One question on shift register, Inital and final state were given, we were asked, which shift operation is performed to get the final output, left shift, right shift, left shift with carry, and so on.

$\text{COMPUTER VISION AND NEURAL NETWORKS}$

  • WHICH FILTER IS USED FOR SATELLITE IMAGES GAUSSIAN FILTER IS ANSWER

  • YOU ARE GIVEN A NEURAL NETWORK FOR CLASSIFYING CATS AND DOGS NOW YOU WANT TO CLASSIFY OTHER ANIMALS WHAT WILL YOU DO SO THE ANSWER IS BASICALLY WE WILL UPDATE THE HIDDEN LAYERS IN THE CENTRE

SOFTWARE TESTING AND JAVA

10–12 QUESTIONS( I SKIPPED)

$\text{DATABASE MANAGEMENT SYSTEM}$

  • ONE QUESTION ON NESTED SQL

  • ONE VERY DIFFICULT QUESTION ON NOSQL

  • one question on top 5 expensive books nested SQL (Previous year)

  • one question on sector address <Cylinder no, surface no, sector number was given> Previous year

$\text{Computer organisation and Architecture}$

  • TWO TO THREE QUESTIONS ON PIPELINES NUMBER OF CYCLES

$\text{PROBABILITY AND APTITUDE}$

  • VERY INTERESTING QUESTIONS ON PROBABILITY THERE WAS A BAG CONTAINING 10 NUMBERED BALLS. WE HAVE 4 BLUE BALLS 4 RED BALLS AND 2 GREEN BALLS HOW TO WHICH WE HAVE TO SELECT TO BLUE AND TO GREEN BALLS HOW MANY WAYS

  • 1,2,3,4,5 numbers are given , two numbers are selected, probability that the sum is prime 10/25

  • three consecutive numners are given n, n+1 and n+2,  such that n>1their product is divisible by some of the number of the form ${n}^2-1$ you can do that by taking n as 2

$\text{Graph Theory}$

Previous year GATE question number of hamiltonian cycles in a complete graph directed and undirected was not specified so and directed graph answer was given in the options

 

$\text{Computer Networking}$

  • NUMBER OF HOSTS QUESTION

  • TWO SOURCES WERE GIVEN AND SOMEHOW, DATA IS LOST, WHAT CAN BE THE DEVICES IN BETWEEN? ROUTER AND ROUTER, HUB AND ROUTER, SWITCH AND SWITCH, HUB AND HUB?

  • QUESTION ON BANDWIDTH DELAY PRODUCT

  • QUESTION ON CALCULATION ON LENGTH OF PACKET WHEN EFFICIENCY WAS 50%

  • QUESTION ON IP ADDRESSING SUBNET MASK

 

 

THANK YOU EVERYONE FOR LIKING AND SHARING

100

Before you make a decision to repeat or not I would like to make two things clear:

(1) If you are getting a 3 digit or 4 digit rank this year does NOT imply next year you will definitely get a 2 digit or single digit. You need to earn it. 
Let’s assume 500 aspirants(much less than actual number) are repeating with this year’s rank within 5000, all of them cannot get within TOP 200. And final year students are also there to give tough competition apart from repeaters. You need to give your best.

(2) Set Target: GATEOVERFLOW is increasing the competition with every year because it’s free, provides quality resource and is  accessible to every one.
Here’s the proof

Gate Year Marks to get into TOP 100(approx) Topper’s Marks
2010 60 -
2015 66.59 85.85
2016 70 85.95
2017 70.16 86.26
2018 67 83.33
2019 75.33 88.67

Source : https://gatecse.in
You can see the increasing marks year wise.
Note: The topper’s marks is 80+  every year irrespective of the toughness of paper.
We can safely say that next year one should target atleast $70$ to be assured to be in top $100$. But 70 marks might not guarantee a rank in top $100$, infact this year it does not fetch a rank in top 200 also. So better aim for $75$. Moreover others will also see the data and put extra efforts in their preparation.
You can be argue that in 2018 the paper was comparatively tougher and top 100 went down to 67, so target should be around 70 and not 75,  the competition is increasing every year and having a small margin of safety is better than crying after results.


Now once you are clear with your goal there will be various questions that comes to your mind:

  • Give with a job !(Make proper assumptions that how many hours you could give in weekdays and weekend, what if there is project pressure in December/ January and you are asked to work on weekends)
  • Partial repeat (continue with job for few months and resign mid way)
  • Full time repeat.
  • $2-3$ months leave before exam: (Many companies do allow you to take a maximum break of 3 months with loss of pay, figure it out that it is allowed in your company or not and will that be enough.)

I will advise do to prepare your schedule in advance.

  • Weak Concepts : Strengthening the weak concepts, take out the syllabus from Gate site and note down your weak areas/ conceptually wrong and figure out the time required for completing them.
  • GO book: All previous year questions should be solved.
  • Subject wise testPrevious year papers as subject wise test will ensure that you have properly covered the topic well even the tough questions before 2010. 
  • Previous Year test ($2010-2019$): Evaluate how’s your preparation, your basic attempt strategy, time management should be fixed, you can always modify it later.  
  • Difficult Problems of GO book: You must have faced difficulty in solving few problems or liked few problems which you would like to re-do once more, a month or two before Gate exam. So it’s important to mark them.
  • Test Series or anything else you would like to add (In my case I added TIFR and two CBT)
  • Aptitude : Most ignored but essential part, if you are confident that you can  do well and don’t need much practice, then my suggestion would be that every day from December 1st  take 15 minutes daily and solve one aptitude paper from previous year. There are 8 sessions every year and you will get previous year paper from official gate website. It will ensure you have all basic formulas covered and you are able to solve them fast.
  • Previous Year test ($2010-2019$) with 2 hour 30 minutes as stipulated time : (Even if you have given them for $n^{th}$  times given it for $(n+1)^{th}$ time.) This should be done at last, when you are complete with your preparation. So if you are doing job then you can give it only on weekend and will need 7 weeks for 15 test and for those repeating full time will need 2 weeks. It is recommended that you give them @ time of day you have your exam(9:30-12:30 or 2:30-5:30).

Revision: Continuous revision of strong subjects is also required to ensure none of your topics becomes unfamiliar with same.

Now when you have figured out what needs to be done assign months to them, and you could assign a schedule for it. And decide whether you can do it with a job or you need full time repeat or partial repeat.

In my case I figured out that 5 months will be enough for me. (1st September to 31st January )
My last working day was on 31st August 2018.
While working I used to study on weekends which made sure that I am in touch with the subjects. 
Make proper schedule what needs to be done, if you don’t have a strict schedule you will keep delaying your studies. The competition will be getting tougher each year, so give your best.
 

To top GATE you have to beat quality people and not just those around you.
So you can help others, but first, help yourself.