Budding Scientist
Budding Scientist Interview Questions and Answers
Asked in Xerox
Q. In graph theory, how do you obtain the number of tournaments with 'N' nodes? Define a transitive tournament. Define a sub-tournament. What is the lower bound on the size of the maximal transitive sub-tournament...
read moreThe aim is to find an upper bound for the minimum number of nodes in a maximal transitive sub-tournament.
A transitive tournament is one where any three nodes can be arranged in a way that satisfies the transitive property.
A sub-tournament is an induced graph on a subset of nodes from the original tournament.
Every tournament with N nodes contains a transitive sub-tournament of size 2 (a directed edge).
The goal is to find the maximal transitive sub-tournament with the minimum n...read more
Asked in Xerox
Q. 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). How would you obtain the MST for the new graph using the old graph's MST...
read moreTo obtain the MST for the new graph, we can use the old graph's MST as a starting point and update it based on the altered edge's weight.
Start with the old graph's MST
Remove the edge with the altered weight from the MST
Add the altered edge to the new graph
Run a minimum spanning tree algorithm on the new graph to obtain the updated MST
Calculate your in-hand salary
Confused about how your in-hand salary is calculated? Enter your annual salary (CTC) and get your in-hand salary
Reviews
Interviews
Salaries
Users
Made with ❤️ in India. Trademarks belong to their respective owners. All rights reserved © 2025 Info Edge (India) Ltd.
