Recent posts in Others

Recent posts in Others
1

I searched throughout the internet and was not able to find a single blog that would provide any information about MTech CS written examination of ISI Kolkata that happened on  18th July, 2021. I have made this blog for starting a discussion about the paper and know what might be the expected cut-off this year. 

I attempted MTech CrS, Math section for PCB and was able to solve 4.5 questions out of 10. I did around 20 questions in PCA from which 3-4 I know  are incorrect. People who attempted  this year, how did your exams go and what do you expect from it? Also, what might be the tentative date for results? Also, I have a 2 month notice period in my company so when shall I give my resignation? Do I give my resignation after the results are announced or do I give it right now to avoid any problems? I am not sure about getting selected but just in case if I get selected I am willing to leave my company.

pussyDungeon posted in Others Jul 23, 2021
1,784 views
2

The main point is – GATE exam is lot conceptual & it is easy if your concepts are good, It is better to give more time to concepts.

Even if you have less time, at-least get the syllabus, get the topics in syllabus & study those topics from text books. After that see GO book for different variety of questions .

 

Then do a couple of questions from each topic, move to next one as soon as you are comfortable. Make sure you revise the concepts regularly & be confident..…

Anyway those who are preparing are expected to cover all topics by this month end. And they should be scoring 60+ in full length mock tests or minimum 50+. But the key is in getting this to improve by another 15-20 marks over the next 2 months.

 

This requires careful analysis of the exam performance - identifying weak topics - and making them strong (Even without any exam, you should be knowing your weak topics), learning how to avoid mistakes, learning how to optimize time better etc.…

 

But after this self improvement and revision must always be done individually. I was never a preacher and yet this is my third blog. I just wanted to say these for a long time.

Hope I have said everything now. All the best for GATE 2022 :)

 

 

1. https://gateoverflow.in/blog/360/preparing-to-be-in-iisc-top-iits

 

2. https://gateoverflow.in/blog/375/preparing-to-be-in-iisc-top-iits-2nd-blog

 

3. https://gateoverflow.in/blog/379/preparing-to-be-in-iisc-top-iits-3rd-blog

 

4. https://gateoverflow.in/blog/1664/i-got-1500-5000-rank-in-gate-what-should-i-do

 

5. https://gateoverflow.in/previous-years

 

6. https://gateoverflow.in/78777/how-to-write-gate-exam-tips-and-tricks-on-time-management

asqwer posted in Others Jul 4, 2021 edited Jul 23, 2021 by asqwer
by asqwer
797 views
3

 

The importance of previous years’ questions on Gate Exam is very high, most of the question in gate exam revolve around the previous 15 years questions....

These previous years’ question will give us a good understanding of what types of question they will ask in the exam, so we can make our preparation in that direction....

 

If I revise a subject, I take previous GATE questions and see if I can solve them. If not I revise again. Finally I'll solve them even after 1-2 days….

For ambiguous, confusing, difficult questions solutions might be worth looking.

But anyway after maximum 10 questions from a subject- one should know what to expect in GATE from that subject.

At this stage one can stop solving....

 

PS: Never run behind test series......

 

After completing a subject i solves 15 year pyq if i stuck in any question then i refer to notes. If i have not studied that topic then i looks solution…

 

This tip is very important specially when very less time is left in your GATE exam. In this time, you should focus only on solving previous year GATE question papers instead of your GATE study material question papers.

 

These question papers (ISRO, DRDO, etc) might have very difficult and challenging problems, but the focus of the GATE exam is on your aptitude, rather than the depth of the subject.

Therefore in my opinion, it’s better to solve last 15 year GATE question papers multiple times rather than solving questions from other material….

 

If you really want a good rank in GATE, then you should utilize your last month in solving last 15 year papers at least twice. You can easily do this by solving at least one paper a day. I would suggest you that after getting up in the morning, first of all solve at least one GATE question paper….

While solving the paper, keep in mind that you are sitting in the exam room. You can’t refer any books, notes or solutions and you have just 3 hours time limit.

After that you will be free to spent rest of the day in analyzing the question paper & your mistakes, revising notes and solving solving difficult problems etc…

 

I would also like to share my own experience which might help people who are working in some company. When I was preparing for my GATE Computer Science 2022 exam, in which I could achieve I used to get up between 4-5 am and then solve at least one question paper before going to office.

 

Then in free time , I used to analyze the paper & my mistakes and discuss the difficult problems with my friend. Revising of the notes was used to be done by me mostly in evening....

I hope it will help you in managing your preparation time ….

P.S. If you liked this tip, then I would like to request you to like it and share it with your friends. If possible, you can also share your experience in the comment, which might help other people..…

 

 

 

  1. https://gateoverflow.in/previous-years

 

  1. https://gateoverflow.in/exams/tests-by-mentors

 

  1. https://gateoverflow.in/exams/tests-by-mentors?sort=taken&fbclid=IwAR0eed1Szx_IFR-tI79TH1bG0jijKSrd1OjbBaseJHGHEppWJpbVOqL7lew

 

  1. https://gateoverflow.in/exams/tests-by-mentors?type=3&fbclid=IwAR0T21smyJqnioxRY1Hv40S9ZMM9rmCEWUWdsapsKTIjCq5RhjnG7j8lCUc

 

  1. https://gateoverflow.in/exams/tests-by-mentors?sort=taken&fbclid=IwAR0eed1Szx_IFR-tI79TH1bG0jijKSrd1OjbBaseJHGHEppWJpbVOqL7lew

 

  1. https://gateoverflow.in/exams/gateoverflow?sort=taken&fbclid=IwAR1D-fs9IBrxeeWI7ldjrE2TJB_inhAM2AZMt4zdJZYqE90bHan1-zmFAoU

 

  1. https://gateoverflow.in/exams/gateoverflow?type=3&fbclid=IwAR0FzFNE1dGKadIiqSDXxVFKQ4f-b0WJVlLfGBLjZI2mmA194DO4sfyrOCk

 

  1. https://gateoverflow.in/exams/gateoverflow?sort=taken

 

  1. https://gateoverflow.in/exams/external-tests?type=1&fbclid=IwAR0T21smyJqnioxRY1Hv40S9ZMM9rmCEWUWdsapsKTIjCq5RhjnG7j8lCUc

 

Tests by Mentors (Bikram Ballav)

GO-17 Mock 1

GO-17 Mock 2

GO-17 Mock 3

GO-18 Mock 4

Mathematics 2

General Aptitude 2

Digital Logic 2

Programming 2

Data Structure 2

Algorithms 2

Theory of Computation 1

Theory of Computation 2

Compiler Design 1

Database Systems 1

Database Systems 2

Computer Networks

Computer Architecture 1

Computer Architecture 2

Operating Systems 2

GO Tests

GO2017 Aptitude 1

GO2017 Mathematics 1

GO2017 Programming 1

GO2017 Data-Structures 1

GO2017 Algorithms 1

GO2017 Digital Logic 1

GO2017 Operating Systems 1

GO2019-Compiler1: Parsing

Tests By Mentors (Ruturaj Mohanty)

Test by Ruturaj: Mock 1

Applied Course Tests

Applied Course 2019 Mock1

 

..... Free mock test ......

 

 

 

asqwer posted in Others Jul 4, 2021 retagged Jul 23, 2021 by asqwer
by asqwer
1,695 views
4

GATE Topper Algorithm

1. Check topics from this document

2. Study Them From Any Standard Textbook, Else Go To Nptel

3. Try a couple of simple questions from end chapters to know if you understand basics of that topic

4. Try GATE previous years related questions

5. If you find some questions in GATE papers not related to the topic you studied, go back to Step 2. ..

 

Before using the book 1. The books and video lectures mentioned are the best possible sources for the subject and you can choose one of them or as needed.

 

For doubts regarding books and videos check GATECSE - Books and GATECSE - Video Lectures or better write your query on the.…

 

2. Types of Problems section has been made after analyzing through many previous year GATE question papers.

It does not guarantee the questions will only come from those mentioned, but gives you an idea how and from questions have been asked. But if you aim high, then please complete full syllabus.…

 

3. [XYZ] is a short tag for the book mentioned so that we don’t have to write full names of the authors.

So don’t get confused when you see them in the Topics and Chapters table...

 

 

 

 

 

  1. https://drive.google.com/file/d/0Byt7-j-JD0d0bmxlRkZGcjN2cjA/view

 

  1. https://www.apoorvpanse.co.in/iitiisc-nptel

 

  1. https://sites.google.com/view/nptelcse/courses

 

  1. https://gateoverflow.in/previous-years

 

  1. https://www.mediafire.com/folder/gp6z7khjzyl8d/gate_materials?fbclid=IwAR0ezzTYvJdobF2hXtr3xVNZpZOFtw96yHAywR2_j9BOKGe1mBNSgVUcsvw#gp6z7khjzyl8d

 

  1. https://www.mediafire.com/folder/gp6z7khjzyl8d/gate_materials?fbclid=IwAR0ezzTYvJdobF2hXtr3xVNZpZOFtw96yHAywR2_j9BOKGe1mBNSgVUcsvw#9xiori58gq22i

 

  1. https://www.mediafire.com/folder/gp6z7khjzyl8d/gate_materials?fbclid=IwAR0ezzTYvJdobF2hXtr3xVNZpZOFtw96yHAywR2_j9BOKGe1mBNSgVUcsvw#mp3qyi2prh3fb

 

  1. https://classroom.gateoverflow.in/

 

 

  1. https://drive.google.com/drive/folders/1AXjpvYnZomcFcki9Vb8r5RKrJPVKbNjR?fbclid=IwAR0HDzPYrLb9wdkBWSSPpX_BHoOcbVUc2TxjEwKxLHZ_kcw4ec5vCs9_u7g

 

  1. https://drive.google.com/drive/folders/1pZheUyebxs25F_xhZ0pIlEx_fogE-Hc_?fbclid=IwAR0HDzPYrLb9wdkBWSSPpX_BHoOcbVUc2TxjEwKxLHZ_kcw4ec5vCs9_u7g

 

  1. https://drive.google.com/drive/folders/1OXc1-utb8GoWr1LL9jCU1eI_oJR0mG0e?fbclid=IwAR2b6g0W-IvVjJCkTPwzImIxdLYceWL_O09GjzXL-8rrL0AB5RVZ-eCWu_8

 

asqwer posted in Others Jul 3, 2021 edited Jul 23, 2021 by asqwer
by asqwer
920 views
5


I made a progress tracker sheet to prepare for GATE 2022.
To make your own edits: Go to File>Make a copy.
This document is very versatile & has many useful features for preparation analysis.
You can edit to your liking.
It contains 4 sheets within it: schedule, test_series, topic_analysis, print_schedule

Sheets Description:

  1. schedule: This sheet is based on the GO schedule for 2021. It has all the resources/standard books/lectures listed as per the GO website. It also has progress analysis features to help you keep on track.
  2. test_series: To analyze your test series performance. Also has some nice charts ;-). 
  3. topic_analysis: basic topic analysis by their weightage. Based on geeksforgeeks.
  4. print_schedule: A printable version of sheet 1 with only critical columns. It prints out to a 3-page document which you can stick to your wall.

Hope this tracker helps you in your preparation. Any suggestions for improvement is welcome.
All the best!!

PS: This document took some time to make as I have tried to use formulas for convenient use and to have a feedback that actually benefits your preparation.
Also use google sheets to open the doc.
Sample Pictures:

Progress rate automatically calculated
Progress rate automatically calculated
Column auto colored. Progress column green/red depending on progress rate. Dates are calculated automatically.
Column auto colored. Progress column green/red depending on progress rate. Dates are calculated automatically.
Also has some cool charts B-).
Also has some cool charts B-). 

 

hitchh1ker posted in Others Mar 24, 2021 edited Mar 24, 2021 by hitchh1ker
1,366 views
6

Hello Everyone,

Gate result is out,  Please log in onto the appsgate website and check your result and let’s discuss here, what is the possibility about the colleges and arjun sir please update the college predictor app with the new gate result

https://appsgate.iitb.ac.in/

shgarg posted in Others Mar 19, 2021
by shgarg
1,176 views
7

For those waiting on GO book for GATE 2022

PS: Exact PDF version will be made available and only those interested in hardcopy needs to fill in there interest here. This form is just for knowing interest and those filled will be informed when GO book prebooking starts. (We wont spam you or sell your emails)

Last book details can be seen here on Amazon including book images and all.

https://www.amazon.in/Overflow-Computer.../dp/9353821657

https://forms.gle/wxvPFp3nBScJNLWB7

Anyone interested in sponsorship please contact admin at gateoverflow.com

gatecse posted in Others Mar 7, 2021 closed Mar 8, 2021 by gatecse
by gatecse
2,013 views
8

IIT Bombay has released Response key for gate 2021, you can check that on GOAPS. I hope gate overflow will provide the correct solution and rank predictor with normalization very soon. Let’s discuss here if you find any anomalies around the gate cse exam 2021.

 https://appsgate.iitb.ac.in/

shgarg posted in Others Feb 18, 2021 edited Feb 18, 2021 by shgarg
by shgarg
14,880 views
9
Hello Guys ...We can Discuss all Gate 2021 Shift 2 related Questions and doubts here. Please post your answers and any doubts here.

My thoughts on paper 2: Paper 2 was bit lengthy , as some questions were really time consuming. Also MSQ were bit tricky, I have seen paper 1 also, and it seems that paper 2 was bit tougher than paper 1, hope normalization would do some Justice.
himanshu19 posted in Others Feb 16, 2021
6,271 views
10

JEST 2021 Registrations are open.

Last date for submitting online applications and payments: 14 February 2021.

Exam date: 11 April, 2021.

JEST can be used for admission in IMSC and IISC.

Useful blogs regarding JEST:

https://gateoverflow.in/blog/8800/tifr-and-jest-exam

https://gateoverflow.in/blog/10847/jest-theoretical-computer-science-exam-gateway-iisc-other

Shiva Sagar Rao posted in Others Jan 11, 2021
2,431 views
12

$\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

ijnuhb posted in Others Nov 2, 2020 edited Dec 8, 2020 by ijnuhb
by ijnuhb
4,877 views
13

Many institutes consider JEST score for selection including IISc Bangalore, TIFR, IISER and many more good institutes.You can check the list of participating institutes in official site.

  • JEST(Joint Entrance Screening Test) is conducted in many field and TCS(Theoretical Computer Science) is one of that field.
  • This exam is conducted after 1 or 2 weeks of GATE and forms are out in December.Mode of this examination is offline.
  • Duration of this exam is 180 minutes out of first 75 minutes are given for PART A and remaining for PART B.

JEST TCS exam is divided into 2 parts.

Part A (Objective)

Part B (Subjective)

1) PART A (Objective)

  • Part A consists of 25 questions.Each questions carry +3 marks for correct answer and -1 for incorrect answer.
  • Most of the question asked in Part A are from subject like DS,DAA,C prog,TOC, Discrete (P&C, graph theory specially).
  • Focus on TCS subject because Exam itself is TCS.
  • Difficulty level of questions are same as GATE so no extra preparation required for Part A if you have studied properly for GATE.
  • Just revision of your note is enough and if you are aiming for IISc then try to attempt as much as you can. According to me 20–21 questions are good attempt but incorrect questions should be less.
  • Because As of now JEST cut off for IISc CSA is just 45 rank so you may get good rank but if you secured above 45 rank then you may not get interview call.
  • One more thing you will get a interview call for M.Tech Research (RA) not for M.Tech Coursework(TA) in IISc.
  • Even though you qualified this exam in TCS(Theoretical Computer Science) still you can select any other research pool i.e; either TCS or Intelligent system or System software.
  • No need to worry about it just qualify and secured a good rank.

Even there are very less students who appeared in this exam but still do not take it lightly if you are aiming for IISc because you will have to be in at least top 45 to get a call and who knows cut off may be increased also so try to secure good rank.

JEST TCS 2019

  • 32 Marks-- 19 Rank
  • 45 Marks-- 11 Rank

JEST TCS 2020

  • 67 Marks-- 1st Rank
  • 56 Marks-- 8th Rank
  • 53 Marks-- 10th Rank
  • 52 Marks-- 11th Rank
  • 48 Marks-- 19 Rank
  • 46 Marks-- 28 Rank
  • 45 Marks-- 31 Rank
  • 43 Marks-- 36 Rank
  • 39 Marks-- 51 Rank

Now you can observe that how much Rank varies. So try to attempt as many as possible.

  • One more important thing is that Rank is given only on the performance of Part A means just secure good marks in part A and you will get a good rank irrespective of your performance in part B.
  • Level of questions is also good not too easy not too tough.Just believe in yourself and most of students who could not secure good rank in Gate, gets very good rank in JEST.

2) PART B(Subjective)

Part B itself is divided into 2 parts.

  • Part B(i)— 5 questions of 8 Marks each out of which 3 questions is compulsory to attempt.
  • Part B(ii)— 3 questions of 12 Marks each out of which 2 questions are compulsory to attempt.
  • Part B is the most challenging part.Due to subjective you will have to explain everything. Algorithm , Graph theory and TOC is most important topics for this part specially algorithm.
  • You will be asked to write a algorithm for particular questions and in Graph theory I was asked to prove a theorem and one question was to draw a DFA and one question was from Function (Discrete) where I was asked to prove something.

So overall this part is challenging you should have a very good knowledge in the subject.

  • Even though if you could not solve a single questions from part B; still you may get a decent rank if you scored good in part A because Rank is assigned on the basis of performance only in part A but still try to solve Part B because after 75 min your OMR sheet(PART A answer sheet) will be submitted and for remaining time you will have to solve only subjective so first solve objective part that is PART A because you have 75 min for PART A.

Only few college(IMSc) consider score of part B as well but for IISc,they just consider only performance in Part A i.e; Rank.

 

SUBJECTS FOR TCS: 

As I said exam itself is TCS so you need to prepare only TCS subject. As far as I know there were questions from following subjects( DS, DAA, C lang, TOC, Discrete Maths especially Graph Theory and P&C, Probability, LA). This is what I remember and I also asked to some other people and they said the same. Apart from these subjects, no need to focus on those subject for JEST like CN, COA, OS, DBMS, Eng Maths(except LA, Probability).

 

HOW TO PREPARE:

Although for part A, GATE preparation is enough but solve previous year question of GATE, TIFR, CMI and other similar exam. Someone was saying that there were many question from TIFR PYQ. So do not leave TIFR PYQ question.

 

SOME IMPORTANT LINK FOR YOUR PREPARATION:

https://drive.google.com/drive/folders/1zHT8y-yJa_XyiRiTryPFx1fELUAyvFg4?fbclid=IwAR2PDFmGPqi_IScMYGd0Lyoo4iQX2sJ6yiemzEdU7NR6XqFnC5MO9sNHkL4

 

GO PDF OF CMI, ISI, TIFR

https://gateoverflow.in/blog/8987/isi-cmi-pdf-by-gate-overflow?fbclid=IwAR3mAhfar0btwMZXRBqlzZORBXErTqp6eql693hOjfrLWJpJpjbwLLs5ftU

 

JEST 2020 MEMORY BASED QUESTION PAPER:

https://m.facebook.com/groups/gateoverflow/permalink/1277541932451014/?ref=m_notif&notif_t=group_comment

 

Please go through below link. Here Utkarsh Joshi also shared his experience. He secured AIR 11 rank in JEST 2019.

https://m.facebook.com/groups/gateoverflow/permalink/1064794597059083/?ref=m_notif&notif_t=group_comment

 

FEW QUESTION FROM ASPIRANT:

 

Q1: Which program should I select while filling JEST form?

While filling JEST form you have to select " Integrated PhD" option in Computer Science but don't worry you will still get M.Tech research because while applying for IISc you will have option to choose M.Tech research using JEST scorecard.

 

Q2: PYQ is available?

PYQ and syllabus is not available anywhere but I posted link for memory based question. Only memory based question paper is available.

 

I had to struggle a lot just for collecting JEST related information. So I am doing my best so that aspirants will not have to waste their time just for collecting information.If you still have a query, you can comment or ask me directly.

 

MY QUORA ACCOUNT- https://www.quora.com/profile/Navneet-Singh-Tomar-2

 

PS 1: I secured AIR 36 in JEST TCS 2020. This year cut off for IISc was high due to covid-19. This year(2020) cut off was AIR 5 for CDS and AIR 20 for CSA for GEN. This year they filled only 50% seat for MTech(Research) comparison to last year. But from next year it will be lower than this year.  So don't follow this year cut off for your reference. Just prepare for JEST and do best. 

 

Navneet Singh Tomar posted in Others Sep 1, 2020 edited Apr 26, 2021 by Navneet Singh Tomar
9,988 views
14

PGEE 2020 was conducted on 24th June 2020. I took it, my center was Rajkot, Gujarat. As they do not publish previous year papers, I thought some immediate memory-based topics which were most asked in the paper would be useful in coming years.

First paper was Aptitude:

  • Syllogism was asked extensively, prepare it really nice.

 

  • Comprehension based questions were easy, not much in content, but you must be ready to read longer paras than in GATE.

 

  • The questions based on figures(which is figure is different), those were as extensive as syllogism.  I haven't saw much of them in GATE/maybe a few, but in PGEE, it was asked with intent!

 

  • Some questions were like find out wrong word, recognize pattern(total around 5 questions from these topics.)


Overall, I would say level was definitely greater than GATE2020, but a basic knowledge on concepts of Aptitude will surely get you through this.

I don't remember what sort of Engineering Maths was asked.

Let's come to technical part, which is Computer Science and Engineering. I am not as sure in this as I am in Aptitude(Regarding which topics were asked), but I request every other student who took exam to add content to this blog, and make it complete!

  • C programming. It was asked. Really many questions, and good ones, like some good questions of GATE. Pointers were heart of all the C programming questions.

 

  • DSA. It was obvious, and it was asked. Most of them was based on Directed, Undirected, Weighted, MST, algorithms of MST. Make all permutations of topics of DSA I listed, and you will find questions. Be good in this, as they were not straight forward questions. You may find yourself in a good position if you have done these topics from CLRS.

 

  • DLD, COA was little. DLD-Mux simple question. COA-Basics only(I don't remember much about this subject, but GATE level prep should be more then enough)

 

  • Operating system was asked, GATE level I can say. If you know concepts well, easy walk.

 

  • Computer Networks, same as GATE level

 

  • Discrete Maths. It was asked, set, relations, functions were the topics. I would say definition of some basic things like symmetric, antisymmetric, and asymmetric relations etc(many definitions are there in DM) were the key part, previous year GATE questions, if you have done with proper understanding,  then DM should be easy walk too.


Interface was same as GATE. No negative marking in any section. 90 minutes for each section. We could not start 2nd section until we completed 90 minutes of the first, even if we answered all the Aptitude questions. No calculator, not even digital as we get in GATE was there. No questions with more than one options correct were there. Last year also, it was like this. I think are have done with this type of questions.

 

Hope you find it useful, and get admission in IIITH. I request all the students who took PGEE 2020 (CSE) to add their experiences and topics which were asked.

yagneshmb posted in Others Jun 25, 2020 edited Jun 25, 2020 by yagneshmb
2,375 views
15

Hi,

We just had a major server upgrade and so some bugs are expected. Please list down any issue you are facing since today. You can also add any other bug which was already present.

Also, there are some new themes to try out if you are interested.

  1. Muffin Theme which has both Light and Dark Versions
  2. Frapuchino – for Desktop
  3. Aven
Arjun posted in Others May 7, 2020 edited May 9, 2020 by Arjun
by Arjun
2,282 views
16

I am sharing my email coversation with IITGN academic department. 

I have asked a bunch Question, since little to no information is provided by the IITGN on their official website.

 

 

MY MAIL ————>

 

Hello,

 

I am considering to apply for the PGDIIT, but there is little to no information provided about this program on your official website.

 

Here are some major questions regarding the program.

 

1. What is the fees of PGDIIT program ?

 

2. Will IITGN allow the students of PGDIIT program to sit for the placement and provide the same placement opportunity similar to the students of MTech program?

 

3. What will be the syllabus/ course structure of PGDIIT for CSE?

 

4. Will IITGN allow the students of PGDIIT to covert their Diploma to MTech ?

5. Will the PGDIIT program students be allowed the opportunity of Internship? If so then for how many months can PGDIIT student can pursue internship?

 

6. Major differentiating factors between PGDIIT and Mtech?

 

 

NOTE:

please try to add the above relevant information to your website.

 

 

Yours sincerely,

SG

 

————————————————

 

REPLY FROM IITGN ACADEMICS DEPARTMENT 

 

 

Dear Saurabh,

Please find below response to your queries:

 

Q 1. Fees:

For PGDIIT the semester wise fee structure is as follows:

a) Admission fee (one time payment) - Rs. 6500

b) Refundable Security Deposit (one time payment) - Rs. 5,000

c) Semester Fee (inclusive of Tuition fee and other allied charges) - Rs. 47,500

d) Mess and laundry advance - Rs. 19,000

 

Q 2 & 5. IITGN supports PGDIIT students for placement and internship. However, the statistics varies as it depends on the student's performance as well as the placement/internship opportunities available for the year for PGDIIT students.  

 

Q 3. For the admission test there is no specific syllabus. Once admitted a student can register for courses (floated for the semester) in consultation with his Faculty Advisor. 

 

Q 4.  It is usually not permitted.
 
Q 5. M.tech is a two year degree programme whereas PGDIIT is a diploma. 
 
With Regards,
Saswati Roy
Assistant Registrar (Academic)
Indian Institute of Technology Gandhinagar
079-2395-2051/2532

 

 

 

 

 

 

 

 

TheDaniel posted in Others Mar 30, 2020
1,714 views
17

score card available for download

http://gate.iitd.ac.in/

mehul vaidya posted in Others Mar 18, 2020
720 views
18
mehul vaidya posted in Others Mar 18, 2020
989 views
19

BARC 2020 Paper :

Every Year students search BARC previous year paper.Here is this year exam paper. Hope this blog will helpful for future aspirants.not all the questions but most of the questions are covered here.

Slot 1: Date 14/03/2020 

 

1) C programming & Data Structure:

A)  C programming pointer     declaration Expression was given, asking about which one is the correct expression, you can refer the similar  type of question here: 

   https://www.youtube.com/watch?v=LPABbqfElA8)

B) 1D & 2D array declaration was given, asking about which one is correct? A similar kind of question is asked in the gate exam.

    Ref: https://gateoverflow.in/893/gate2003-2

C)   2 Questions came from the Recursion topics, we have to guess the output of program.

 Refer here for Recursion questions: https://gateoverflow.in/tag/recursion)

D)  preorder/ postorder was given, asking about how many numbers of binary tree possible from the given tree.

E)  A BFS tree was given asking which of the following edge are not BFS edge.

F) Linear probing (gate similar question 2010 ) 

   Refer Here: https://gateoverflow.in/1322/gate2009-36

G)  Min heap  (Min Heap property based question)

H)  Max heap insertions after 2 node insertion what is the output??

   (Refer previous year questions based on max heap insertion.:https://gateoverflow.in/tag/heap)

I) 1 question based on parameter passing technique.

 

2) Digital electronic:

 

A) count the  number of 1’s in decimal system(decimal to binary conversion)( previous year patterns, data is changed in the exam)

  Refer here: https://gateoverflow.in/152702/ugcnet-dec2009-ii-10

B)  K-map basic question

     (Practics K-map from here: https://gateoverflow.in/tag/k-map 4 variable k-map is given asking correct expression in sop from)

  1.  (4 variable exor gate is given asking about correct K-map)

D)  ( 4X1 Mux is given asking for an expression of line number 2)

E)    (3DFF was given asking what is counting sequence after 6th clock)

F) question-based on RAM.

 

3) Algorithm:

 

A) Greedy and Dynamic basic question (Property-based theory question)

B) Time complexity calculation based

C) Recurrence relation matching (pyq ditto) Refer here

D) ( Quicksort, merge sort, insertion sort, selection sort)

  A sequence of number was given, after applying some algorithm new input is generated, which algorithm is used for generated input. (MS,QS.IS,SS, sorting based)

 

4) TOC, Cd: 

 

A)   (Finite automata is given asking Regular expression)

B). No of A's div by 3 or 5 

     Asking for # of state in NFA aur DFA .

C) Design the Regular expression using eipsilon NFA

D) Parsing if a grammar is left recursive then which is invalid ( recursive descent, LR, LALR,)

E) Valid palindrome seq asking compiler 

 F) Language Identify question practics from here: https://gateoverflow.in/tag/identify-class-language

 

5)  Engineering Maths:

 

 A) probability 4-5 question (hypergeometric based, conditional probability)

B) linear algebra 2×2 matrix inverse 

 

 

6) DMS:

 

A) Predicated logic gate level question.

B) on set {1,2,3,4} A relation was given asking weather it is equivalence or poset.

C) .(where we use the associative property,group, monoid, semi group, lattice.

D) # of Disconnected graph for even number of vertices n>=4

 

7) CN:

 

A) Basic IP add question asking # of the host.

B) DVR (gate que kitne link unused hoge)

C) cryptography theory

D) digital signature (Anarkali Salim gate question)

E) Web browser & HTTP  (gate question asking correct sequencing order)

F) TCP basic numerical

 

8) DBMS:

 

A) ER table minimization (1:m & m:m) 

B) BCNF decomposition which is the invalid decomposition

C (some theory question on view,SQL )

D) question based on Where clause & having

E) Indexing formula based numerical

F) (Sql query based question.

 

9) CSA:

 

A) Machine instructions (gate que halting , programs counter que 2006 ya 2007 same type of question))

B) direct mapping aur SAM mai property based difference

C) LRU. aur LFU  based mapping question.

 

 

10) OS: 

 

A) (SRTF, asking TAT of the process a)

B) disk scheduling (SCAN) (Ref Here: https://gateoverflow.in/tag-search-page?q=disk-scheduling+)

C) BANKER ALGORITHM ( safe seq deadlock unsafe can't say, pyq type) refer here:https://gateoverflow.in/tag/deadlock-prevention-avoidance-detection?start=30

D)Gate 2020 ditto question (process diagram wala new ready running. Kn sa invalid hai) Refer here:https://gateoverflow.in/333219/gate2020-cs-12

E) binary semaphore(programming question, the final value of S, pyq type)

F) dining philosopher (programming based question, output find)

G) #page fault-based question

H) TLB calculation formula-based

I) theory on trashing & domp 

J) question based on best-fit algorithm & external fragmentation theory-based

 

Out of 100 70 -80 questions are from gate syllabus remaining from c++ (oops concepts, polymorphism.friend functions, constructor)

Question is output finding type.

 

Today BARC question.

 (By Himansh Chaudhary:https://gateoverflow.in/user/myid3740 )

Slot 2: Date:15/03/2020 

1.OS:

A- find EMAT, TLB hit ratio is given (similar in pyq)

B- Page fault question- comparison in LRU nd FIFO Refer here:(https://gateoverflow.in/tag-search-page?q=page-fault+)

C- Max possible size of the file, block size given, Direct (present in PYQ inode type) easy question

D- Semaphore question- given S= 3, 7P and 10V, find the value of S

E- Safety algorithm question with single resources type

F- Theory question on Deadlock

G- SRTF question (disk scheduling) and 1 more question from same topic. Ref: https://gateoverflow.in/tag-search-page?q=page-fault+

H- 2 questions on disk management. Ref:https://gateoverflow.in/tag-search-page?q=disks+

 

2. CSA:

A- Cache hit on set associative mapping

B- Pipeline question (4 stages, 1000 inst, different time given for each stage and 5 sec register time)

C- Calculate execution time (PYQ type) - some instruction is given, time for each type inst. is given

D- some instruction is given, we have to find main memory location Which save in stack during interrupt .(similar in PYQ)

 

3.Prog& DS:

A- 2 question from the concept of static variable and return function.

B- 3 question, find output (PYQ) Refer:https://gateoverflow.in/questions/programming-in-c?sort=gate

C- C program Which has switch case and Folk() , how many time prints

D- Pointers and array type question( PYQ ) Refer:https://gateoverflow.in/questions/programming-in-c?sort=gate

E- Find the number of BST, built from 3 keys (PYQ)

F- Find inorder from pre and post order(PYQ)

G- Expression(X= (a+b)*(c-d)) is given , we have to select incorrect option which is neither preorder, inorder and postorder

 

4. ALGORITHM:

A- which algorithm doesn't follow DP(https://gateoverflow.in/tag-search-page?q=dynamic-programming+)- prims, Dijkstra, Floyd, bellman

B- Match the best, avg, the best time complexity of the different sorting algorithm.

C- find time complexity, code in which heapify & build heap fun.

D- analysis of time complexity, omega and big O cases

 

5.Maths:

A- Laplace question

B- Matrix(Linear algebra) question

C- 2 question of probability. (PYQ type) 

 

6.DMS:

A- Negation of a quantifier equation

B- negation of C statement -- ( a!=n && z+2<=4)

 

7.OOPs:

A.Java- We have to find the output of code

B. C++- 2 questions on the concept of auto constructor and deconstructor

C. Abstract classes kyu use krte h

D- inheritance related question

E- 2 aur the(2 more questions)

 

8.Computer graphics :

A- scalar Matrix of 3D transformation

B- 2 aur qus , attempt hi na kiye :p 

 

9.ML(Machine Learning):

A- find an example of clustering 

B- 2-3 others question( I even didn't read the question carefully 🤣)

 

2 question from physics

 

10.DBMS:

A- Find Nf from the table (https://gateoverflow.in/tag-search-page?q=database-normalization+)

B- SQL question - from following which one executes first- where, order by, having 

C- other 2 SQL questions (simple)

 

11.CN:

A- DVR question, find the distance at node

B- DVR, LSP theory question (PYQ type- in which count to infinity problem present something type)

C- routing table is given, match the network address(PYQ type)

D- calculate no. of subnet from the subnet mask

E- Why CSMA/CD is not used in the wireless network

 

12. TOC: 

A- 2 questions of REG expression

B- 2questions- Find language from automata

C - which is not CFLhttps://gateoverflow.in/tag/identify-class-language )

D- Mealy, Moore question

E- Regex question ( same as PYQ) 3 exp given we have to find which is a subset of which one 

 

13- DELD:

A- minimize the POS, Output given in form of SOP

B- the circuit of 3 DFF, SIPO, We have to find output after 4 cycle

C- *(function as X-or) operator diya hua tha , usse operation btane the

D- 2 more question

The overall exam was easy to moderate.According to him.

Something like 1 mark GATE question.

Goodluck for future BARC aspirant.

BARC 2019: https://www.quora.com/How-was-your-BARC-Computer-Science-Exam-2019

please shear your BARC exam experience so that it will helpful for the future aspirant.

 

 

 

 

 

Hira Thakur posted in Others Mar 16, 2020 edited Nov 18, 2020 by Hira Thakur
2,104 views
20
Hi,

I am a 2019 Btech - CSE graduate with a CGPA of 7.49. My 2019 Gate score is 655. I heard that course is new, and not much information is provided in their site.

Do I have a chance with my current score ? Will there be an interview ?

Thank You
parabol posted in Others Mar 15, 2020
by parabol
1,015 views