The Gateway to Computer Science Excellence
First time here? Checkout the FAQ!
x
352 views

GATE YEAR: 2019

GATE SCORE: 677

GATE RANK: 1046

CATEGORY: GENERAL

Written test:

Questions asked in the written test were of GATE level. The test covered almost all the GATE CS subjects, including signals and systems and aptitude. There were 2-4 questions from each subject. Really enjoyed the questions.

Interview:

Professors asked me to choose the subject. I chose data structures and algorithm. They asked the following questions.

  1.  Do you know connected components? 
  2. How will you find the connected components of a graph? What will be the time complexity?
  3. Given two graphs A and B on the same set of vertices but with different edges. How will you find the largest connected component common to graphs A and B?
  4. I want to find the shortest path between vertices ‘v’ and ‘u’ of an undirected graph. I use the single source shortest path algorithm. It may give me the wrong answer. I am okay with the error. We have all pairs shortest path algorithm which will give me the correct answer. As I am okay with error, I prefer the single source shortest path algorithm. Give me a case where this error will be very large, so I must use the all pairs shortest path algorithm.
  5. What was your project? How many of you completed it?
  6. Write C code to find the number of leaves in a binary tree?

The interview was a good experience. I got selected for MS. But I did not accept the offer because I got selected for Ph.D. at IIT Bombay.

 

posted Jun 4 in Interview Experience by (21 points) | 352 views
4
Like
0
Love
0
Haha
0
Wow
0
Angry
0
Sad

1 Comment

what is answer to question no 3?
Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true
49,830 questions
54,807 answers
189,530 comments
80,840 users