INCREFF Quality Assurance Interview Questions and Answers

Q1. About work background
Add your answer

Case study for understanding your analytical accumen

Q1. Why do you want to join?
View 1 more answer

Aptitude test such as profit and loss , blood relations

Questions on string and map

Q1. Questions like will you be able to work after your assigned time
Add your answer

The aptitude test was in online mode. There were 20 mcq questions and 5 coding questions ranging from easy to hard

After the Aptitude test, the gd was kept in offline mode ( at office ), the topic was "the pros and cons of online classes

Q1. In the 1st technical round, basic questions regarding the languages which i have mentioned in resume was asked. I mentioned python and C in my resume and a coding problem was asked to solve and to further ...read more
Add your answer

Q1. In the second technical OOPS concepts and DSA questions were asked
Add your answer

Q1. How dis you tackle the one incident where you disagree with the team lead approach?
Add your answer
Q2. How do you make sure to deliver on time when there are uncertainty?
Ans. 
To deliver on time despite uncertainty, I prioritize tasks, communicate effectively, set realistic deadlines, and have contingency plans.
• Prioritize tasks based on importance and impact on project timeline

• Communicate effectively with team members and stakeholders to address any uncertainties or roadblocks

• Set realistic deadlines taking into account potential delays or uncertainties

• Have contingency plans in place to mitig...read more
Answered by AI
Add your answer

Q1. Find duplicates in an array
Ans. 
Use a hash set to find duplicates in an array of strings.
• Create a hash set to store unique elements.

• Iterate through the array and check if the element is already in the hash set.

• If it is, then it is a duplicate. If not, add it to the hash set.
Answered by AI
Add your answer
Q2. Find single duplicate element in an array where contents of the array are length of array - 1
Ans. 
Find the single duplicate element in an array of strings with length n-1.
• Iterate through the array and use a HashSet to keep track of elements seen so far.

• If an element is already in the HashSet, that is the duplicate element.

• Return the duplicate element once found.
Answered by AI
Add your answer

Create a student support system

Q1. Design an order and payments system for an EdTech company
Ans. 
Design an order and payments system for an EdTech company
• Allow users to browse and select courses

• Implement a shopping cart for users to add courses

• Integrate payment gateways for secure transactions

• Provide order confirmation and receipt to users

• Allow users to track their order status
Answered by AI
Add your answer

Q1. About Myself in details
Add your answer
Q2. Past internships and work experiences
Add your answer

Q1. Primary keys, Unique key
Add your answer
Q2. Usage advantages and disadvantages of Indexing
Add your answer

SQL- 1 departments with no users
2 dept_id and their respective no. of users

DSA1: Most frequent no. in an array
DSA2: Zero Sum subarray exists

Computer Fundamentals

Q1. Flatten a binary tree
Ans. 
Flatten a binary tree by converting it into a linked list in-place.
• Use a recursive approach to flatten the binary tree.

• Traverse the tree in a pre-order manner and keep track of the previous node.

• Set the left child of each node to null and the right child to the next node in the linked list.

• Example: Input: 1 -> 2 -> 5 -> 3 -> 4 -> null, Output: 1 -> null -> 2 -> null -> 3 -> null -> 4 -> null -> 5 -> null
Answered by AI
Add your answer

Basic questions of dbms ,os

Q1. Delete middle node of linked list
Ans. 
To delete the middle node of a linked list, we can iterate through the list to find the middle node and then remove it by adjusting the pointers.
• Iterate through the linked list to find the middle node by using two pointers - one moving one node at a time and the other moving two nodes at a time.

• Once the middle node is found, adjust the pointers to skip over the middle node and connect the nodes before and after it.

• Hand...read more
Answered by AI
Add your answer
Q2. N queen problem
Add your answer