Solicité el puesto a través de la escuela superior o la universidad. Acudí a una entrevista en Riverbed Technology en dic 2015
Entrevista
Hiring process had 2 stage.
1. Coding round (only in c language)
2. Interview (2 Technical Interview)
In first interview, they asked Data Structure and algorithm questions
In second interview, OS and networking question was asked.
both in interview was an hour long.
Preguntas de entrevista [1]
Pregunta 1
What is paging ?
Run_Time loading ?
what is Process?
..
..
What is NAT, Switch, Router, Routing algorithm, TCP, UDP?
Solicité el puesto a través de un captador. El proceso duró 1 semana. Acudí a una entrevista en Riverbed Technology (Bengaluru) en mar 2021
Entrevista
Kudos to the team for completing the entire process in a week.
Got a call from recruiter whether I would be interested in exploring an opportunity.
Then they setup Round 1 which essentially might be for filtering candidates.
Round 1 : ~40mins Technical round
Quick overview on projects mentioned in resume.
C programming concepts. Predicting output.
Linked list basic questions.
Strings
IPC
Round 2 ~1 hr Technical round
Interviewer was calm. Took few minutes to introduce himself and his work.
Covered basic aspects of C and oop languages.
Round 3 1hr Techno-Managerial round
System design question
Small puzzle on array
Manager was very calm and supportive throughout. Explained about every detail on the projects that are carried out at the company.
Behvaioural questions.
Round 4 1 hr Techno-Managerial round
Spoke with the Director.
More behavioural questions.
Took his time in explaining companies vision and the role they are hiring for.
Preguntas de entrevista [1]
Pregunta 1
C programming concepts. Predicting output.
Linked list basic questions.
Strings
IPC
System design question
Solicité el puesto por otro medio. El proceso duró 1 día. Acudí a una entrevista en Riverbed Technology
Entrevista
It was good. Two rounds of coding and another round of discussions on the design aspects. Coding ranged from writing code for problems on trees, bit operations, linked list and stacks.
