i
Confidential Company
Filter interviews by
I applied via LinkedIn and was interviewed before Apr 2023. There was 1 interview round.
To extend the range of a wireless system, you can use repeaters, antennas, or power amplifiers.
Use repeaters to amplify and retransmit the signal over longer distances
Upgrade antennas to higher gain models for increased coverage
Utilize power amplifiers to boost the signal strength
Implement mesh networking to create a network of interconnected devices that can relay signals
Bitwise operations and pointers are commonly used in C programming for efficient memory management and manipulation.
Bitwise operations can be used to manipulate individual bits in a variable.
Pointers are variables that store memory addresses of other variables.
Combining bitwise operations with pointers can be useful for tasks like bit manipulation in memory.
Example: Using bitwise AND operator (&) to check if a specific
I applied via Walk-in and was interviewed before Dec 2021. There were 3 interview rounds.
The planning if the project and how to take over the project
We should maintain the aptitude to with our project and with with
I applied via Approached by Company and was interviewed before Oct 2021. There were 2 interview rounds.
I have X years of domain experience.
I have worked in this domain for X years.
During my time in this domain, I have gained expertise in various areas such as...
I have worked on projects related to...
I have experience working with clients in this domain.
I keep myself updated with the latest trends and developments in this domain.
I applied via Naukri.com and was interviewed before Sep 2020. There were 5 interview rounds.
I applied via Referral and was interviewed in Sep 2020. There was 1 interview round.
I applied via Recruitment Consultant and was interviewed in Oct 2020. There were 6 interview rounds.
I applied via Company Website and was interviewed in Dec 2020. There were 3 interview rounds.
I applied via Naukri.com and was interviewed in Aug 2020. There were 3 interview rounds.
Hashmap is key-value pair collection while Hashset is a unique value collection.
Hashmap allows duplicate values but not duplicate keys while Hashset only allows unique values.
Hashmap uses key to access values while Hashset uses object reference.
Hashmap is faster for accessing values while Hashset is faster for checking if a value exists.
Example: Hashmap - {1: 'apple', 2: 'banana', 3: 'apple'}, Hashset - {'apple', 'bana
Hashmap is a data structure that stores key-value pairs and uses hashing to locate values based on their keys.
Hashmap uses an array to store the key-value pairs
The key is hashed to generate an index in the array
If multiple keys hash to the same index, a linked list is used to store them
Hashmap provides constant time complexity for insertion, deletion, and retrieval of values
Java's HashMap class is an implementation of
based on 1 interview
Interview experience
TCS
Infosys
Wipro
HCLTech