Upload Button Icon Add office photos

eClinicalWorks

Compare button icon Compare button icon Compare

Filter interviews by

eClinicalWorks Softwaretest Engineer Interview Questions, Process, and Tips

Updated 19 Jun 2024

eClinicalWorks Softwaretest Engineer Interview Experiences

1 interview found

Interview experience
4
Good
Difficulty level
-
Process Duration
-
Result
-
Round 1 - Technical 

(4 Questions)

  • Q1. What are fetaures of Java?
  • Ans. 

    Java is a popular programming language known for its platform independence, object-oriented features, and robust libraries.

    • Platform independence - Java programs can run on any platform that has a Java Virtual Machine (JVM)

    • Object-oriented - Java supports the principles of encapsulation, inheritance, and polymorphism

    • Robust libraries - Java has a vast collection of libraries for various tasks such as networking, database

  • Answered by AI
  • Q2. What is exception handling and why it is important?
  • Ans. 

    Exception handling is a mechanism to handle runtime errors in a program to prevent crashes and ensure graceful error recovery.

    • Allows for graceful handling of runtime errors

    • Prevents program crashes

    • Ensures proper error recovery

    • Helps in debugging and maintaining code

    • Examples: try-catch blocks in Java, catch blocks in C++

  • Answered by AI
  • Q3. What is inheritance?
  • Ans. 

    Inheritance is a concept in object-oriented programming where a class inherits attributes and methods from another class.

    • Allows a class to inherit attributes and methods from another class

    • Promotes code reusability and reduces redundancy

    • Creates a parent-child relationship between classes

    • Derived class can access public and protected members of the base class

    • Example: Class Car can inherit from class Vehicle to reuse commo

  • Answered by AI
  • Q4. What is abtract class?
  • Ans. 

    Abstract class is a class that cannot be instantiated and may contain abstract methods that must be implemented by subclasses.

    • Cannot be instantiated directly

    • May contain abstract methods

    • Subclasses must implement abstract methods

    • Used for defining common behavior for subclasses

  • Answered by AI
Round 2 - HR 

(2 Questions)

  • Q1. Why you want to join eClinicalWorks
  • Q2. Why we should hire you

Skills evaluated in this interview

Interview questions from similar companies

Interview experience
5
Excellent
Difficulty level
-
Process Duration
-
Result
-
Round 1 - Technical 

(2 Questions)

  • Q1. What is interrupt vector table
  • Ans. 

    Interrupt vector table is a data structure that maps interrupt numbers to their corresponding interrupt service routines.

    • It is used in microcontrollers and operating systems to handle interrupts.

    • Each entry in the table contains the address of the interrupt service routine for a specific interrupt.

    • When an interrupt occurs, the processor looks up the corresponding entry in the table to find the address of the ISR to exec...

  • Answered by AI
  • Q2. C program to pass array in function
  • Ans. 

    Passing array of strings in a C function

    • Declare the function prototype with array parameter

    • Pass the array as argument when calling the function

    • Access elements of the array within the function

    • Example: void printStrings(char *strings[], int size) { }

  • Answered by AI

Skills evaluated in this interview

Interview experience
1
Bad
Difficulty level
-
Process Duration
-
Result
-
Round 1 - Technical 

(2 Questions)

  • Q1. What is the importance of manual testing when compared to automation testing
  • Ans. 

    Manual testing is important for exploratory testing, usability testing, and ad-hoc testing.

    • Manual testing allows for exploratory testing where testers can explore the application and identify unexpected issues.

    • Usability testing, which involves real users interacting with the software, is best done manually to capture user experience.

    • Ad-hoc testing, where testers randomly test the application without predefined test cas...

  • Answered by AI
  • Q2. Real life scenario on web application testing
  • Ans. 

    Testing a web application for an online shopping platform

    • Testing the functionality of adding items to the cart and checking out

    • Testing the payment gateway integration for secure transactions

    • Testing the search functionality to ensure accurate results are displayed

    • Testing the responsiveness of the website on different devices and browsers

  • Answered by AI

Interview Preparation Tips

Interview preparation tips for other job seekers - If some one want to apply any of the job in this company then please do have some experience even though they mentioned for freshers bsc, however you do your interview as best as possible at last they gonna reject bsc of lack of experience. Same happened to me.So plzz only attened any Oracle company interview if you have experience.

Skills evaluated in this interview

Interview experience
4
Good
Difficulty level
Moderate
Process Duration
Less than 2 weeks
Result
Selected Selected

I applied via Recruitment Consulltant and was interviewed in Mar 2024. There was 1 interview round.

Round 1 - Technical 

(4 Questions)

  • Q1. Focus on coding, Question: find the duplicate string from list of string and the count of it(how many times it is repeated) Prepare oops and collections concepts.
  • Q2. Focus on method overriding
  • Q3. Difference between arraylist and LinkedInlist
  • Ans. 

    ArrayList is a resizable array implementation while LinkedList is a doubly linked list implementation.

    • ArrayList uses dynamic arrays to store elements, allowing fast random access but slower insertion and deletion.

    • LinkedList uses nodes with pointers to the next and previous elements, allowing fast insertion and deletion but slower random access.

    • Example: ArrayList - List names = new ArrayList<>(); LinkedList - List citie

  • Answered by AI
  • Q4. Use of static keyword
  • Ans. 

    The static keyword in programming is used to declare variables, methods, or classes that belong to the class itself rather than instances of the class.

    • Static variables are shared among all instances of a class.

    • Static methods can be called without creating an instance of the class.

    • Static classes cannot be instantiated and are used for grouping related methods and variables.

    • Example: public static int count = 0; // static

  • Answered by AI

Skills evaluated in this interview

Interview experience
4
Good
Difficulty level
-
Process Duration
-
Result
-
Round 1 - Technical 

(1 Question)

  • Q1. What is Regression Testing?
  • Ans. 

    Regression testing is the process of retesting a software application to ensure that new code changes have not adversely affected existing functionality.

    • Performed after code changes to ensure that existing features still work correctly

    • Helps in identifying and fixing any defects introduced by new code changes

    • Automated tools like Selenium can be used for regression testing

    • Examples: Testing a login feature after adding a

  • Answered by AI

Skills evaluated in this interview

Interview Questionnaire 

21 Questions

  • Q1. AVL tree balance checking
  • Q2. Median of 2 sorted arrays in O(log N) time complexity and O(1) space complexity
  • Ans. 

    Find median of 2 sorted arrays in O(log N) time complexity and O(1) space complexity

    • Use binary search to find the partition point in both arrays

    • Calculate the median based on the partition point and array sizes

    • Adjust the partition points based on the median value

    • Repeat until the partition points are at the median

    • Handle edge cases such as empty arrays and uneven array sizes

  • Answered by AI
  • Q3. Strings Anagram in O(1) space complexity
  • Ans. 

    Anagram of strings in O(1) space complexity

    • Use a fixed size array of integers to store the frequency of characters in the first string

    • Iterate through the second string and decrement the frequency of each character in the array

    • If all the frequencies are zero, then the strings are anagrams

    • Return true or false accordingly

  • Answered by AI
  • Q4. Level order traversal of a tree using Queue
  • Ans. 

    Level order traversal of a tree using Queue

    • Create a queue and add the root node to it

    • While the queue is not empty, remove the front node and print its value

    • Add the left and right child nodes of the removed node to the queue

    • Repeat until the queue is empty

  • Answered by AI
  • Q5. Reverse level order traversal of a tree using Queue
  • Ans. 

    Reverse level order traversal of a tree using Queue

    • Create a queue and push the root node into it

    • While the queue is not empty, pop the front node and push its children into the queue

    • Add the popped node to a stack

    • Once the queue is empty, pop elements from the stack and print them

  • Answered by AI
  • Q6. BFS and DFS Difference
  • Ans. 

    BFS and DFS are graph traversal algorithms. BFS explores nodes level by level while DFS explores nodes depth by depth.

    • BFS uses a queue while DFS uses a stack or recursion.

    • BFS is optimal for finding shortest path while DFS is optimal for finding a path between two nodes.

    • BFS requires more memory as it stores all the nodes at each level while DFS requires less memory.

    • BFS can be used to find connected components while DFS

  • Answered by AI
  • Q7. OS Concepts – Starvation, Demand Paging, Virtual Memory, Deadlocks
  • Q8. Parenthesis Balance Checking
  • Q9. Three Jars - 1 with apples, 1 with oranges, 1 with apples and oranges. All of them wrongly labelled. Find min no of attempts to find the correct nature of boxes
  • Q10. Find product of each element of an array except that element in O(N) time complexity without using / operation
  • Ans. 

    Find product of each element of an array except that element in O(N) time complexity without using / operation

    • Use prefix and suffix products

    • Multiply prefix and suffix products for each element to get the final product

    • Handle edge cases where array has 0 or 1 element separately

  • Answered by AI
  • Q11. Recursively deleting linked list
  • Ans. 

    Recursively delete a linked list

    • Create a recursive function that takes the head of the linked list as input

    • Base case: if the head is null, return

    • Recursively call the function with the next node as input

    • Delete the current node

  • Answered by AI
  • Q12. Recursively deleting linked list from end
  • Ans. 

    Recursively delete a linked list from the end.

    • Start from the head and recursively traverse to the end of the list.

    • Delete the last node and set the second last node's next pointer to null.

    • Repeat until the entire list is deleted.

    • Use a recursive function to implement the deletion process.

  • Answered by AI
  • Q13. Recursively deleting tree
  • Ans. 

    Recursively delete a tree by deleting all its child nodes and then the parent node.

    • Start from the leaf nodes and delete them first.

    • Then move up to the parent nodes and delete them.

    • Repeat until the root node is deleted.

    • Use post-order traversal to ensure child nodes are deleted before parent nodes.

  • Answered by AI
  • Q14. Recursively deleting from end
  • Ans. 

    Recursively delete elements from the end of an array.

    • Create a recursive function that removes the last element of the array.

    • Call the function recursively until the desired number of elements are removed.

    • Handle edge cases such as empty arrays and removing more elements than the array contains.

  • Answered by AI
  • Q15. Difference between Floyd Warshall and Djikstra
  • Ans. 

    Floyd Warshall finds shortest path between all pairs of vertices while Djikstra finds shortest path from a single source.

    • Floyd Warshall is used for dense graphs while Djikstra is used for sparse graphs.

    • Floyd Warshall has a time complexity of O(n^3) while Djikstra has a time complexity of O((n+m)logn).

    • Floyd Warshall can handle negative edge weights while Djikstra cannot.

    • Floyd Warshall can detect negative cycles while Dj

  • Answered by AI
  • Q16. Shortest path between 2 points in 2-D space in O(log N) time
  • Ans. 

    There is no known algorithm to find shortest path in 2-D space in O(log N) time.

    • The best known algorithm for finding shortest path in 2-D space is Dijkstra's algorithm which has a time complexity of O(N^2).

    • Other algorithms like A* and Bellman-Ford have better time complexity but still not O(log N).

    • If the points are on a grid, Lee algorithm can be used which has a time complexity of O(N).

  • Answered by AI
  • Q17. Design a system for putting newspapers using classes and functions taking different aspects into account
  • Ans. 

    Design a system for putting newspapers using classes and functions

    • Create a Newspaper class with attributes like title, date, and content

    • Create a Publisher class with methods to publish and distribute newspapers

    • Create a Subscriber class with methods to subscribe and receive newspapers

    • Use inheritance to create different types of newspapers like daily, weekly, etc.

    • Implement a database to store newspaper information and ha

  • Answered by AI
  • Q18. SQL commands
  • Q19. Career Prospects - Long Term Plans
  • Q20. Why not higher studies?
  • Ans. 

    I believe practical experience is more valuable than higher studies.

    • I have gained valuable experience through internships and projects.

    • I prefer hands-on learning and problem-solving over theoretical knowledge.

    • I am constantly learning and improving my skills through online courses and workshops.

  • Answered by AI
  • Q21. Machine Learning Concepts - Based on my projects

Interview Preparation Tips

Round: Test
Experience: All Computer Science Topics Covered: Data Structures, Algorithms, Object Oriented Systems, C, C++, Operating Systems, Computer Architectures, Databases, SQL, Basic Quantitative Aptitude
Tips: Solve all of them. Cut off's generally go high.
Duration: 30 minutes
Total Questions: 30

Round: Interview
Experience: Nice Experience. Interviewer was friendly. He wanted exact solutions.
Tips: Be thorough with everything and your projects.

Round: Interview
Experience: Nice Experience. Interviewer was friendly. He wanted exact solutions.
Tips: Be thorough with everything and your projects.

Round: Interview
Experience: Nice Experience. Interviewer was friendly.
Tips: Do not fake yourself.

General Tips: Be thorough with all CS related concepts and projects.
Skill Tips: ""Be thorough.""
Skills: Algorithms, Data Structures, Operating Systems, Machine Learning, SQL, Operating Systems, Computer Architecture, Data Analytics
College Name: IIT Kharagpur
Motivation: Kind of application oriented work and the rising nature of the company. Obviously money also.
Funny Moments: Many funny questions and answers like did you have lunch, when did you last eat, etc

Skills evaluated in this interview

I applied via Company Website and was interviewed before Jun 2020. There were 5 interview rounds.

Interview Questionnaire 

1 Question

  • Q1. If fresher is attending the interview then mostly they'll ask questions from resume What are generics, UML diagram for the proper medicine suggestions based on the patient allergies to a particular drug ...

Interview Preparation Tips

Interview preparation tips for other job seekers - Prepare well with the contents of resume,
First round: versant test
Second round: Technical Interview 1
Third round: Technical Interview 2

Feedback of best of the 2 technical interviews will be considered.

IF selected will receive a call from HR

I applied via Recruitment Consultant and was interviewed in May 2019. There were 4 interview rounds.

Interview Questionnaire 

3 Questions

  • Q1. What is your day to day work?
  • Q2. What new you have to offer the organization?
  • Q3. The most recent issues that you faced in the organization?

Interview Preparation Tips

Interview preparation tips for other job seekers - Be true to yourself and the interviewer, he/she doesn't want you to be full of all technical skills. He/she wants you to be atleast good at the things mentioned in your resume. Showcase that you're ready to switch to any language even if it is uncomfortable for you

I applied via Campus Placement and was interviewed before Nov 2021. There were 3 interview rounds.

Round 1 - Resume Shortlist 
Pro Tip by AmbitionBox:
Keep your resume crisp and to the point. A recruiter looks at your resume for an average of 6 seconds, make sure to leave the best impression.
View all tips
Round 2 - Aptitude Test 

There are 30 basic aptitude question in 30 minutes

Round 3 - Coding Test 

3 coding question 2 were easy and 1 was of medium level

Interview Preparation Tips

Interview preparation tips for other job seekers - i was not selected in HR round . they select only two girls out 15 students

I applied via Campus Placement and was interviewed before Sep 2021. There were 4 interview rounds.

Round 1 - Resume Shortlist 
Pro Tip by AmbitionBox:
Keep your resume crisp and to the point. A recruiter looks at your resume for an average of 6 seconds, make sure to leave the best impression.
View all tips
Round 2 - Aptitude Test 

Math and verbal round .

Round 3 - Group Discussion 

General topics to speak

Round 4 - Technical 

(1 Question)

  • Q1. Duplicates in array College Projects Hashmap implementation
  • Ans. 

    Implement a function to find duplicates in an array of strings using Hashmap.

    • Create a Hashmap to store the frequency of each string in the array

    • Iterate through the array and check if the frequency of any string is greater than 1

    • If yes, add it to the list of duplicates

    • Return the list of duplicates

  • Answered by AI

Interview Preparation Tips

Interview preparation tips for other job seekers - Answer what you know, be genuine and honest

Skills evaluated in this interview

eClinicalWorks Interview FAQs

How many rounds are there in eClinicalWorks Softwaretest Engineer interview?
eClinicalWorks interview process usually has 2 rounds. The most common rounds in the eClinicalWorks interview process are Technical and HR.
What are the top questions asked in eClinicalWorks Softwaretest Engineer interview?

Some of the top questions asked at the eClinicalWorks Softwaretest Engineer interview -

  1. What is exception handling and why it is importa...read more
  2. What are fetaures of Ja...read more
  3. What is abtract cla...read more

Tell us how to improve this page.

eClinicalWorks Softwaretest Engineer Interview Process

based on 1 interview

Interview experience

4
  
Good
View more
eClinicalWorks Softwaretest Engineer Salary
based on 40 salaries
₹3.2 L/yr - ₹11.6 L/yr
42% more than the average Softwaretest Engineer Salary in India
View more details
Software Specialist
500 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Strategic Account Manager
216 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Project Manager
170 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Implementation Specialist
133 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Software Developer
116 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Explore more salaries
Compare eClinicalWorks with

Oracle Cerner

3.7
Compare

Veradigm

4.0
Compare

Athenahealth Technology

4.2
Compare

NextGen Healthcare

3.5
Compare
Did you find this page helpful?
Yes No
write
Share an Interview