Filter interviews by
Top trending discussions
I applied via Naukri.com and was interviewed in Jun 2019. There were 3 interview rounds.
Why-Why analysis is a problem-solving technique used to identify the root cause of a problem by repeatedly asking 'why' until the underlying cause is determined.
Why-Why analysis is also known as the 5 Whys technique.
It helps to uncover the underlying causes of a problem rather than just addressing the symptoms.
The technique involves asking 'why' multiple times to dig deeper into the problem.
Each 'why' question leads to...
5s is a workplace organization method that aims to improve efficiency and productivity by organizing and standardizing the workplace.
Sort - separate necessary items from unnecessary ones
Set in order - arrange necessary items in a logical manner
Shine - clean and inspect the workplace regularly
Standardize - establish procedures and guidelines for maintaining the workplace
Sustain - maintain the 5s system through continuou...
I applied via Campus Placement and was interviewed before Apr 2019. There was 1 interview round.
posted on 12 Oct 2022
Normal questions of aptitude was asked
Coding questions in Java was asked
I was interviewed before May 2023.
I was interviewed before Mar 2023.
Transformers are electrical devices that transfer energy between two or more circuits through electromagnetic induction.
Transformers work on the principle of electromagnetic induction
They consist of primary and secondary coils wrapped around a core
Step-up transformers increase voltage while step-down transformers decrease voltage
Efficiency of transformers is determined by the ratio of output power to input power
I applied via Walk-in and was interviewed in May 2024. There was 1 interview round.
I applied via Company Website and was interviewed in Jul 2021. There were 3 interview rounds.
I applied via Campus Placement and was interviewed in Jul 2024. There were 2 interview rounds.
They asked to find the elements which are present more than once. I solved it using map in c++
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
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...
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
I was interviewed before Feb 2024.
based on 1 interview
Interview experience
Area Sales Manager
166
salaries
| ₹0 L/yr - ₹0 L/yr |
Sales Executive
139
salaries
| ₹0 L/yr - ₹0 L/yr |
Senior Sales Executive
102
salaries
| ₹0 L/yr - ₹0 L/yr |
Assistant Manager
68
salaries
| ₹0 L/yr - ₹0 L/yr |
Senior Executive
61
salaries
| ₹0 L/yr - ₹0 L/yr |
Finolex Cables
Polycab Wires
Havells
KEI Industries