ON campus
1 OA of 3 hours—1 question of graph
Ques—A man travels from one node in a graph to another. He has to stay in one node for 10 mins. Probabilities are given for every edge, stating the probability of the man taking that path. It was a directed graph.
Tell after time has passed what the highest probable node is where man can be found. and what is the probability of that node?
they make us install their Samsung-certified system on which test happened
there was no partial marking. if you completely solve the problem, then you are selected
6 students were selected for interview.
Interview: 40-45 min
time may vary according to the interviewer.
1) The interview started with my introduction, and then he asked me which topics you are good at. I said graphs, and then he asked me about topological sort, strongly connected components, how to implement unordered sets, and sets. given me the option to answer between quicksort and heapsort.
then switched to OOP—deep vs. shallow copy, inheritance, and encapsulation.
4 students were selected in this round
then he rounded
general questions like why do you want to join samsung , what are your goals in life, which is your dream company, etc.
Finally, 3 were selected
