i
Innovaccer
Filter interviews by
I applied via Company Website and was interviewed in Nov 2024. There was 1 interview round.
Test cases for login page functionality
Verify valid username and password combination successfully logs in
Verify error message is displayed for invalid username or password
Verify 'Forgot Password' link redirects to password reset page
Verify 'Create Account' link redirects to registration page
The question is asking for code on a website.
Check the website's source code for any embedded scripts or code snippets
Look for any external scripts or libraries being used on the website
Inspect the network requests to see if any code is being loaded dynamically
I applied via Referral and was interviewed in Aug 2023. There were 8 interview rounds.
A coding round in hackerRank where, I got some aptitude and technical questions and two coding questions i solved one and half. One easy and one medium level.
There was again a coding test with only two questions of coding in hackerRank platform.
I applied via Naukri.com and was interviewed in Apr 2020. There were 5 interview rounds.
I applied via Naukri.com and was interviewed in Nov 2020. There was 1 interview round.
Statistics is the study of collecting, analyzing, and interpreting data.
Descriptive statistics summarize and describe data
Inferential statistics make predictions and draw conclusions about a population based on a sample
Hypothesis testing is used to determine if there is a significant difference between groups
Regression analysis is used to model the relationship between variables
Probability theory is used to quantify un...
posted on 9 Sep 2020
I applied via Naukri.com and was interviewed in Aug 2020. There were 4 interview rounds.
I appeared for an interview before Apr 2021.
Round duration - 40 minutes
Round difficulty - Medium
The test has 3 sections :
1. Quantitative contains 20 questions. These questions are easy to me. If u practice quant, you can easily solve it.
2. Technical contains 20 questions. Some questions are on C , C++ , java outputs. Remaining are based on DSA. If u Know all the time complexities of algorithms then it is easy . In technical they gave one DSA problem.
3. Essay: They have given one picture and then asked to write an essay by seeing the picture.
Given an undirected graph with 'V' vertices labeled from 0 to V-1 and 'E' edges. Each edge has a weight that represents the distance between two nodes 'X' and 'Y'.
...
Dijkstra's algorithm is used to find the shortest path distances from a source node to all other vertices in a graph.
Dijkstra's algorithm is a greedy algorithm that finds the shortest path from a source node to all other nodes in a graph.
It uses a priority queue to select the node with the smallest distance and relaxes its neighbors.
The algorithm maintains a distance array to keep track of the shortest distances from t...
Round duration - 60 minutes
Round difficulty - Easy
3 persons are there in panel. They are asking questions on basic concepts in subjects and some advanced concepts.
A daemon process is a background process that runs continuously to perform system tasks.
Daemon processes do not have a controlling terminal.
They typically run in the background and perform tasks such as managing hardware devices, network services, or system maintenance.
Examples of daemon processes include cron, sshd, and apache.
Daemon processes are often started during system boot and run until the system is shut down.
System calls provide a way for user-level processes to interact with the operating system kernel.
System calls allow user programs to request services from the operating system.
They provide a secure and controlled way for applications to access system resources.
System calls enable processes to perform tasks such as file operations, network communication, and process management.
Examples of system calls include open(), re
The select() system call is used in Unix-like operating systems to monitor multiple file descriptors for activity.
select() allows a program to wait for multiple I/O operations to complete on multiple file descriptors.
It takes three sets of file descriptors as arguments - readfds, writefds, and errorfds.
The function will block until an activity is detected on one of the file descriptors or until a timeout occurs.
select(...
Tip 1 : Must do Previously asked Interview as well as Online Test Questions.
Tip 2 : Go through all the previous interview experiences from Codestudio and Leetcode.
Tip 3 : Do at-least 2 good projects and you must know every bit of them.
Tip 1 : Have at-least 2 good projects explained in short with all important points covered.
Tip 2 : Every skill must be mentioned.
Tip 3 : Focus on skills, projects and experiences more.
based on 1 interview
Interview experience
based on 1 review
Rating in categories
Data Analyst
337
salaries
| ₹5 L/yr - ₹17 L/yr |
Senior Data Analyst
177
salaries
| ₹8.1 L/yr - ₹24 L/yr |
Associate Software Engineer
105
salaries
| ₹6 L/yr - ₹10 L/yr |
Software Development Engineer II
68
salaries
| ₹16 L/yr - ₹34 L/yr |
Data Engineer
65
salaries
| ₹5.1 L/yr - ₹16 L/yr |
Intellect Design Arena
Thomson Reuters
Oracle Cerner
NextComm Corporation