ArcSight fa ora parte di Hewlett Packard Enterprise | HPE. For up to date information and jobs, please see the Hewlett Packard Enterprise | HPE [1093046] profile..
Ho presentato la mia candidatura tramite segnalazione di un dipendente. La procedura ha richiesto 3 settimane. Ho sostenuto un colloquio presso ArcSight nel mese di dic 2010
Colloquio
One of the guys there who interviewed me is very arrogant, he only talked to me 5 minutes, then left me with a piece of paper of technical questions, he also gave me some homework(write a program and email him the code) to do.
Considering a compensation below the industry average, it's totally a waste of time.
Ho presentato la mia candidatura online. La procedura ha richiesto 2 settimane. Ho sostenuto un colloquio presso ArcSight (Cupertino, CA) nel mese di ago 2011
Colloquio
1 Phone Interview 3 Virtual conference based interview
Phone interview questions: Compare software versions and return which version is greater
Virtual Interview Questions:
1) linked list has side node which can also have a linked list. Flatten the list(35mins)
2) Java Garbage collection types: Parallal and concurrent garbase collection(5mins)
3) Heap garbase collection behaviour explanation(5mins)
4) Return sub array indexes from an array where sub array element sum is greatest(Email the code)
5) Find a string in a sorted array (20mins)
6) Provide a design and code, non blocking and blocking enqueue and dequeue methods. Where enqueue and dequeue methods will take a parameter to determine if they will be blocking or non-blocking. Make them thread safe also.(45mins total for design , coding, testing code in eclipse)
Ho presentato la mia candidatura online. La procedura ha richiesto 2 settimane. Ho sostenuto un colloquio presso ArcSight (Cupertino, CA) nel mese di ago 2011
Colloquio
1 phone interview
3 virtual interview with computer conference
Domande di colloquio [5]
Domanda 1
1) compare software release versions and return whats greater,
1)nonblocking queue and blocking queue design. make it thread safe
2) linked list has side list with a side node liked to the main node. Flatten list to sequential regular list