Sagent Senior Software Quality Engineer Interview Questions and Answers

It was an online test for interview

Q1. Tell me about dijistkras algorithm
Ans. 
Dijkstra's algorithm is a graph search algorithm that finds the shortest path between nodes in a graph.
• Dijkstra's algorithm uses a priority queue to select the node with the smallest distance from the start node.

• It maintains a list of tentative distances to each node and updates them as it explores the graph.

• The algorithm is commonly used in routing and network protocols to find the shortest path between nodes.

• Example:...read more
Answered by AI
Add your answer
Q2. Tell me about your projects
Add your answer

Three coding problems were asked one was to print frequency of each character in a string, second was also similar to this problem unable to recall it and third problem was given an array of string and range from L to R find the nth character if all strings from L to R is concatenated and sorted. Apart from these three coding problems there were 10 easy MCQ's.

Q1. Basic questions on java and spring boot, annotations, oops concept.
Add your answer
Q2. Code LRU cache(with no updates), just to implement push and pop operation with given window size of 4.
Add your answer

Q1. It was a design round where I was asked to write class models of a in memory session management system without using tools like redis.
Add your answer

Q1. Move negative elements to right side of array
Ans. 
Move negative elements to right side of array
• Iterate through the array and swap negative elements to the right side

• Use two pointers approach to keep track of positive and negative elements

• Maintain the order of elements while moving negatives to the right side
Answered by AI
Add your answer

Q1. Backend Questions regarding
Add your answer
Q2. UI Questions regarding Angular
Add your answer

Medium to hard questions based on arrays, dp

Q1. Quick sort algorithm
Ans. 
Quick sort is a popular sorting algorithm that uses divide and conquer strategy.
• Divides array into smaller sub-arrays based on a pivot element

• Recursively sorts sub-arrays

• Combines sorted sub-arrays to get final sorted array

• Time complexity: O(n log n) on average, O(n^2) worst case

• Example: [3, 6, 8, 10, 1, 2, 1] -> [1, 1, 2, 3, 6, 8, 10]
Answered by AI
Add your answer
Q2. Modified rotate a matrix
Ans. 
Rotate a matrix by 90 degrees in place
• Transpose the matrix

• Reverse each row of the transposed matrix
Answered by AI
Add your answer

Basic string manipulation and general DSA questions

Q1. Tree traversal iteratively
Add your answer
Q2. Implement DFS,BFS on graph
Add your answer

It was the ask mostly about DSA

30 Manual testing and 30 normal aptitude mcq easy questions only one and half hour timing

Q1. Manual testing and automation questions and logical questions and SQL from joins
Add your answer
Q2. What is black box testing What is difference between sanity and smoke testing What is difference between sanity and regression testing Joins from SQL Impact areas from regression Test case Logical question...read more
Ans. 
Black box testing is a software testing technique where the internal structure of the system being tested is not known to the tester.
• Black box testing focuses on the functionality of the software without considering its internal implementation

• Test cases are designed based on the requirements and specifications of the software

• It is primarily used to validate the correctness of the software from the end-user perspective

• E...read more
Answered by AI
Add your answer