3i Infotech Data Science Intern Interview Questions and Answers for Freshers

It was not good, it contain mostly question of java programming.

Q1. Print factorial of n through recursion Sum of all n numbers
Ans. 
Factorial of n and sum of n numbers using recursion
• Create a recursive function to calculate factorial of n

• Use a recursive function to calculate the sum of all n numbers

• Handle base cases for both factorial and sum calculations

• Example: Factorial of 5 = 5 * 4 * 3 * 2 * 1 = 120, Sum of first 5 numbers = 1 + 2 + 3 + 4 + 5 = 15
Answered by AI
Add your answer

Q1. Oops concepts and data structures
Add your answer
Q2. Dbms questions where based on normalization
Add your answer

Two questions were asked and answered both

Two programs on Java was asked on loops and collections

Q1. Core python,python library and data science
Add your answer

Q1. Mathematics,python and sql and data science are complete
Add your answer

Q1. Explain random forest
Ans. 
Random forest is an ensemble learning method that builds multiple decision trees and merges them to improve accuracy and prevent overfitting.
• Random forest is a type of ensemble learning method.

• It builds multiple decision trees during training.

• Each tree is built using a subset of the training data and a random subset of features.

• The final prediction is made by averaging the predictions of all the individual trees.

• Random...read more
Answered by AI
Add your answer
Q2. What is boosting
Ans. 
Boosting is a machine learning ensemble technique where multiple weak learners are combined to create a strong learner.
• Boosting is an iterative process where each weak learner is trained based on the errors of the previous learners.

• Examples of boosting algorithms include AdaBoost, Gradient Boosting, and XGBoost.

• Boosting is used to improve the accuracy of models and reduce bias and variance.
Answered by AI
Add your answer

Provided sales case study, asked to analyse the same ans provide insights

Some mcq questions and coding question. Both where easy to medium level. Prepare combination/permutation/Time complexity etc

A question related to Binary search and some other follow ups.

Q1. OOPS concept Java fundamentals
Add your answer

Q1. Project work framework Rest Assured
Add your answer