1st Round Interview:

T: Introduce yourself

Me :Gave small introduction

T:subjects in which you are comfortable to answer

Me: Data structure and Algorithm

T:How to find maximum element in a Binary Search tree

Me:first i told general approach(similar to find max in array) then they sent me to board then i explained efficient way (logn complexity)

T:can u write pseudo code for what you explained

Me:I wrote

T:There is an integer which is greater than every integer. Is this statement true or false?

Me:false

T:why??

Me : explained

T:write first order logic of what you explained.

Me:$\forall x,\exists y,y>x$

T:negate the above statement

Me:done

T:what is this statement mean

Me:explained

T:why deadlock will occur here(questions from the written test)

Me:explained

They told me to wait because there may be another round of interview

After 3-4 hours ,they called me again for another round of interview

Interview Round 2(for formal method project):

T:what are the sorting algorithm you know

Me:told all 7 to 8 algorithm name which i knew

T:which algorithm you think is better

Me :answered

T:why you are saying this and why not this and few more question

Me:i replied all

T:Let G(V,E) be a graph. Let w(ei) is weight of edge i. w(e1)<w(e2)<w(e3).........<w(emax). Let T is MST of G.

i) w(e1) ∈ T, ii)w(e2) ∈T , iii)w(e3)∈ T ,iv)w(emax) ∈ T

Me:Explained for first two case(easy one)

T:What about iii ?

Me:In somecases w(e3)∉T

T:why??

Me:Explained

T:what about iv ?

Me :In somecase w(emax) ∈ T

T:why?

Ans:Explained

T:what is the time complexity to find 3rd max element in max heap?

Me:I went to board and explain clearly (O(1) time complexity).they were looking satisfied by answer.

T:Sorted array is given .You have to find two number from array which is equal to C(given number)

Me:first i explained algorithm which takes $n^{2}$ time

T:Even if array is not sorted we can do in $n^{2}$ time .can we do in better way because we have sorted array

Me:I gave nlogn algorithm.

T:what you told is correct but can you optimise it more

Me :tried but not getting

T:they gave hint like $a_{1}+a_{n}>c(given number)$$a_{1}(first number of array)+a_{n}(last number of array)>c(given number)$

Me:after thinking little bit i got O(n) algorithm.they satisfied by answer

T:Draw an automata for language having as many occurence of 10 as 01?

Me:I started drawing but in the mid they stopped me

T: 3 red ball(identical) and 5 green ball(identical) .no of ways we can arrange such that no two red ball are adjacent

Me:Answered

They told i am done. I was happy because i answered almost every question and feeling satisfied.

After 15-20 mins

3rd Interview(for parallel processing project):

T:why mutual exclusion will occur here(question is from written test)

Me :Explained in detail on board

T:Another question from written test regarding synchronization

Me:not able to answer but made me to think then they gave hint and at last they explain me the answer

After coming out of interview room i was very happy .

I hope this post may help at least someone who are preparing for gate 2018

My gate rank is 527 and score is 728

Thank you :)