Filter interviews by
Clear (1)
I was interviewed before Jun 2016.
Top trending discussions
Aptitude test and Communication Engineering
I applied via Company Website and was interviewed in Jan 2024. There were 2 interview rounds.
I applied via Approached by Company and was interviewed in May 2022. There were 5 interview rounds.
I applied via Naukri.com and was interviewed in May 2021. There were 3 interview rounds.
I applied via Company Website and was interviewed in Oct 2021. There were 4 interview rounds.
I was interviewed before Feb 2023.
Practice on hackerrank, they send hackerrank link for screening round.
I applied via Referral and was interviewed in Sep 2023. There were 4 interview rounds.
The length of the longest common subsequence in given strings is found using dynamic programming.
Use dynamic programming to find the length of the longest common subsequence.
Compare characters of the strings and build a matrix to store the lengths of common subsequences.
Traverse the matrix to find the length of the longest common subsequence.
Write the algorithm for topological sorting.
CAP theorem states that in a distributed system, it is impossible to simultaneously guarantee consistency, availability, and partition tolerance.
Consistency: All nodes in the system have the same data at the same time.
Availability: Every request gets a response, even if some nodes are down.
Partition Tolerance: The system continues to operate despite network partitions.
In a distributed system, you can only achieve two o...
VLSI design cycle is the process of creating integrated circuits by going through various stages from design to fabrication.
VLSI design cycle involves stages like specification, design, verification, synthesis, and fabrication.
It starts with defining the requirements and specifications of the integrated circuit.
Design phase includes logic design, circuit design, and physical design.
Verification ensures that the design ...
I applied via Naukri.com and was interviewed in Apr 2024. There was 1 interview round.
To detect and remove a loop in a linked list, we can use Floyd's Cycle Detection Algorithm.
Use two pointers, slow and fast, to traverse the linked list
If there is a loop, the fast pointer will eventually meet the slow pointer
Once the loop is detected, reset one of the pointers to the head and move both pointers at the same pace until they meet again to find the start of the loop
Software Engineer
134
salaries
| ₹0 L/yr - ₹0 L/yr |
Design Engineer
96
salaries
| ₹0 L/yr - ₹0 L/yr |
Senior Software Engineer
73
salaries
| ₹0 L/yr - ₹0 L/yr |
Lead Engineer
48
salaries
| ₹0 L/yr - ₹0 L/yr |
Senior Design Engineer
41
salaries
| ₹0 L/yr - ₹0 L/yr |
Texas Instruments
Analog Devices
Microchip Technology
STMicroelectronics