Highest voted questions in Interview Questions

2 votes
3 answers
3
#IISc2012Research 1>Recurrence relation and worst case time complexity of Merge sort 2 Difference between D&C and Dynamic Programming ?
2 votes
1 answer
5
1. What is equivalence relation? 2. How can u represent equivalence. relation with a data structure? 3. Which data structure? how efficient? How can u test for. equivalen...
2 votes
1 answer
6
#IITD_2011 A man is standing in front of an infinite wall with a hole on any side? How do u find the hole in shortest distance
2 votes
2 answers
7
#IITD_2011If we are give a sorted array and we have to find two elements which sum to a number x.
2 votes
2 answers
8
#IITD_2011there is a frog who could climb either 1 stair or 3 stairs in one shot. In how many ways he could reach at 100th stair ?
1 votes
0 answers
9
1 votes
1 answer
13
People who attended IISc CDS MTech admission interviews on 18th April 2017, can you please share your experience?
1 votes
2 answers
14
Prove that in a group of 6 people, there are at least three mutual friends or three mutual strangers.
1 votes
1 answer
15
Define B tree and B+ tree. What’s the necessity? How does the search happen? Write the pseudo code and the recurrence relation.
1 votes
2 answers
16
What is pipelining? Whats the need? Whats the funda behind it? Does it make the processor faster?
1 votes
1 answer
17
What is digital signature? How does it work?
1 votes
1 answer
18
Have you heard of ethernet?” I said “Yes!”. Then I was asked “Can we lay an ethernet LAN between Delhi and Bangalore?
1 votes
1 answer
19
Which is greater root(n) or 2^root(logn)
1 votes
3 answers
20
#IITD_2011 which is better merge sort or heap. sort ?