i
Filter interviews by
A decision tree is a flowchart-like structure where each internal node represents a feature, each branch represents a decision, and each leaf node represents an outcome.
Decision trees are a popular machine learning algorithm used for classification and regression tasks.
They are easy to interpret and visualize, making them useful for understanding the decision-making process.
Decision trees work by recursively splitting ...
Boosting is a machine learning ensemble technique that combines multiple weak learners to create a strong learner.
Boosting iteratively improves the performance of a model by focusing on the mistakes made by previous models.
Popular boosting algorithms include AdaBoost, Gradient Boosting, and XGBoost.
Boosting is often used in classification and regression problems to improve accuracy and reduce bias.
I applied via Referral and was interviewed before Jun 2023. There were 2 interview rounds.
Top trending discussions
I appeared for an interview in Feb 2024.
PCA stands for Principal Component Analysis. It is a dimensionality reduction technique used to reduce the number of variables in a dataset while preserving the most important information.
PCA is used to transform high-dimensional data into a lower-dimensional space by finding the principal components that explain the maximum variance in the data.
The first principal component is the direction in which the data varies th...
Python code to sort elements in an array of strings
Use the sorted() function to sort the elements in the array
Specify the key parameter if you want to sort based on a specific criteria
Use the reverse parameter to sort in descending order if needed
I applied via Recruitment Consulltant and was interviewed in Aug 2024. There was 1 interview round.
Basic Coding round and understanding of candidate's previous work experience. Questions on ML orchestrators.
I applied via Referral and was interviewed in May 2021. There was 1 interview round.
I applied via Recruitment Consultant and was interviewed in Oct 2020. There were 6 interview rounds.
I applied via Naukri.com and was interviewed before Mar 2020. There were 4 interview rounds.
Hashtable is synchronized while hashmap is not.
Hashtable is thread-safe while hashmap is not.
Hashtable does not allow null keys or values while hashmap allows one null key and multiple null values.
Hashtable is slower than hashmap due to synchronization.
Hashtable is a legacy class while hashmap is a newer implementation.
Hashmap is not thread-safe while Concurrent Hashmap is thread-safe.
Hashmap is not suitable for multi-threaded environments as it can lead to race conditions and data inconsistencies.
Concurrent Hashmap allows multiple threads to access and modify the map concurrently without any data inconsistencies.
Concurrent Hashmap uses a technique called lock striping to achieve thread-safety.
Concurrent Hashmap is slower than Hashma...
I appeared for an interview before Nov 2020.
based on 2 interviews
Interview experience
based on 7 reviews
Rating in categories
Data Engineer
454
salaries
| ₹5.3 L/yr - ₹17.2 L/yr |
Senior Data Engineer
432
salaries
| ₹8 L/yr - ₹31 L/yr |
Senior Business Analyst
345
salaries
| ₹8 L/yr - ₹25 L/yr |
Business Analyst
338
salaries
| ₹6.1 L/yr - ₹14 L/yr |
Machine Learning Engineer
330
salaries
| ₹5 L/yr - ₹16 L/yr |
ITC Infotech
CMS IT Services
KocharTech
3i Infotech