Upload Button Icon Add office photos

Filter interviews by

Xerox Budding Scientist Interview Questions and Answers

Updated 5 Dec 2016

Xerox Budding Scientist Interview Experiences

2 interviews found

I applied via campus placement at Indian Institute of Technology (IIT), Chennai and was interviewed in Dec 2016. There was 1 interview round.

Interview Questionnaire 

2 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 for the new graph using the old graphs MST and ...
  • Ans. 

    To 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

  • Answered by AI
  • 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 a way that i->j->k and i->k. Define sub-tourn...
  • Ans. 

    The 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 fin...

  • Answered by AI

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

Skills evaluated in this interview

Interview Preparation Tips

Round: Test
Experience: There were questions based on probability, algorithms and graphs. Probability questions were simple. Algorithms portion was mainly on different sorting algorithms and their runtime. Graphs on graph asked about complexity, number of graphs possible, etc. Based on the scores, a shortlist was prepared for campus interviews.
Tips: Solving puzzles from -----/ and "Fifty Challenging Problems In Probability With Solutions" is good enough preparation for any question asked on probability during placement tests. For algorithms, a data structure course done in my college was helpful.
Duration: 30 minutes
Total Questions: 20

Round: Technical Interview
Experience: I was asked to explain my projects. After that, I was asked questions on PCA, SVM, KNN, linear regression, logistic regression, entropy, information gain, decision trees. The interviewer asked for equations in all topics.
Tips: Remember details about every aspect of your project. Even minor details like which features you extracted, why you chose certain classifier, etc were asked.

Round: Technical Interview
Experience: The interviewer asked me to explain about something innovative I had done in my projects. Then he asked a guesstimate question - Estimate the number of trees and plants in a city. This was followed by another guesstimate - How would you estimate the rate of growth of trees and plants if you have data only from the present. (no past or future statistics can be used)
Tips: Practice guesstimates as done for case interviews. Practice presenting your projects in an interesting manner with your friends. Ask your friends to ask you questions about your projects. Since they have heard about your project for the first time, they may ask you questions which you never thought of. This should be sufficient to get past the interviews for Xerox Research - Budding Scientist profile.

Skills: Algorithms And DataStructures, Guesstimate Skills, Machine Learning
College Name: IIT Kharagpur

Budding Scientist Interview Questions Asked at Other Companies

asked in Xerox
Q1. Graph Theory : Obtain the number of tournaments with 'N' nodes. N ... read more
asked in Xerox
Q2. An MST is constructed for a very large graph. Now, one of the edg ... read more

Interview questions from similar companies

Interview experience
4
Good
Difficulty level
Moderate
Process Duration
2-4 weeks
Result
Selected Selected

I applied via Naukri.com and was interviewed in Mar 2023. There were 4 interview rounds.

Round 1 - Resume Shortlist 
Pro Tip by AmbitionBox:
Keep your resume crisp and to the point. A recruiter looks at your resume for an average of 6 seconds, make sure to leave the best impression.
View all tips
Round 2 - Technical 

(1 Question)

  • Q1. Coding questions
Round 3 - Case Study 

ML and NLP questions

Round 4 - HR 

(1 Question)

  • Q1. CTC discussion and that’s it

Xerox Interview FAQs

What are the top questions asked in Xerox Budding Scientist interview?

Some of the top questions asked at the Xerox Budding Scientist interview -

  1. Graph Theory : Obtain the number of tournaments with 'N' nodes. Now define a tr...read more
  2. An MST is constructed for a very large graph. Now, one of the edges, in the gra...read more

Tell us how to improve this page.

Interview Questions from Similar Companies

Samsung Interview Questions
3.9
 • 561 Interviews
Cimpress Interview Questions
4.0
 • 62 Interviews
Toshiba Interview Questions
4.0
 • 28 Interviews
SiliconIndia Interview Questions
2.7
 • 25 Interviews
Group Bayport Interview Questions
4.3
 • 20 Interviews
View all
Senior Software Engineer
97 salaries
unlock blur

₹5.8 L/yr - ₹21 L/yr

Software Engineer
45 salaries
unlock blur

₹2.2 L/yr - ₹11.1 L/yr

Lead Engineer
36 salaries
unlock blur

₹9 L/yr - ₹23.6 L/yr

Senior Associate
33 salaries
unlock blur

₹1.5 L/yr - ₹5 L/yr

Data Validation Specialist
31 salaries
unlock blur

₹1.5 L/yr - ₹4 L/yr

Explore more salaries
Compare Xerox with

Helmerich & Payne

4.0
Compare

Canon

4.0
Compare

Ricoh

3.9
Compare

Konica Minolta Business Solutions India Pvt. Ltd.

3.5
Compare
Did you find this page helpful?
Yes No
write
Share an Interview