i
Sedemac Mechatronics
Filter interviews by
I applied via Recruitment Consulltant and was interviewed before Sep 2023. There was 1 interview round.
Top trending discussions
I applied via Naukri.com and was interviewed in Jul 2020. There were 4 interview rounds.
Flip-flops and latches are sequential logic circuits used to store and manipulate binary data.
Flip-flops are edge-triggered devices, while latches are level-sensitive devices.
Flip-flops have separate clock and data inputs, while latches have a single input for both clock and data.
Flip-flops are used in synchronous circuits, while latches are used in asynchronous circuits.
Flip-flops are more complex and require more cir...
I applied via Referral and was interviewed before Jun 2023. There were 2 interview rounds.
Matrix and logical assigment questions
Coding question on DSA
Carbon footprint and ways to achieve
1. which data structure is used to create an editor?
posted on 22 Sep 2022
Java Programing Round
I applied via Instahyre and was interviewed before Mar 2023. There were 2 interview rounds.
Data Structures and Algorithm
I applied via LinkedIn and was interviewed in Sep 2023. There were 3 interview rounds.
1. Search in a row and column wise sorted matrix
Localstorage stores data with no expiration date, while session storage stores data for one session only.
Localstorage data persists even after the browser is closed, while session storage data is cleared when the session ends.
Localstorage has a larger storage capacity compared to session storage.
Localstorage data is accessible across different tabs and windows of the same browser, while session storage data is limited ...
posted on 25 Aug 2022
I applied via Campus Placement and was interviewed before Aug 2021. There were 4 interview rounds.
Duration: 1hr
Topics: Array, LinkedList,Stack
Code for insertion in a binary tree
Create a new node with the given data
If the tree is empty, make the new node as root
Else, traverse the tree to find the appropriate position to insert the new node
If the data is less than the current node, go to the left subtree
If the data is greater than the current node, go to the right subtree
Repeat until an appropriate position is found
Set the new node as the child of the appropri
Quick sort is a divide-and-conquer algorithm that sorts an array by partitioning it into two sub-arrays.
Choose a pivot element from the array
Partition the array around the pivot element
Recursively apply quick sort to the left and right sub-arrays
Combine the sorted sub-arrays to get the final sorted array
posted on 5 Oct 2023
I applied via Referral and was interviewed before Oct 2022. There were 3 interview rounds.
Simple coding questions in your preferred language
posted on 25 Oct 2024
I appeared for an interview before Oct 2023.
It was easy round with 2 questions from hacker rank
based on 1 interview
Interview experience
based on 1 review
Rating in categories
Test Engineer
67
salaries
| ₹1.8 L/yr - ₹4.5 L/yr |
Production Engineer
47
salaries
| ₹1.2 L/yr - ₹4.6 L/yr |
Quality Engineer
37
salaries
| ₹1.5 L/yr - ₹4 L/yr |
Engineer
23
salaries
| ₹2.5 L/yr - ₹7.7 L/yr |
Lead Engineer
20
salaries
| ₹12 L/yr - ₹22 L/yr |
Innovatiview India Ltd
Watchyourhealth.com
Zeta
Shorthills AI