Filter interviews by
I applied via Campus Placement and was interviewed in Mar 2021. There were 4 interview rounds.
The four pillars of OOP are encapsulation, inheritance, polymorphism, and abstraction.
Encapsulation: bundling data and methods that work on that data within one unit, e.g. a class.
Inheritance: creating new classes from existing ones, inheriting their properties and methods.
Polymorphism: using a single interface to represent different types of objects, e.g. method overloading.
Abstraction: hiding implementation details a...
Top trending discussions
posted on 18 Jan 2025
I applied via Company Website and was interviewed in Jul 2024. There were 2 interview rounds.
Aptitude level is easy to medium
I applied via Company Website and was interviewed before Mar 2023. There was 1 interview round.
I applied via Walk-in and was interviewed in Jul 2022. There were 2 interview rounds.
posted on 18 Jan 2025
I applied via Company Website and was interviewed in Jul 2024. There were 2 interview rounds.
This round is classified as easy to medium.
Current flows in a semiconductor due to the movement of charge carriers, either electrons or holes.
Current flows in a semiconductor when charge carriers (electrons or holes) move under the influence of an applied electric field.
In an n-type semiconductor, current is carried by electrons, while in a p-type semiconductor, current is carried by holes.
The flow of current can be controlled by applying a voltage across the s...
I applied via Referral and was interviewed in Apr 2024. There were 2 interview rounds.
Running stream median, priority queue, binary search, dp basic
A cycle in a linked list occurs when a node points to a previous node in the list, creating a loop.
Check for a cycle using two pointers - one moving one node at a time and the other moving two nodes at a time.
If the two pointers meet at any point, there is a cycle in the linked list.
Example: 1 -> 2 -> 3 -> 4 -> 2 (points back to 2), this linked list has a cycle.
Construct a tree from pre and post order traversal arrays.
Start by creating a root node using the first element of the pre-order array.
Find the index of the root node in the post-order array to divide it into left and right subtrees.
Recursively build the left and right subtrees.
Repeat the process for each subtree until the tree is fully constructed.
30 min pof test of verbal, reasoning
5 coding questions with medium to tough difficult level
Vlsi Engineer
23
salaries
| ₹3 L/yr - ₹6.8 L/yr |
Amts
11
salaries
| ₹3 L/yr - ₹9.8 L/yr |
Software Developer
6
salaries
| ₹3 L/yr - ₹7.1 L/yr |
Physical Design Engineer
6
salaries
| ₹5 L/yr - ₹9.2 L/yr |
Memory Circuit Design Engineer
5
salaries
| ₹4.5 L/yr - ₹10.7 L/yr |
Innovace Technology Solutions
Gigabyte Technology (India) Pvt. Ltd.
Tata Electronics
Intel