Recent questions in Interview Questions

0 votes

1 answer

1

IITD EET Interview
Question was about Single Source shortest path - We know that Dijkstra may/ may not handle negative edge weights in graph but Bellman Ford can. Also, the time complexity of bellman ford is higher than that of Dijkstra's. Now what if we ... integer to all the weights of the graph, and then simply apply Dijkstra? What is the need of Bellman Ford then?

asked May 17 in Interview Questions by Mahima Manik (289 points) | 83 views

0 votes

0 answers

2

Embedded Controls and Software at IITKgp - Interview Preparation

asked Apr 29 in Interview Questions by Anonymos cat (11 points) | 334 views

0 votes

0 answers

3

iit interview and written test
What will be asked in iit ropar interview and written test?

asked Apr 20 in Interview Questions by ikulkarni1 (11 points) | 73 views

0 votes

1 answer

4

Admission Interviews
People who attended IISc CDS MTech admission interviews on 18th April 2017, can you please share your experience?

asked Apr 20 in Interview Questions by tvkkk Junior (967 points) | 138 views

+2 votes

1 answer

5

For Those Preparing for Research Interviews in Systems Area

asked Mar 5 in Interview Questions by Arjun Veteran (288k points) | 202 views

0 votes

0 answers

6

general
I'm a GATE aspirant, im pretty good with all the BASICS of the subject and expecting interview calls from IIT's this year (sinse gate rank not exceptionally good) the problem lies in the fact despite of all this knowledge about data ... was bogus. Any SUGGESTIONS about how to tackle this situation so that i will be able to confidently face the interviews?

asked Feb 19 in Interview Questions by rahul CHAUHAN 1 (25 points) | 97 views

0 votes

0 answers

7

How to study for interview for PGEE or any other

asked Apr 18, 2016 in Interview Questions by Piyush Kapoor Junior (897 points) | 64 views

+1 vote

3 answers

8

IISc2012Research
#IISc2012Research 1>Recurrence relation and worst case time complexity of Merge sort 2> Difference between D&C and Dynamic Programming ?

asked Feb 23, 2016 in Interview Questions by Rajesh Pradhan Veteran (17.1k points) | 152 views

+2 votes

0 answers

9

#iisc2012research_Interview
#iisc2012research_Interview 1. Define relation and function 2. Difference between them 3. Cross product of a set 4. Write definition of reflexive, symmetric, equivalence relation in mathematical expression 5. Number of symmetric relation 6. Eigen values, ... . What is min heap 9. Build one from an array 10. How heap sort works using min heap

asked Feb 23, 2016 in Interview Questions by Rajesh Pradhan Veteran (17.1k points) | 97 views

+1 vote

2 answers

10

IITM2012
Prove that in a group of 6 people, there are at least three mutual friends or three mutual strangers.

asked Feb 23, 2016 in Interview Questions by Rajesh Pradhan Veteran (17.1k points) | 167 views

0 votes

1 answer

11

IITD2012
Define B tree and B+ tree. What’s the necessity? How does the search happen? Write the pseudo code and the recurrence relation.

asked Feb 23, 2016 in Interview Questions by Rajesh Pradhan Veteran (17.1k points) | 66 views

+2 votes

1 answer

12

IITM2012
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. equivalence efficiently?

asked Feb 23, 2016 in Interview Questions by Rajesh Pradhan Veteran (17.1k points) | 199 views

0 votes

2 answers

13

IITD2011
What is pipelining? Whats the need? Whats the funda behind it? Does it make the processor faster?

asked Feb 23, 2016 in Interview Questions by Rajesh Pradhan Veteran (17.1k points) | 90 views

0 votes

1 answer

14

IITD2011Interview
What is digital signature? How does it work?

asked Feb 23, 2016 in Interview Questions by Rajesh Pradhan Veteran (17.1k points) | 77 views

0 votes

1 answer

15

IITD2011interview
Have you heard of ethernet?” I said “Yes!”. Then I was asked “Can we lay an ethernet LAN between Delhi and Bangalore?

asked Feb 23, 2016 in Interview Questions by Rajesh Pradhan Veteran (17.1k points) | 152 views

+1 vote

1 answer

16

IITD2011Interview
Which is greater root(n) or 2^root(logn)

asked Feb 23, 2016 in Interview Questions by Rajesh Pradhan Veteran (17.1k points) | 97 views

0 votes

3 answers

17

IITD2011Interview
#IITD_2011 which is better merge sort or heap. sort ?

asked Feb 23, 2016 in Interview Questions by Rajesh Pradhan Veteran (17.1k points) | 138 views

+1 vote

1 answer

18

IITD2011 Interview
#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

asked Feb 23, 2016 in Interview Questions by Rajesh Pradhan Veteran (17.1k points) | 125 views

0 votes

2 answers

19

IITD2011 Interview
#IITD_2011 why dont we divide array in 5 parts for merge sort ?

asked Feb 23, 2016 in Interview Questions by Rajesh Pradhan Veteran (17.1k points) | 96 views

+1 vote

2 answers

20

IITD_2011 Interview
#IITD_2011 If we are give a sorted array and we have to find two elements which sum to a number x.

asked Feb 23, 2016 in Interview Questions by Rajesh Pradhan Veteran (17.1k points) | 75 views

+1 vote

2 answers

21

IITD_2011 interview
#IITD_2011 there 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 ?

asked Feb 23, 2016 in Interview Questions by Rajesh Pradhan Veteran (17.1k points) | 140 views

Recent questions in Interview Questions

Recent Posts

Recent Blog Comments