Ho presentato la mia candidatura online. La procedura ha richiesto 2 mesi. Ho sostenuto un colloquio presso Samsung Electronics (Seoul) nel mese di mag 2011
Colloquio
I applied online. It was mandatory to take the standardized test. After the test, I was called in for an office interview. The process took 2 or 3 rounds.
Domande di colloquio [1]
Domanda 1
What was the most difficult experience that you had to deal with and how did you manage
Ho sostenuto un colloquio presso Samsung Electronics
Colloquio
First they had a written exam. It had basic language and aptitude questions. It was to be done in a given time frame. It was an elimination round too.
Second round was a technical interview round. It required basic coding and DS knowdlege. If you are good logically and technically you will be able to clear through it
Basic Data structure
Language specific questions.Very basic level
Basic Puzzles
Make File and other related if you going for C
Third round was HR round. HR explained about company policies in general . We were made to fill a yellow form if we were selected.
Domande di colloquio [1]
Domanda 1
Puzzle : How to cut a cake into equal pieces
Question : Write a program to check a string is palindrome or not
Ho presentato la mia candidatura tramite l'università. La procedura ha richiesto un giorno. Ho sostenuto un colloquio presso Samsung Electronics (Warangal) nel mese di ott 2013
Colloquio
On campus recruitment. mainly concentrates on your technical knowledge and personality . Good dressing would help. There are 3 rounds one technical written,one technical interview, one hr interview. Hr is for namesake.
Domande di colloquio [1]
Domanda 1
About Stacks,Linked list, Queues , classes and structures impelementation.
basic technical questions.
Ho presentato la mia candidatura tramite l'università. La procedura ha richiesto un giorno. Ho sostenuto un colloquio presso Samsung Electronics (Noida) nel mese di ago 2012
Colloquio
Two stages-
1st stage - Aptitude Test
2nd round- Technical Interview
Domande di colloquio [1]
Domanda 1
You have a binary search tree and integer n, find out the most efficient way to locate two nodes of the three whose summation is equals to "n" ?
