Indian Institute of Technology (IIT), Chennai
Chennai, Tamil Nadu
Your seniors at Indian Institute of Technology (IIT), Chennai were your true well-wishers, they shared their placement interview questions for you. 🙏
AmbitionBox
Search
Reviews
- Reviews
- Salaries
- Interview Questions
- About Company
- Benefits
- Jobs
- Office Photos
- Community
Filter interviews byIndian Institute of Technology (IIT), Chennai Placement Interview Questions
Updated
4 Dec 2024
1 interview found
I applied via Campus Placement and was interviewed in Dec 2016.
1 Interview Round
Interview Questions
- Q1. An MST is constructed for a very large graph. Now, one of the edges, in the graph, has its weight altered (either increased or decreased). Now obtain the MST fo...read more
- Q2. Graph Theory : Obtain the number of tournaments with 'N' nodes. Now define a transitive tournament as one where any three nodes (i,j,k) can be arranged in such ...read more
Interview Preparation Tips
Round: Technical Interview
Experience: I got stuck in the question as I wasn't able to approach this question. The interviewer helped me out by giving me the following two clues.
1. Two properties of MST : Cycle Property and Min-Cut Property.
2. 4 cases : (modified edge in old MST)*(weight increased or decreased) -> I eliminated two cases as it would return the old MST. Only 10 and 01 need to be considered.
Tips: Requires Graph Theory(Min Spanning Tree algorithm, Min Spanning Tree properties etc.)
Round: Technical Interview
Experience: I had no idea to approach this problem.
I decided to first come up with an algorithm to obtain the maximal transitive sub-tournament given a tournament.
The interviewer then told me to see if I can upper bound the minimum out-degree in a tournament.
After this, the solution was to upper bound the minimum size of the transitive sub-tournament.
HINT : Use the fact that a tournament contains N_choose_2 number of edges for part II.
Tips: Requires very little graph theory. More thinking based, proof oriented. I had to prove every claim I made.
Skills: Graph Theory, Logical And Structured Thinking, Proving Abilitites
College Name: IIT Madras
Experience: I got stuck in the question as I wasn't able to approach this question. The interviewer helped me out by giving me the following two clues.
1. Two properties of MST : Cycle Property and Min-Cut Property.
2. 4 cases : (modified edge in old MST)*(weight increased or decreased) -> I eliminated two cases as it would return the old MST. Only 10 and 01 need to be considered.
Tips: Requires Graph Theory(Min Spanning Tree algorithm, Min Spanning Tree properties etc.)
Round: Technical Interview
Experience: I had no idea to approach this problem.
I decided to first come up with an algorithm to obtain the maximal transitive sub-tournament given a tournament.
The interviewer then told me to see if I can upper bound the minimum out-degree in a tournament.
After this, the solution was to upper bound the minimum size of the transitive sub-tournament.
HINT : Use the fact that a tournament contains N_choose_2 number of edges for part II.
Tips: Requires very little graph theory. More thinking based, proof oriented. I had to prove every claim I made.
Skills: Graph Theory, Logical And Structured Thinking, Proving Abilitites
College Name: IIT Madras
Campus Placement Interview Questions at Top Colleges
- Indian Institute of Technology (IIT), Chennai Placement Interview Questions
- Maharaja Agrasen Institute of Technology, Delhi Placement Interview Questions
- National Institute of Technology (NIT), Warangal Placement Interview Questions
- Indian Institute of Management (IIM), Lucknow Placement Interview Questions
- Indian Institute of Technology (IIT), Kanpur Placement Interview Questions
- Show more
- Home >
- colleges >
- indian institute of technology iit chennai placement interview questions