Filter interviews by
I applied via Indeed and was interviewed in Mar 2024. There was 1 interview round.
Tendering is the process of inviting bids from suppliers to provide goods or services at a specified price.
Tendering involves issuing a formal request for proposals or quotes
It is commonly used in government procurement and construction projects
The goal of tendering is to select the best supplier based on price, quality, and other factors
Assigning tenders to the best suitable contractor involves evaluating contractor qualifications, experience, pricing, and past performance.
Evaluate contractor qualifications such as licenses, certifications, and expertise in relevant areas.
Consider contractor experience in similar projects or industries.
Review pricing proposals to ensure they are competitive and within budget.
Assess contractor's past performance throug...
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
Assistant Manager
20
salaries
| ₹0 L/yr - ₹0 L/yr |
Senior Executive
14
salaries
| ₹0 L/yr - ₹0 L/yr |
Deputy Manager
8
salaries
| ₹0 L/yr - ₹0 L/yr |
Executive
7
salaries
| ₹0 L/yr - ₹0 L/yr |
Junior Executive
6
salaries
| ₹0 L/yr - ₹0 L/yr |
Volvo Buses
Scania
TCS
Accenture