Filter interviews by
I applied via Company Website and was interviewed before Sep 2021. There were 2 interview rounds.
The number of bits transferred for a given baud rate depends on the duration of each bit.
Baud rate is the number of signal changes per second
The duration of each bit is the reciprocal of the baud rate
Higher baud rates transfer more bits per second
Top trending discussions
posted on 5 Jan 2025
I applied via Naukri.com and was interviewed in Dec 2024. There were 2 interview rounds.
posted on 7 Jan 2025
Group discussion (GD) involves addressing a specific problem or situation collaboratively through discussion and problem-solving.
Group discussion (GD) entails tackling a specific issue or topic collaboratively.
My attitude is typical.
My CV is attached for your review.
I applied via Campus Placement and was interviewed in Dec 2024. There were 3 interview rounds.
I am ECE students, Analog and Digital, basic aptitude and some control system questions
posted on 1 Dec 2024
I applied via Walk-in and was interviewed in Nov 2024. There were 2 interview rounds.
Folks,
Prepare the below topics very well.
1. Engineering mechanics
2. GD and T
3. Strength of materials
4. Manufacturing process
5. Tolerance stack up analysis
6. Engineering drawing
I had prepared them but still unable to clear the paper cause questions were tricky enough to answer.
I hope this helps you better for practice.
All the best “Brothers, Sister and Friends”.
I applied via Job Fair and was interviewed in Dec 2024. There was 1 interview round.
posted on 12 Jan 2025
I applied via Company Website and was interviewed in Aug 2024. There were 3 interview rounds.
Hashing is a technique used to map data to a fixed-size array, collision occurs when two different inputs produce the same hash value.
Hashing involves using a hash function to map data to a fixed-size array.
Collision happens when two different inputs produce the same hash value.
Common techniques to handle collisions include chaining and open addressing.
No, time complexity of HashMap is not always O(1).
Time complexity of HashMap is O(1) on average, but can degrade to O(n) in worst case scenarios.
Worst case scenarios include hash collisions, which can lead to linear probing and degrade performance.
Load factor and capacity of the HashMap can also affect time complexity.
In scenarios where many keys hash to the same index, the time complexity can degrade.
InterGlobe Aviation
Tata Advanced Systems
Hindustan Aeronautics
Serco