Lifelong India Test Engineer Interview Questions and Answers

Google forms CS subjects 60 Mcqs

Q1. Basic question on Java,oops,code output prediction.
Add your answer

Q1. My job profile is refrigeration and air conditioning
Add your answer
Q2. I'm work in fmi compeny in maintenance utility department
Add your answer
Q3. Computer basik knowladge
Add your answer

Q1. What are your basic R&R?
Add your answer

Q1. What do you do when lot is NG & urgent for use?
Ans. 
I will immediately investigate the cause of the NG lot and work with the team to find a solution to make it usable.
• Investigate the cause of the NG lot

• Work with the team to find a solution

• Prioritize urgent use of the lot

• Ensure quality control measures are in place

• Communicate with stakeholders about the situation
Answered by AI
Add your answer

Q1. Why you wamt to leave current company & city?
Add your answer

Q1. All questions are related to the fieldwork.
Add your answer

Q1. Discuss about the previous company and their working projects, CTC and working cultures etc.
Add your answer

Q1. String reversal , Data structures
Add your answer

Q1. Interview with Architect , mostly technical and logical reasoning.
Add your answer

Q1. Situation based question like how to handle a situation when you are overloaded. personal info and what made you apply for this role.
Add your answer

There was 10 MCQ on general aptitude and english and 2 coding questions easy to medium level

Q1. 1)Reverse Linked List 2)Deep aboit project
Add your answer

Q1. All about project and some technical question like what is API, Flow diagram of API etc
Add your answer

Q1. 1) Intro 2) Hobbies 3) 5 strength and weakness
Add your answer

They asked to find the elements which are present more than once. I solved it using map in c++

Q1. Explain about your favorite algorithm
Ans. 
My favorite algorithm is Dijkstra's algorithm for finding the shortest path in a graph.
• Dijkstra's algorithm is a greedy algorithm that finds the shortest path between nodes in a graph.

• It works by maintaining a priority queue of nodes to visit next, updating the shortest distance to each node as it explores the graph.

• The algorithm is commonly used in routing and network optimization.

• Example: Finding the shortest route b
Answered by AI
Add your answer
Q2. Tell about different types of deadlocks
Ans. 
Deadlocks occur when two or more processes are unable to proceed because each is waiting for the other to release a resource.
• Resource deadlocks: Processes hold resources and wait for others to release resources. Example: Process A holds resource X and waits for resource Y, while Process B holds resource Y and waits for resource X.

• Communication deadlocks: Processes wait for messages from each other indefinitely. Example...read more
Answered by AI
Add your answer
Q3. Tell about you project.
Ans. 
Developed a web application for online shopping with user authentication and payment gateway integration.
• Implemented user authentication using JWT tokens

• Integrated Stripe API for payment processing

• Designed responsive UI using React and Bootstrap
Answered by AI
Add your answer