Bounteous x Accolite Accountant Interview Questions and Answers

All Logical questions plus coding

Q1. Whats your Relevant exp
Add your answer
Q2. Whats your Job role with previous
Add your answer

Digital india movment

General aptitude test

Q1. Second round was technical round
Add your answer

Q1. In this round some coding questions and logical questions was asked
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

Q1. As per your skills, excel, power BI
Add your answer
Q2. Communication , speed writing
Add your answer

Q1. Service desk parameter
Add your answer
Q2. Troubleshooting and call handling
Add your answer

Q1. SQL Windows functions based questions
Add your answer
Q2. Detail explanation of one project which handled previously
Ans. 
Developed a data analysis tool for tracking customer behavior
• Created a database to store customer data

• Designed algorithms to analyze customer interactions with the website

• Generated reports to identify trends and patterns in customer behavior
Answered by AI
Add your answer

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.