Performance engineer Interview Questions
588
Performance Engineer interview questions shared by candidates
what are the different stages in performance testing
6 Answers↳
Requirements, planning, design, development, testing,implementation, maintenance, Less
↳
Pharmacy
↳
Performance Testing Stages: 1) Identifying the testing environment. 2) Identifying the performance metrics: Performance metrics is very important which determines the parameters on which test has to be performed. 3) Planning and designing the test. 4) Test environment setup. 5) Capturing the data. 6) Analysis and report generation. 7) Retesting: The test is again performed on the same parameters to test if the rectification work is sufficient or needs some tuning. Less
Why might you use SMTP to get large (multi-gig) line-oriented text-based logs from one machine to another?
4 Answers↳
How about that SMTP will convert the line breaks for the target OS?
↳
Found excellent read: bit.ly/faang100
↳
SMTP does auto-retry. Also, I believe the fact that logs are text means that SMTP servers are particularly tailored to them. Less
sql query to find count of students having same last name
3 Answers↳
select count(LastName) from employees group by LastName having count(*)>1
↳
Select lastname, count(*) as lastnamecount from students group by lastname having count(*)>1 Less
↳
select * from Students where lastName in (select s1.lastName from Students s1 group by s1.lastName having count(*)>1); Less
Given an integer matrix that is sorted ascending in each row and each column write an algorithm that find an integer X or returns false.
2 Answers↳
boolean FindElem(int[][] mat, int elem, int M, int N) { int row = 0; int col = N-1; while (row = 0) { if (mat[row][col] == elem) { return true; } else if (mat[row][col] > elem) { col--; } else { row++; } } return false; } Less
↳
The matrix is sorted, you can use binary search to find it quicker. Binary search through last column value of each row first, then binary search through the row that's has the closest value on last column. Less
Relatively simple scripting exercise using codesignal where knowledge of binary search is necessary to solve the question efficiently. It didn't seem particularly relevant to the job. I guess it's more about how you approach the given problem? So they want to know if you avoid slower solutions and at least know and are confident implementing binary search?!
2 Answers↳
I also had basically the same experience with you, I think the company is good, but the recruiter is performing unprofessional. Less
↳
Through questions like this, interviewers are mostly trying to test your skillset (and its relevance to the role) as robustly as possible, so be prepared for multiple offshoots and followups. It could be a useful exercise to do mocks with friends or colleagues in Cohesity to get a real sense of what the interview is actually like. Alternatively Prepfully has a ton of Cohesity Performance Engineer experts who provide mock interviews for a pretty reasonable amount. prepfully.com/practice-interviews Less
List the functional test cases for this theoretical application.
2 Answers↳
Listed a few, but not in my area of expertise.
↳
Interviewed 6 FAANG employees and got this: bit.ly/faang100
What is Hits per Second, Throughput, Pacing, Think Time.
2 Answers↳
Number of Http request sent to the server in a sec
↳
Hits per seconds:- refer to the number of HTTP requests sent by the users to the web servers in a seconds. Throughput:- define the number of transaction per seconds. Think Time:- it's a waiting time between transaction, or users waiting time. Less