AiRo Digital Labs Major Incident Manager Interview Questions and Answers

A technical test for whatever technical round you are applying for. Will be conceptual test rather than hard/coded test

Q1. For almost 1.5 hrs where technical questions being asked. level is easy to medium but mainly they focus on how fast are you while you stuck in a problem and your concepts
Add your answer
Q2. How can you derive (%share) in power bi
Ans. 
To derive % share in Power BI, use the 'Group By' function and create a measure using the 'Divide' function.
• Use the 'Group By' function to group the data by the desired category

• Create a measure using the 'Divide' function to calculate the percentage share

• Add the measure to a visual to display the % share

• Example: = DIVIDE(SUM(Sales[Revenue]), CALCULATE(SUM(Sales[Revenue]), ALL(Sales)))
Answered by AI
Add your answer

Q1. This was with the Project Manager to see how well you can provide solutions and interact with client.
Add your answer

Q1. Salary discussion and all
Add your answer

Q1. When do you prefer Decision Tree better than Random Forest model if model outputs are similar
Ans. 
Decision Tree is preferred over Random Forest when interpretability is important.
• Decision Tree is easier to interpret and visualize than Random Forest.

• Decision Tree is better suited for small datasets with few features.

• Random Forest is better suited for large datasets with many features.

• Random Forest is less prone to overfitting than Decision Tree.

• Decision Tree can be used as a building block for Random Forest.

• If inter...read more
Answered by AI
Add your answer

Q1. Why do you want to work here
Add your answer

Duration: 1hr
Topics: Array, LinkedList,Stack

Q1. Write code for Insertion in a binary tree.
Ans. 
Code for insertion in a binary tree
• Create a new node with the given data

• If the tree is empty, make the new node as root

• Else, traverse the tree to find the appropriate position to insert the new node

• If the data is less than the current node, go to the left subtree

• If the data is greater than the current node, go to the right subtree

• Repeat until an appropriate position is found

• Set the new node as the child of the appropri
Answered by AI
Add your answer
Q2. Write code for quick sort
Ans. 
Quick sort is a divide-and-conquer algorithm that sorts an array by partitioning it into two sub-arrays.
• Choose a pivot element from the array

• Partition the array around the pivot element

• Recursively apply quick sort to the left and right sub-arrays

• Combine the sorted sub-arrays to get the final sorted array
Answered by AI
Add your answer

Q1. Various DBMS related question(JOINS, SORT, LIMIT)
Add your answer

Q1. Tell us about yourself.
Add your answer
Q2. Why do want to join the company
Add your answer

Q1. Based on your previous experience
Add your answer

Simple coding questions in your preferred language