Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Filter
Recent
Hot!
Most votes
Most answers
Most views
Previous GATE
Featured
Most answered questions in Interview Questions
2
votes
3
answers
1
IISc2012Research
#IISc2012Research 1>Recurrence relation and worst case time complexity of Merge sort 2> Difference between D&C and Dynamic Programming ?
#IISc2012Research 1>Recurrence relation and worst case time complexity of Merge sort 2 Difference between D&C and Dynamic Programming ?
Rajesh Pradhan
700
views
Rajesh Pradhan
asked
Feb 23, 2016
1
votes
3
answers
2
IITD2011Interview
#IITD_2011 which is better merge sort or heap. sort ?
#IITD_2011 which is better merge sort or heap. sort ?
Rajesh Pradhan
543
views
Rajesh Pradhan
asked
Feb 22, 2016
1
votes
2
answers
3
IITM2012
Prove that in a group of 6 people, there are at least three mutual friends or three mutual strangers.
Prove that in a group of 6 people, there are at least three mutual friends or three mutual strangers.
Rajesh Pradhan
2.3k
views
Rajesh Pradhan
asked
Feb 22, 2016
1
votes
2
answers
4
IITD2011
What is pipelining? Whats the need? Whats the funda behind it? Does it make the processor faster?
What is pipelining? Whats the need? Whats the funda behind it? Does it make the processor faster?
Rajesh Pradhan
504
views
Rajesh Pradhan
asked
Feb 22, 2016
Interview Questions
iit-interview
+
–
0
votes
2
answers
5
IITD2011 Interview
#IITD_2011 why dont we divide array in 5 parts for merge sort ?
#IITD_2011 why dont we divide array in 5 parts for merge sort ?
Rajesh Pradhan
467
views
Rajesh Pradhan
asked
Feb 22, 2016
2
votes
2
answers
6
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.
#IITD_2011If we are give a sorted array and we have to find two elements which sum to a number x.
Rajesh Pradhan
431
views
Rajesh Pradhan
asked
Feb 22, 2016
2
votes
2
answers
7
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 ?
#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 ?
Rajesh Pradhan
664
views
Rajesh Pradhan
asked
Feb 22, 2016
1
votes
1
answer
8
Understanding Confusion and Diffusion - Network Security
Explain Confusion and Diffusion How it is implemented in DES AES
Explain Confusion and DiffusionHow it is implemented in DESAES
pC
1.5k
views
pC
asked
Sep 19, 2017
Interview Questions
computer-networks
network-security
conceptual-questions
+
–
1
votes
1
answer
9
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 add a large positive integer to all the weights of the graph, and then simply apply Dijkstra? What is the need of Bellman Ford then?
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 o...
Mahima Manik
828
views
Mahima Manik
asked
May 16, 2017
Interview Questions
iit-interviews
+
–
1
votes
1
answer
10
Admission Interviews
People who attended IISc CDS MTech admission interviews on 18th April 2017, can you please share your experience?
People who attended IISc CDS MTech admission interviews on 18th April 2017, can you please share your experience?
tvkkk
1.2k
views
tvkkk
asked
Apr 20, 2017
Interview Questions
iisc-interview
cds
+
–
2
votes
1
answer
11
For Those Preparing for Research Interviews in Systems Area
Hi, As I had told earlier Research interviews are not like GATE exam were only basics are checked. But it is simpler because we need to concentrate only on a few or even 1 subject unlike 10+ for GATE. i.e., we need more ... high performance computing. I put it as a question and not a blog so that I can add materials as answer here.
Hi, As I had told earlier Research interviews are not like GATE exam were only basics are checked. But it is simpler because we need to concentrate only on a few or even ...
Arjun
859
views
Arjun
asked
Mar 5, 2017
Interview Questions
research-interviews
preparation
+
–
1
votes
1
answer
12
IITD2012
Define B tree and B+ tree. What’s the necessity? How does the search happen? Write the pseudo code and the recurrence relation.
Define B tree and B+ tree. What’s the necessity? How does the search happen? Write the pseudo code and the recurrence relation.
Rajesh Pradhan
383
views
Rajesh Pradhan
asked
Feb 22, 2016
2
votes
1
answer
13
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?
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...
Rajesh Pradhan
1.6k
views
Rajesh Pradhan
asked
Feb 22, 2016
Interview Questions
data-structures
+
–
1
votes
1
answer
14
IITD2011Interview
What is digital signature? How does it work?
What is digital signature? How does it work?
Rajesh Pradhan
439
views
Rajesh Pradhan
asked
Feb 22, 2016
1
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?
Have you heard of ethernet?” I said “Yes!”. Then I was asked “Can we lay an ethernet LAN between Delhi and Bangalore?
Rajesh Pradhan
625
views
Rajesh Pradhan
asked
Feb 22, 2016
1
votes
1
answer
16
IITD2011Interview
Which is greater root(n) or 2^root(logn)
Which is greater root(n) or 2^root(logn)
Rajesh Pradhan
363
views
Rajesh Pradhan
asked
Feb 22, 2016
2
votes
1
answer
17
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
#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
Rajesh Pradhan
479
views
Rajesh Pradhan
asked
Feb 22, 2016
0
votes
0
answers
18
selfdoubts
please anyone share iit patna self sponsored interview experience for artificial intelligence mtech 2022 ?
please anyone share iit patna self sponsored interview experience for artificial intelligence mtech 2022 ?
sonucse12345
101
views
sonucse12345
asked
May 29, 2023
Interview Questions
admission
+
–
1
votes
0
answers
19
Admission Query
Hi, I am getting a score around 600 as per GO. I have done my BTech in Electrical Engineering in 2018 and have a CGPA of 8.02. What are the possible options in IITs for Research interviews for score above 600. Also what Nit’s are possible both research as well as direct Mtech. Category General
Hi, I am getting a score around 600 as per GO.I have done my BTech in Electrical Engineering in 2018 and have a CGPA of 8.02.What are the possible options in IITs for Res...
Vivekk
501
views
Vivekk
asked
Feb 14, 2019
1
votes
0
answers
20
IIT-Hyderabad M.Tech. (RA) - Need Interview Preparation Advice
Greetings! I appeared for GATE Computer Science in 2018 but could not manage to get into any decent IIT for Monsoon admissions. I had applied to IIT-Hyderabad's winter admissions for M.Tech. (RA) and got shortlisted ... that? How is the difficulty of such written tests? Any other advice will be greatly appreciated. Thanks a lot!
Greetings!I appeared for GATE Computer Science in 2018 but could not manage to get into any decent IIT for Monsoon admissions. I had applied to IIT-Hyderabad's winter adm...
intergalactic_ape
2.4k
views
intergalactic_ape
asked
Nov 20, 2018
Interview Questions
interview
preparation
iit-hyderabad
written-test
+
–
Page:
1
2
next »
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register