Most viewed posts in Others

1

PLEASE PROVIDE  OVERVIEW,ANALYSE AND EXPERIENCE OF ISRO WRITTEN EXAM …….LEVEL OF EXAM ,GOOD NUMBER OF ATTEMPTS?

OFFICIAL ANSWER KEYS :- https://www.isro.gov.in/career?field_isro_centre_value=icrb 

RESULT:- https://www.isro.gov.in/sites/default/files/be003-computer_science.pdf

View Obtained Marks: https://apps.isac.gov.in/CentralBE-2019/ShowStatus.jsp?postno=03/2019_BE003&postname=Scientist/Engineer-SC(Computer%20Science)

eyeamgj posted in Others Jan 13, 2020 edited May 12, 2020 by anonymous
by eyeamgj
70,438 views
2

GATE 2019 Schedule

 

May 15-21

 

Verbal Ability: Finding appropriate word, reading passages, basic grammar usage

Logical Reasoning and Data Interpretation: Verbal reasoning ­ deriving conclusion from passage, conclusions as in puzzles (can be in mathematical logic also), deriving conclusion from graphs, pie/bar charts, sequence and series etc.

 

Webpage for Verbal Ability



 

May 22-28

 

Quantitative Aptitude: Ratios, speed­time, directions, work­code, clock, other numericals

 

Webpage for Numerical Ability


 

May 29 -June 4

 

Discrete Mathematics: Mathematical Logic: Propositional Logic; First Order Logic.

 

Webpage for Mathematical Logic

 

June 5-11

 

Discrete Mathematics: Set Theory & Algebra: Sets; Relations; Functions; Groups; Partial Orders; Lattice.

 

Webpage for Set Theory & Algebra

 

June 12-18

 

Programming and Data Structures: Programming in C. Recursion. Arrays, stacks, queues, linked lists, trees, binary search trees, binary heaps, graphs.

 

Webpage for Programming

Webpage for Data Structures

 

June 19-25

 

Discrete Mathematics: Combinations; Counting; generating functions; recurrence relations.

 

Webpage for Combinatory

 

June 26-30

 

Probability: Random variables. Uniform, normal, exponential, poisson and binomial distributions. Mean, median, mode and standard deviation. Conditional probability and Bayes theorem.

 

Webpage for Probability


 

--------------------------------------BREAK-------------------------------------

July 3-9

 

Discrete Mathematics: Graph Theory: Connectivity; Matching, Colouring.

Webpage for Graph Theory

 

July 10-16


 

Theory of Computation: Regular expressions and finite automata. Context-free grammars and push-down automata. Regular and context-free languages, pumping lemma. Turing machines and undecidability.

 

Webpage for Theory of Computation


 

July 17-23

 

Algorithms: Searching, sorting, hashing. Asymptotic worst case time and space complexity. Algorithm design techniques: greedy, dynamic programming and divide‐and‐conquer.

 

Webpage for Algorithms

 

July 24-30

 

Algorithms: Graph search, minimum spanning trees, shortest paths.

 

Webpage for Algorithms


 

August 1-6

Digital Logic: Boolean algebra. Combinational and sequential circuits. Minimization. Number representations and computer arithmetic (fixed and floating point).

 

Webpage for Digital Logic

 

August 7-13

 

Databases: ER‐model. Relational model: relational algebra, tuple calculus, SQL. Integrity constraints, normal forms. File organization, indexing (e.g., B and B+ trees). Transactions and concurrency control.

 

Webpage for Databases

 

August 14-20

 

Calculus: Limits, continuity and differentiability. Maxima and minima. Mean value theorem. Integration.

 

Webpage for Calculus


 

August 21-27

 

Compiler Design: Lexical analysis, parsing, syntax-directed translation. Runtime environments. Intermediate code generation.

 

Webpage for Compiler Design   


 

August 28-31

 

Break for revision



 

September 1-10

 

Computer Organization and Architecture: Machine instructions and addressing modes, ALU, data‐path and control unit, Instruction pipelining, Memory hierarchy: Cache and main memory, Secondary storage, I/O interface (Interrupt and DMA mode).

 

Webpage for CO & Architecture



 

September 11-17

 

Operating System: Processes, Threads, Inter-process communication, Concurrency, Synchronization, Deadlock, CPU scheduling,

 

Webpage for Operating System

 

September 18-24

 

Operating System: Memory management and virtual memory, File systems.

 

Webpage for Operating System


 

October 1-8

 

Computer Networks: Concept of layering. LAN technologies (Ethernet). Flow and error control techniques, switching. IPv4/IPv6, routers and routing algorithms (distance vector, link state). TCP/UDP and sockets, congestion control. Application layer protocols (DNS, SMTP, POP, FTP, HTTP).

 

Webpage for Computer Networks

 

October 9-15

Computer Networks: Basics of Wi-Fi. Network security: authentication, basics of public key and private key cryptography, digital signatures and certificates, firewalls.

 

Webpage for Computer Networks


 

October 16-24

 

Linear Algebra: Matrices, determinants, systems of linear equations, Eigen values and Eigen vectors, LU decomposition.

 

Webpage for Linear Algebra


 

November for revision,solving tests

Pooja Palod posted in Others May 12, 2017
23,396 views
3
How was it ? :)

I think aptitude was easy, lengthy paper but medium.

If you remember any answers and sure about it.. Please post :p
gauravkc posted in Others Feb 4, 2018
21,457 views
4

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
19,941 views
5

Both RA and TA are one of the categories to pursue your M.Tech.

 

TA - Teaching Assistantship

Institutions offering TA: IISC, IITB, IITD, IITK, IITKGP, IITM, IITG, IITH, IITR
Mode of admission:
IISC, IITB, IITKGP, IITM, IITH, IITG, IITR – Purely on GATE Score
IITD, IITK – Based on GATE SCORE + Interview (70:30)
IITH – Only Interview (If seats are vacant)

Course duration: If you are pursuing your M.tech in this category, it will take 2 years to complete.
Monthly stipend: ₹12400 fixed for the whole period of your M.Tech.

TA Work: You will be assisting faculty of that particular subject in attendance and correction of answer sheets and some more works related to that course only for a semester. The number of hours in a week can vary depending on the prof you are working with.

Course pressure:  1st year will be full course work and 2nd year will be for projects with 0–3 courses (depending on the institution) to complete. As far as the first semester is concerned, it is certainly not tough, it is hectic. 3-4 courses you have to take in a semester. You will have a midnight time limit for assignment submission. If you will survive for 2-months then this will be a new normal for you. If you do not try for it then you can not fail in the subject.

 

RA - Research Assistantship/ M.Tech Research

 

Mode of admission: Only through Interview and Interview.
Shortlisting criteria: GATE Score + BTech CGPA. After shortlisting everyone will be on the same platform. So do well in the interview you will be in.

Institutions offering Research Program: IISC, IITB, IITK, IITM, IITH
Course duration: RA category M.tech takes 2.5-3 years to complete.

Monthly stipend: will be different (depending on the institution) for all three years.

1st year - ₹14000
2nd year - ₹15000
3rd year - ₹ 16000

NOTE: Some IITs offers High-value Assistantship where the stipend is 25k. So it depends on the Project you will be working with.

RA work: RA category (depending on the institution) is of two types:

  • Institute RA

Your RA duty will be in a lab assigned to you for mostly the whole of your M.Tech. You will be responsible for daily conduct of the same lab and all other works related to that lab. In short, you will be working as a lab assistant in a particular lab for the whole of your M.tech. It doesn’t mean that you will have too much of the workload. You will also be learning everything related to that particular lab.

  • Project RA

In project RA you will be assigned a project (for which you have been given admission after the interview process), and you will have to work on that project only as your M.Tech project.

Course Pressure: In the RA category you have to take less number of courses than TA ones. The number of credits to be completed is almost the same as of TA category. You can distribute your course workload in ample time given (3 years instead of 2). By the time they reach the final year most RAs are done with their courses. So in the final year, they are very free (compared to TAs) and can prepare for placements better.

 

 

Placements: Are you still looking for this? NO difference in the RA and TA category.

Apart from the above, there is no difference between TA and RA. Even RAs have one advantage of getting exposed to the project more as they will be dedicating more time for the project. RAs students have sufficient time to publish a research paper and that will add weight in the resume.

For more detail visit here. Written by 2016 joinee, this blog gives some misleading features of IITH that is not currently true but still...

Digvijay Pandey posted in Others Feb 9, 2019
19,716 views
6

Masters is not very different from Bachelors but in India most students do Masters from IITs and there is a big gap to be filled from lower level college environment. Though GATE preparation is mostly enough a few extra stuffs might come handy during IIT life. 

  1. Get used to unix commands: I first started using linux only in second year of Masters and though I have used it ever since I still think 2 years early start would have helped me a lot. Somethings to try- 
    Install linux (ubuntu or mint or any other) either as dual boot (preferred) or as VM. If you have a credit card you can even get Amazon AWS free for 1 year (it is good). 
    Try running a process in background.
    Try ssh to/from another machine and run a process in background (cronjob, nohup etc. might be needed here). 
  2. B.Tech. level C/C++ skills is enough. But depending on how you did B.Tech. you might need to hone it. Try implementing graph traversals, AVL tree etc. in C and even try using STL in C++ for doing so. 
  3. Java might not be required for B.Tech, but if needed no one is going to send you for a Java coaching. It is actually a subset of C++ (Java is made to make C++ easier), and anyone coding in C++ must be able to use Java. Try some String algorithms in Java. Another use of Java is for programming interviews- it is much simpler (and faster) to use Java to write a code than with C/C++ and even in Google programming interview Java is preferred.
  4. $\LaTeX$ is a publishing tool which all CS students should have used. In IITs, it might be used for assignments, report submissions etc. So, try making your resume in Latex, convert your B.Tech. report to latex one etc. If you have used Mathjax on website (as in gateoverflow), it would be pretty simple. 
  5. Plotting is a needed research tool. There are many shortcoming with using Excel and trying to use gnuplot might come handy during Masters. 
  6. Data analysis is another demanding task- and trying some basic R commands- like finding mean, SD etc. is recommended. Trying Python might also be handy. 
  7. awk - is fun to use. Use it especially if you want to process a text file line by line. 
  8. Whatever you do an editor is important. Knowing commands of a smart editor like vim, emacs etc. can make your work more fun and easier. Using IDEs like Geany, Eclipse etc. are also highly useful as they will reduce many jobs in future.
  9. Being familiar with area specific tools- like installing LLVM if you are interested in Compilers, R language if you are interested in data analytic, making shared libraries if interested on system side, mastering regular expressions if working on text processing and similarly for other areas.
  10. If you are interested in system side, be familiar with gdb
  11. Any project would require versioning and being familiar with git is an added advantage. 
  12. For placements, aptitude- some companies ask CAT level questions - is required. Also, for big software companies, dynamic programming is important. Do practice some questions like sudoku solving using backtracking also. These questions can also help. 
  13. In most places, you will have time for deciding the area of work. Still, if you can find a suitable prof to work under early, it is a good thing. Otherwise also, you can do this in first year. 
Arjun posted in Others Feb 29, 2016 edited Mar 3, 2016 by Arjun
by Arjun
16,393 views
7

pragy agarwal link is working now for gate 2019. you can check your score here https://gateoverflow.in/mymarks/index.php#

Sankalp20894 posted in Others Feb 7, 2019
16,075 views
8

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 LinkedIn account:  www.linkedin.com/in/navneettomar

 

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, you may be are getting under 50 then you may be shortlisted for interview. Just prepare for JEST and do best. 

 

Navneet Singh Tomar posted in Others Aug 31, 2020 edited Nov 20, 2023 by Navneet Singh Tomar
14,256 views
9

Hey!!!

As per many requests, I am finally updating a post on IIT, Gandhinagar. I am Priyanka Gautam, a student at IITGN, M.TECH, CSE-2017

IIT Gandhinagar is a great college with a beautiful and well-organized campus. All the facilities available here is nice including the faculties, staff, Academics requirements, research opportunities and overall. As far as CSE branch is concerned it started last year, but the faculties and courses structure and all facilities provided here is up to the level. So, there is not much difference.

LAST-YEAR SCORE:- GEN - 600  and SC/ST - 400  OBC( not remember exactly)  but approx. around 500

Placement:- Overall placement is good, m.tech electrical avg. pkg is 13 Lakh around so we can hope best for CSE. Even here the most of b.tech guys placed good or many get admitted to the foreign university.

( In my opinion, placement does not matter much as long as you are getting good learning environment, so in the field of Computer science there is plenty of jobs as long as you are updated with industry and technology, you anyway get in)

ADMISSIONS:-

Admission is started you can apply online those who are in confusion, first you must apply after getting the college, you must decide which to take or which do not, as thinking to much waste lot of time and make you tense so be chill and apply if possible.

Admission Procedure:-

Written test followed by a coding test and Interview.

Last year, there was 20 question in written test with 1/4 negative marking on the wrong attempt. 5 question in coding with 2 internal choices you have to attempt 3. The interview is fine just brush up your basics of Gate ( focusing on ALGO, CO, OS, Data structures, TOC,).

All the best!!!!  All

Feel free to ask question !!!....

 




 

Interview Experience by Digvijay Pandey.

$Procedure:$

a. Programming Test
b. Written Test
c. Interview

a. $Programming\ Test:$
Attempt three out of five questions: 
1. Return Array sum
2. Find the number of combination such that sum of row = sum of column (i don't remember question exactly but it was something like this)
3. Some tree related question (write just function)
4. ......

b. $Written\ Test:$
$20$ questions were there. All are objective type. Numerical related to page size, cache lines, regular languages, serial schedule, probability.

Algo question: An array is row-wise as well as column-wise sorted. You have to find an element. How much time will it take? (Options were there)

Did $2$ programs (All test cases cleared) and in the written test I got $20/20$ (They didn't disclose written marks but at the time of interview they asked me to solve written exam question. Because there was an ambiguous question (graph related) and I ticked it correctly and got the mark. Luck :P)

$1^{st}$ shortlisting based on Programming + Written test.

After this you have to fill area:
1. Theoretical Computer Science
2. Systems
3. Intelligent System
I marked $Theoretical\ Computer\ Science.$

 
c. $Interview:$

Question-related to the written test. Just single question.
A binary tree with $n$ node and height $h$ along with two arbitrary nodes are given. Find the maximum distance between these two nodes. $(2∗h)$
What is BFS?
Any other thing BFS do except traversal? (i.e. application of BFS. I said Finding shortest path if given graph is unweighted)
How? (Explained on board)
An array is given. Find the number of pairs with sum $=k$. Complexity?
If given array is already sorted. Then?
Difference between Merge and insertion sort?

 

People did $1$ programming question also selected for the interview. So try to score as much as possible in the written test.
Programming platform HackerRank.
Good Luck :)

 




 

If your $GATE\ Score > 720$ check these (1), (2), (3), (4), (5), (6)
If your $GATE\ Score > 650$ check  (1)
If your $GATE\ Score > 600\ and\ BTech\%> 80$ check these (1),(2), (3).

priyanka gautam-piya posted in Others Mar 22, 2018 edited Mar 24, 2018 by anonymous
12,659 views
10
I found tricky but questions were nice.

I want to confirm whether the dance drama maths people got correct answer or not? I got around 452 and was pretty confident about it and it was not in options.
gauravkc posted in Others Feb 3, 2019
12,046 views
11

Official Key: 

PDF for Questions and Answers (Code A)

Wrong Keys (Code A)

12

35

34

40

38

59

Ambiguous

77

 

CANDIDATES MAY RAISE OBJECTIONS TO THE ANSWER KEYS, IF ANY, WITH VALID JUSTIFICATIONS, WITHIN 5(FIVE) WORKING DAYS, I.E. WITHIN 14.07.2016, BY 06.00 PM. THE OBJECTIONS MAY BE SENT TO [email protected] WITH THE SUBJECT *OBJECTIONS - SCIENTIST/ENGINEER 'SC'-2016*. ANNEXURES/ENCLOSURES MAY BE IN PDF FORMAT ONLY. CANDIDATES SHOULD MENTION THE BRANCH(ELECTRONICS/MECHANICAL/COMP.SCIENCE), AND BOOKLET CODE FOR WHICH OBJECTIONS ARE RAISED.OBJECTIONS RECEIVED WITHOUT VALID JUSTIFICATIONS AND OBJECTIONS RECEIVED AFTER 14.07.2016 WILL NOT BE CONSIDERED.

Analysis and Subject-wise weightage:

Arjun posted in Others Jul 6, 2016
by Arjun
9,331 views
12

I should not have done this but because someone is making such nonsense arguments I have to convey these.

Contributing to Open Source

As everyone knows GO is using Question2Answer software which is made for free and without any restriction by a great man Gideon. So, what GO has done in return can be seen here as plugins.

Ad revenue sharing

I just checked my Adsense account and I have got about 1600\$ so far over 2 years. Also about 10\$ per month from Amazon Ads. And this includes both gateoverflow.in and gatecse.in. And you can do the math for the expense about 30\$ per month for a server and we have 2. And for typing in previous year questions at GO I have to pay about 15\$ per 60 questions. Now anyone here can do the math and demand any share he/she deserves

Free education and charity

GO is free and unlike many free stuffs it is not made just for being free. It is made believing in quality. That is why we never provide short cuts or brainwashing students to follow bad ways just for our own benefit. What we do can clearly be seen here- I don't think it is charity and never claimed so also. But it surely does save students from sharks who even forces students who write genuine review about them to change it giving fake promises. I could have made GO ad-free but when we started GO, I was still doing my Ph.D. and even now I'm doing my Postdoc. These money are nothing for someone working in CS as you all know. This guy stooped too low by claiming the ad money is going to people paying US tax.

Idea of Q/A forum

GO idea was suggested by my friend Omesh Pandita. At that time we were answering questions on FB group and as time passes by they were getting lost. So, this was a good way to save them. As far as novelty of idea is concerned, we have started discussion forum way back in 2008 during B.Tech. and even for GATE many such things existed. Why GO is like this now is because of the execution.

Destroying GO

I was happy to close down GO and make the GO pdf available. In fact when the site had issues last year I almost did this. Then many aspirants messaged me saying they are missing GO and with the help of Pragy we restored the site. We only want to provide quality stuff freely to GATE aspirants. But since then GO has evolved a lot and is much more than just a Q/A forum as any genuine user here can see.

Copying contents

We admins add previous year questions here from GATE and other standard exams. Even when aspirants asked me to add "coaching institute" questions etc., I never did so -- not just because of copyright issue but also because of the quality issue. Still, people after giving test series add such questions here and hence I had to add a "Bad" button if ever a question is conveying wrong concept. Still, if anyone finds his/her questions here without permission they can ask for removal and those will be promptly and happily removed from the site as mentioned here.

 

When we were promoting genuine and world class videos for GATE CSE made by people like Shai Simonson, this guy started propaganda that they are not good for GATE and they should watch ONLY his videos. I have numerous aspirants who messaged me that they got tricked to buy his videos and now realize the stupidity. GATE stands for quality and one should learn from the best. If one goes for local stuffs, he/she can get local results. Those 27 toppers he claim - just ask how many of them paid for his course.

 

And if you want to know why this guy is doing this, can see this.

https://youtu.be/ipqe86x_6_o

 

Arjun posted in Others May 6, 2017 closed May 8, 2017 by Arjun
by Arjun
9,295 views
13
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
9,083 views
14
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.
Warlock lord posted in Others Feb 4, 2018
8,946 views
15

GATE 2017 Response is available now.

You can check this by login to your gate Account

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

Madhav posted in Others Feb 14, 2017
by Madhav
7,751 views
16

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

shashankrustagi posted in Others Nov 2, 2020 edited Dec 8, 2020 by shashankrustagi
7,523 views
18
this year set 1 paper was designed like Gate IT previous paper with some illogical and lengthy question.

acc to rule you can not give more than 1 min ques in 1 mark and more than 2 min ques in 2 mark.

and in this paper even in database and programming questions are so lengthy first write on that small book and solve it takes so much time .

even set designer is so much irresponsible that he did not know about the syllabus of gate

when they can organize mechanical branch paper in 2 session means about 1.2 lac people at a time

then why not for all cse people they can't organize the paper in 1 session only (total of 1 lac people)

this time iit professor are so irresponsible that even they can not understand the difficulty level of these 2 paper

what is the mentality behind this to give set 2 paper that much easy

this time iit roorkee is so much irresponsible in designing of paper

we have to raise our voice to arrange paper in 1 session only
gcetcs091 posted in Others Feb 13, 2017
6,222 views
19

Hello friends !! Good morning !!

Today I am going to share my experiences about the types of mistakes which I committed and their possible solutions in context of GATE 2016 and GATE 2017 wherever I can cite examples which I attempted and secured 332 rank and 613 rank respectively [ a very rare occurence I think..:) bcoz I have seen numerous examples whose rank in prev attempt is around 2000 and then around 100 or even better in next attempt ]  due to some  mistakes..I had many hopes of excelling this year but unfortunately the D-day did not work for me..So let me tell about the potential mistakes that may be committed during exam..

Mistake type 1 :

The first mistake that I am referring is related to psychological state of a student during examination..Let we have a scenario in which a student consistently does well in tests that he/she gave in the different test series..Now it is possible that expectation factor comes into picture for a student in the exam that he/she need to attempt around 60 questions at any cost..This should not happen as it will create unnecessary pressure and may be responsible for commitment of many mistakes as the paper may be difficult and hence the questions need to be attempted accordingly as is the case of set 1 paper this time..One has to overcome the panic that may be possible in the initial minutes of attempting the paper ..In short one should have expectation but not during paper solving,,The questions should be solved on the basis of difficulty..Identification of difficulty level of a question is important..

Mistake type 2:

Misreading the question : Sometimes due to lack of concentration , what we do we misinterpret the question.The gate paper setters are very intelligent and they intentionally give such options such that the option corrresponding to misinterpretation will be there.As a result what happens we get wrong there.I used to do a lot of mistakes like that.

As an example , in a question it may say that "identify a false statement" .We do not read the entire question and understand that we have to pick the correct one thus leading to wrong result.

Mistake type 3 :

Having the default mindset regarding a question : Sometimes what happens that we have a default mindset regarding a concept or a fact being used in the question.This default or trivial  mindset often leads to error.As an example , in DBMS in normalisation , we may be asked weakest normal form of a table given the FDs of a relation.What is generally in our mind is that we have to choose the strongest i.e. the most appropriate and highest normal form which the FD set satisfies.But in question we are asked about the weakest so people may commit mistakes here.In fact this question came this year in gate,the link being:

http://gateoverflow.in/39646/gate-2016-1-23

Similarly we know about Dining Philosopher's Problem solution which is deadlock free and satisfies the criteria for proper synchronisation construct.But in exam just for name's sake it may be used but code used may suffer from problem .So we have to examine the code properly.

 

Mistake type 4:

Like question solved earlier : 

When we have similar or exact question which have solved earlier somewhere , beware of this.U have to think it as a new question and solve it properly.Some people gets overjoyed and hence commit mistakes.I did the same type of mistake on finding no of topological sort this year,

In all of the above scenarios , we should do the following :

a) We should read the whole question properly at least once , then ask to oneself what facts are given.Jot them in a piece of paper especially for numerical type questions.Else what happens is repeatedly we have to switch between paper and screen and hence time is also wasted and also one is not able to concentrate on the question.So all the important data should be mentioned like to calculate  throughput in CN we have to note down distance between stations , data size etc.

b) Then we should solve the question systematically following procedure in a proper way

c) Following answering we should verify and recheck it at least once is it the thing that is asked for.

d) Option elimination also plays an important role in some cases.Make the best use of that as it saves time.

 

Now coming to the ambiguous issue :

First of all there are 2 types of questions :

a) Conceptual and theoretical :

For this clear hold on subject is required so that u can decide whether the question is ambiguous or not within a short span of time.

b) Numerical :

Here actually there is hardly anything we can do.We have to solve after all.If after solving we find that no option is matching or more than 2 options are correct.Then we cannot do anything.Actually it rarely happens in gate , but if at all it happens , then normally marks are given to all for that.So no need to worry about that.

Sometimes from the question solving point of view setting counter example also helps.For example in problems where are we are given some statements about MST or Graph Traversals etc.There if we are able to set counter examples , it is very helpful.

 

Hope the points mentioned by me will prove to be helpful for the GATE 2018 aspirants.Thank you..

Habibkhan posted in Others Aug 23, 2017 retagged Sep 9, 2017 by Habibkhan
6,161 views