Written test was held at CSE department of IIT Kanpur on 7th may. I reached there on 5th May night and got accommodation in hall V. IITK is amazing, very big campus, well planned and well developed. You can find good quality food in mess at IITK.
I reached at venue for test on 7th at 8 am. Exam was started at 8:45 am. There were 50 questions in written test and time duration was two-and-half hour. Questions were based on general aptitude, probability, discrete mathematics, digital and CO, more from DBMS, C language, TOC and Compiler. I found questions were a bit tricky and some easy one too. Later at 2:30 pm, they announced result. Approx. 60 students were shortlisted from GC. Interview was started quickly after that. but my turn was on next day.
Later on my interview day, I reached there after lunch and met some students who are doing m tech there. They told me they are much interested to ask from algorithms and discrete mathematics.
Finally my turn came.....(It was my first interview in my entire life so I was little bit nervous )
I entered into the interview room with my file along with all original documents.They offered me to sit.They had my college results' photocopy and my written test paper. There were 3 interviewer in-front of me.
from them one(Dr. Sanjeev Saxeana) asked me first question...
Q1. You are 2011 passed out, where did you spend one year ?
A. I didn't want to tell about my coaching but I prefer honesty. I replied "I spent last year Hyderabad for coaching at ace academy".
Q2. Tell me which is your favourite subjects.
A. dbms, data structure and algorithms, discrete mathematics.
Q3. Can tou tell me what is equivalence relation?
I replied correctly.
Q4. Can you give an example that relation which is not reflexive but symmetric and transitive?
I used black board to write answer. he said okay.
Q5. The given graph with N vertices and M edges, how many min and max edges can be there in spanning tree?
I felt that question was asked because they wanted to confuse me between min and max number of vertices but I quickly replied "only n-1". He replied NO and was showing me his face like he was unhappy with my answer. but I told it's correct.
He asked me to prove it. I smiled and replied, I can't. he told me to try it, I made my algorithm randomly but I couldn't fulfill their expectations with my answer.
Q6. Can you define relationship between geometric mean and arithmetic mean? first tell me what is geometric mean and arithmetic mean.
I replied him correctly he agreed with my answer that I know what it is. I defined relationship between arithmetic and geometric mean but I could not explain(prove) it. I told him clearly that I am not good in writing proofs. he replied I will ask you proof only.
Q7. Is it correct, odd numbers square are also odd numbers ?
I said YES again. I needed to prove it also. I took 5 as odd number and gave him explanation like 52 means 5*5 means 5 times addition of 5 so odd times addition of 5 means odd. he smiled and asked me about one more proof. (this is not correct way to prove such thing, i should have used some variables.)
Q8. Can you prove addition of two odd numbers give you even number ?
I tried but I failed to prove. (It was an easy question but I had already lost my confidence due to the way he was delivering questions ).
Q9. Can you tell me any algorithm to find spanning tree from graph ?
I replied DFS and BFS. He said NO. I surprised because (it was obvious) you can find spanning tree with this algo. so I cleared question with him if you ask me minimum spanning tree then prims and kruskals. otherwise I am correct. but he was giving me expression like I was wrong and told me to write algo for DFS which it trivial.
after that they offered me to pick another subject. I replied him DBMS.
Q10. What is 2PL protocol?
I told him everything about 2PL and its phases and types.
Q11. Can you get conflict serializable schedule with basic 2PL protocol ?
I said yes. Then why should you study other protocol like multi-version 2PL protocol ?
I replied to improve concurrency. They asked to show one schedule which obeying 2PL and having deadlock. I wrote an example but it was producing starvation not dead lock.
Q12. Do you know what is deadlock and startvation?
I replied yes. dead lock means the state from that you can never come back. but starvation is different thing. In starvation there is chance to come back from long waiting time. but my answer was not fully correct.
My interview was near about 35 min and I was very much tense and unhappy with myself because I told him about coaching. but later, result came (on 10th may) and I GOT SELECTED AT IITK. :) :)
