Senior Software Test Engineer Interview Questions

1,212 senior software test engineer interview questions shared by candidates

In the second pahes's questions set, there are two question categories; first is case study type questions and second is script programming questions (Python). The first category is presented as user and test scenarios of a specific system or messaging interfaces. These scenarios are highly related to the domain that the company is working on, which is Smart cards, card readers their messaging interfaces. In the programming questions, one of them was challenging but not very impossible to be solved.
Aug 17, 2016

In the second pahes's questions set, there are two question categories; first is case study type questions and second is script programming questions (Python). The first category is presented as user and test scenarios of a specific system or messaging interfaces. These scenarios are highly related to the domain that the company is working on, which is Smart cards, card readers their messaging interfaces. In the programming questions, one of them was challenging but not very impossible to be solved.

02. Design & Code for a poker game where it consists of few tables and each table consists of 6 chairs. And the system has to allocate the available seat to the participants in queue. And each participant will be allocated 100 poker chips.
Apr 13, 2015

02. Design & Code for a poker game where it consists of few tables and each table consists of 6 chairs. And the system has to allocate the available seat to the participants in queue. And each participant will be allocated 100 poker chips.

In a language of your choice, please provide a solution for the following problem. Problem: Given a sorted array of non-zero integers, remove the duplicate elements from the array and return the number of unique elements found. At the end of your algorithm, the array should contain unique elements. If the number of unique elements is less than the size of the array, fill the remaining indices with 0. For example: ex. Input - arr[] = {1, 2, 2, 3} ex. Output - arr[] = {1, 2, 3, 0} - return 3 ex. Input - arr[] = {1, 1, 1, 1} ex. Output - arr[] = {1, 0, 0, 0} - return 1 You should include your algorithm in the removec Duplicates method, whose inputs are the array and the length of the array.
Mar 21, 2022

In a language of your choice, please provide a solution for the following problem. Problem: Given a sorted array of non-zero integers, remove the duplicate elements from the array and return the number of unique elements found. At the end of your algorithm, the array should contain unique elements. If the number of unique elements is less than the size of the array, fill the remaining indices with 0. For example: ex. Input - arr[] = {1, 2, 2, 3} ex. Output - arr[] = {1, 2, 3, 0} - return 3 ex. Input - arr[] = {1, 1, 1, 1} ex. Output - arr[] = {1, 0, 0, 0} - return 1 You should include your algorithm in the removec Duplicates method, whose inputs are the array and the length of the array.

Viewing 161 - 170 interview questions

Glassdoor has 1,212 interview questions and reports from Senior software test engineer interviews. Prepare for your interview. Get hired. Love your job.