Filter interviews by
I applied via Campus Placement and was interviewed before Nov 2023. There was 1 interview round.
I applied via Naukri.com and was interviewed in Nov 2022. There were 3 interview rounds.
Developed a groundbreaking software that increased productivity by 50%
Developed a software that automated manual processes
Implemented new algorithms that improved efficiency
Collaborated with cross-functional teams to ensure successful implementation
Received recognition from industry experts for innovation
Top trending discussions
I applied via Approached by Company and was interviewed before Oct 2022. There were 3 interview rounds.
Website scanning of the competitor's website and finding out what improvements, we can make to our website.
I applied via Company Website and was interviewed in Sep 2021. There were 3 interview rounds.
I applied via Walk-in and was interviewed before Aug 2021. There were 2 interview rounds.
Basic of diploma syllabus and General knowledge and letters.
posted on 2 May 2022
I applied via Company Website and was interviewed before May 2021. There were 2 interview rounds.
I applied via Approached by Company and was interviewed in Sep 2022. There were 3 interview rounds.
I applied via Referral and was interviewed before Feb 2021. There was 1 interview round.
Line balancing is the process of optimizing workstations in a production line to minimize idle time and maximize efficiency.
It involves analyzing the production process and identifying bottlenecks
Tasks are then rearranged to balance the workload across workstations
The goal is to achieve a smooth and continuous flow of work
Example: In a car assembly line, line balancing would involve ensuring that each workstation has a...
Reverse a linked list
Iterative approach: Traverse the list and change the pointers to reverse the list
Recursive approach: Recursively reverse the rest of the list and change the pointers
Use a stack to push all the nodes and then pop them to create a reversed list
Stack is a data structure that follows Last In First Out (LIFO) principle.
Stack can be implemented using arrays or linked lists.
Push operation adds an element to the top of the stack.
Pop operation removes the top element from the stack.
Peek operation returns the top element without removing it.
Stack overflow occurs when the stack is full and push operation is performed.
Stack underflow occurs when the stack is empty and
Queues are a data structure that follows the FIFO principle.
Queues can be implemented using arrays or linked lists.
Enqueue adds an element to the end of the queue, while dequeue removes an element from the front.
Peek returns the element at the front of the queue without removing it.
Queues are used in scheduling, buffering, and breadth-first search algorithms.
based on 2 interviews
Interview experience
based on 107 reviews
Rating in categories
Senior Executive
780
salaries
| ₹3.6 L/yr - ₹10.3 L/yr |
Junior Manager
707
salaries
| ₹4.9 L/yr - ₹14.8 L/yr |
Executive
629
salaries
| ₹3.2 L/yr - ₹8.5 L/yr |
Assistant Manager
599
salaries
| ₹5.9 L/yr - ₹16.6 L/yr |
Diploma Trainee Engineer
340
salaries
| ₹2.5 L/yr - ₹5.8 L/yr |
Escorts Kubota Limited
Sonalika Tractors
Ola Electric Mobility
Force Motors