Bangalore Aircraft Industries Interview Questions and Answers

Q1. Tell me about a time you solved a problem
Add your answer
Q2. What is your favorite class youve taken so far?
Add your answer

Q1. What is your weakness?
Add your answer

Q1. What is the internal implementation of Hashing and what is collision?
Ans. 
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.
Answered by AI
Add your answer
Q2. Is time complexity of HashMap always O(1) ?
Ans. 
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.
Answered by AI
Add your answer

Q1. Yet to have the interview. Ambition box is forcefully making me enter these details
Add your answer

Q1. Common technical questions
Add your answer

Q1. Advance Technical Questions based on your skill set taken by architect
Add your answer

Common coding problems difficulty laver moderate

Q1. Common managerial question ,scenario base questions
Add your answer