Candidatei-me online. O processo levou 2 dias. Fui entrevistado pela Cequint (Seattle, WA) em mai. de 2016
Entrevista
I have several phone interviews prior to getting me in for in-person.
The in-person interview takes 2 hours with 6 people (group of 2 people) from different departments.
All the people there are super nice. I enjoyed the time I was there and left belong with the team.
Interview went well.
Too bad though I didn't get the job. Wish the best for the people there.
Perguntas de entrevista [1]
Pergunta 1
Overall Linux familiarity with commands and troubleshooting.
Candidatei-me por meio de uma faculdade ou universidade. O processo levou 1 dia. Fui entrevistado pela Cequint (Seattle, WA) em set. de 2011
Entrevista
Met with both QA managers who are both friendly. Each meeting lasted for an hour with the managers getting to know you and your background. They each have their own test to access your ability for the job. Basically each test was how would you go about a test plan for their main product, callerID.
Perguntas de entrevista [1]
Pergunta 1
How would you test out a handset to be capable for the City ID application.
Candidatei-me online. O processo levou 2 dias. Fui entrevistado pela Cequint (Seattle, WA) em ago. de 2011
Entrevista
The hiring manager saw my resume in their system and thought I was a very good match. She contacted me by email to set up an initial phone interview. This interview consisted of verifying essential points on my resume. It was a very basic interview and she was very pleasant to chat with. After this first interview she set me up to phone-interview the hiring manager the next day. The next interview was technical and also by phone.
Perguntas de entrevista [2]
Pergunta 1
Given the class:
CStudent {
char *name
char grade };
There are 1 million objects...
a) what is the fastest way to sort by grade (primary sort) and name (secondary sort) ?
b) what is the fastest way to sort by name ?
c) Order notation... what is the time required to sort by name ?
Given the class:
CNode {
int data
node *next };
There are 5 nodes: pHead -> Node(data=1) -> Node(data=2) -> Node(data=3) -> Node(data=4) -> Node(data=5) -> null
a) describe how to delete the node with data == 4
b) given that pHead=next.next, what node does pHead point to ?
c) given just the head pointer, is it possible to print out the data in the entire list? How ?