Premium Employer

i

This company page is being actively managed by Quorum Software Team. If you also belong to the team, you can get access from here

Quorum Software Verified Tick

Compare button icon Compare button icon Compare

Filter interviews by

Quorum Software Interview Questions and Answers

Updated 17 Aug 2024

Quorum Software Interview Experiences

Popular Designations

4 interviews found

SQL Developer Interview Questions & Answers

user image Anonymous

posted on 14 Jun 2024

Interview experience
5
Excellent
Difficulty level
Easy
Process Duration
Less than 2 weeks
Result
Selected Selected

I applied via Company Website and was interviewed in May 2024. There were 2 interview rounds.

Round 1 - Aptitude Test 

Evaluate your potential to succeed in certain area by looking at your strength and weakness in particular abilities

Round 2 - Technical 

(3 Questions)

  • Q1. What is primary key in sql ?
  • Ans. 

    Primary key in SQL is a unique identifier for each record in a table.

    • Primary key ensures each record in a table is unique

    • Primary key can be a single column or a combination of columns

    • Primary key is used to establish relationships between tables

  • Answered by AI
  • Q2. What is foreign key
  • Ans. 

    A foreign key is a column or a group of columns in a database table that uniquely identifies a record in another table.

    • A foreign key establishes a relationship between two tables by referencing the primary key of another table.

    • It ensures referential integrity, meaning that a record in one table cannot be inserted if the corresponding record in the related table does not exist.

    • Foreign keys help maintain data consistency...

  • Answered by AI
  • Q3. What is view in sql?
  • Ans. 

    A view in SQL is a virtual table based on the result-set of a SELECT statement.

    • Views are used to simplify complex queries by storing them as a virtual table.

    • They can contain data from one or more tables.

    • Views do not store data themselves, but display data from the tables they are based on.

    • Views can be used to restrict access to specific columns or rows of a table.

    • Example: CREATE VIEW vw_employee AS SELECT emp_id, emp_n

  • Answered by AI

Interview Preparation Tips

Interview preparation tips for other job seekers - Identify the career goals….
Dedicate time to the search…

Skills evaluated in this interview

SQL Developer Interview Questions asked at other Companies

Q1. How is a change request in application serviced by development team (business analysis, code analysis, discussion with BA, requirment freeze, etc.)
View answer (4)

Intern Interview Questions & Answers

user image Anonymous

posted on 17 Aug 2024

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

I applied via Campus Placement and was interviewed in Jul 2024. There were 2 interview rounds.

Round 1 - Aptitude Test 

Aptitude test was easy comparatively others.

Round 2 - Group Discussion 

GD topic was an feature of electronic vehicles. And it was good conversation between us.

Interview Preparation Tips

Interview preparation tips for other job seekers - Good infrastructure

Intern Interview Questions asked at other Companies

Q1. Case. There is a housing society “The wasteful society”, you collect all the household garbage and sell it to 5 different businesses. Determine what price you will pay to the society members in Rs/kg, given you want to make a profit of 20% ... read more
View answer (8)
Quorum Software Interview Questions and Answers for Freshers
illustration image

Software Developer Interview Questions & Answers

user image Sushant Walunj

posted on 24 Jul 2024

Interview experience
5
Excellent
Difficulty level
Easy
Process Duration
Less than 2 weeks
Result
Selected Selected

I applied via Campus Placement and was interviewed in Jun 2024. There were 3 interview rounds.

Round 1 - Aptitude Test 

This round was of 75 minutes which consist reasoning, coding, and basic mathematics

Round 2 - Group Discussion 

GD round was of 10 candidates and discussion topic was Electric vehicle

Round 3 - final round 

(2 Questions)

  • Q1. Tell me about yourself
  • Q2. Strength,weakness

Software Developer Interview Questions asked at other Companies

Q1. Maximum Subarray Sum Problem Statement Given an array of integers, determine the maximum possible sum of any contiguous subarray within the array. Example: Input: array = [34, -50, 42, 14, -5, 86] Output: 137 Explanation: The maximum sum is... read more
View answer (42)
Interview experience
5
Excellent
Difficulty level
Moderate
Process Duration
2-4 weeks
Result
Selected Selected

I applied via LinkedIn and was interviewed before Mar 2023. There were 3 interview rounds.

Round 1 - HR 

(1 Question)

  • Q1. Tell me about yourself
Round 2 - One-on-one 

(2 Questions)

  • Q1. Are you open to work afterhours?
  • Q2. Yes, I'm open to work afterworking hours.
Round 3 - One-on-one 

(1 Question)

  • Q1. What case have you solved before? Explain it.

Support Associate Interview Questions asked at other Companies

Q1. If Customer is Already Angry how will you make them calm.
View answer (2)

Quorum Software interview questions for popular designations

 Support Associate

 (1)

 Software Developer

 (1)

 Intern

 (1)

 SQL Developer

 (1)

Jobs at Quorum Software

View all

Interview questions from similar companies

I applied via Naukri.com and was interviewed in Jan 2021. There were 3 interview rounds.

Interview Questionnaire 

1 Question

  • Q1. Experience

Interview Preparation Tips

Interview preparation tips for other job seekers - Good

I applied via Campus Placement and was interviewed before Nov 2020. There were 4 interview rounds.

Interview Questionnaire 

1 Question

  • Q1. Basic programming questions

Interview Preparation Tips

Interview preparation tips for other job seekers - Be confident with answers

I applied via Campus Placement and was interviewed before Nov 2020. There was 1 interview round.

Interview Questionnaire 

1 Question

  • Q1. What do you know about IBM?

Interview Preparation Tips

Interview preparation tips for other job seekers - What are the most immediate projects that need to be addressed?
Can you show me examples of projects I’d be working on?
What are the biggest challenges that someone in this position would face?

Interview Questionnaire 

16 Questions

  • Q1. Simple linked list questions-find middle element,given a pointer to second last element delete it
  • Q2. Explain insertion sort,quicksort
  • Ans. 

    Insertion sort and quicksort are sorting algorithms used to sort arrays of data.

    • Insertion sort: iterates through the array and inserts each element into its proper position.

    • Quicksort: selects a pivot element and partitions the array into two sub-arrays, one with elements less than the pivot and one with elements greater than the pivot.

    • Insertion sort is best for small arrays, while quicksort is best for large arrays.

    • Bot...

  • Answered by AI
  • Q3. Concept of virtual destructors,runtime polymorphism
  • Q4. Test cases for an installation software like check if sufficient memory available,check for a previous version,check to undo all the changes made to the system while quitting the installation. 5.2 puzzles
  • Q5. Merge two sorted linked lists using recursion
  • Ans. 

    Merge two sorted linked lists using recursion

    • Create a recursive function that compares the first nodes of both lists

    • Set the smaller node as the head of the merged list and call the function again with the next node of the smaller list

    • Base case: if one list is empty, return the other list

    • Return the merged list

  • Answered by AI
  • Q6. Given an integer(consider 4 bytes) find which byte is zero
  • Ans. 

    Given an integer, determine which byte is zero.

    • Convert the integer to a byte array using bitwise operations.

    • Iterate through the byte array and check for a zero value.

    • Return the index of the zero byte.

    • Consider endianness when converting to byte array.

  • Answered by AI
  • Q7. Program to check whether your machine is little endian or big endian
  • Ans. 

    To check endianness, create a 4-byte integer with a known value and check the byte order.

    • Create a 4-byte integer with a known value

    • Check the value of the first byte to determine endianness

    • If the first byte is the least significant, the machine is little endian

    • If the first byte is the most significant, the machine is big endian

  • Answered by AI
  • Q8. Print something before execution of main()(use static objects)
  • Ans. 

    Static objects can be used to print something before main() execution.

    • Static objects are initialized before main() execution

    • They can be used to print something before main()

    • Example: static int x = printf("Hello World!");

    • Output: Hello World! will be printed before main() execution

  • Answered by AI
  • Q9. Memory allocation for static varibles(when,which segment etc)
  • Ans. 

    Static variables are allocated memory in the data segment of the program's memory space.

    • Static variables have a fixed memory location throughout the program's execution.

    • They are initialized to zero by default.

    • If initialized explicitly, they are stored in the data segment.

    • Static variables can be accessed by any function in the program.

  • Answered by AI
  • Q10. Find space and time complexity for a recursive function(he wrote it)
  • Ans. 

    Finding space and time complexity of a recursive function.

    • Space complexity is the amount of memory used by the function.

    • Time complexity is the amount of time taken by the function to execute.

    • Recursive functions have higher space complexity due to the call stack.

    • Time complexity can be calculated using Big O notation.

    • Examples of recursive functions include factorial and Fibonacci sequence.

  • Answered by AI
  • Q11. Some questions on major project
  • Q12. Preprocessor directives,volatile keyword
  • Q13. Virtual pointer table,operator overloading,friend functions,semaphores
  • Q14. Diamond heirarchy problem
  • Ans. 

    Diamond hierarchy problem is a problem in object-oriented programming where a class inherits from multiple classes in a diamond-shaped hierarchy.

    • Occurs when a class inherits from two classes that share a common base class

    • Can lead to ambiguity in method calls and data members

    • Solved using virtual inheritance or by using interfaces

  • Answered by AI
  • Q15. Fibonacci series.(:P)
  • Q16. Puzzle

Interview Preparation Tips

Round: Test
Experience: 1. Aptitude-Mostly caselets on ordering and some easy quant questions.
2. c/c++-No objective questions.Mostly on basics(function pointers,give output of string based codes).Some simple progams(Find smallest of three numbers using conditional operators.gcd using recursion)
3.Data Structures-LCA for BST,2's compliment,reverse a doubly linked list.

College Name: NA

Skills evaluated in this interview

Interview Questionnaire 

20 Questions

  • Q1. He asked me my specialization?
  • Q2. Why not further studies? (He had noted that I was third in my batch. He appeared impressed by that
  • Q3. He asked me to tell him about my favorite project
  • Q4. He then looked at my grades. He commented that my lowest grade – B- was in Digital Image Processing. I just looked at him like a doofus thinking of what to say. But he quickly added, ‘don’t worry, it happe...
  • Q5. He then asked me a question that had been asked in Round 4, written test:Describe an optimal algorithm to find the second minimum number in an array of numbers. What is the exact number of comparisons requ...
  • Q6. Given a polygon (could be regular, irregular, convex, concave), find out whether a particular point lies inside it or outside it
  • Ans. 

    To determine if a point is inside a polygon, use the ray casting algorithm.

    • Create a line from the point to a point outside the polygon

    • Count the number of times the line intersects with the polygon edges

    • If the count is odd, the point is inside the polygon; otherwise, it is outside

  • Answered by AI
  • Q7. He asked me to explain Canny’s algorithm to him. (this was because my DIP project was related to this)
  • Q8. Then, he gave me a practical problem to solve: Suppose you are given an image which contains some text and some photos. How do you find the location of the image?
  • Q9. Which are the four storage classes in C
  • Ans. 

    The four storage classes in C are auto, register, static, and extern.

    • Auto: default storage class for all local variables

    • Register: used to define local variables that should be stored in a register instead of RAM

    • Static: used to define local variables that retain their value between function calls

    • Extern: used to declare a global variable that is defined in another file

  • Answered by AI
  • Q10. Given a program: int i; int main() { int j; int *k = (int *) malloc (sizeof(int)); … } Where are each of these variables stored?
  • Ans. 

    i is stored in global data segment, j is stored in stack, k is stored in heap.

    • i is a global variable and is stored in the global data segment

    • j is a local variable and is stored in the stack

    • k is a pointer variable and is stored in the stack, while the memory it points to is allocated on the heap using malloc()

  • Answered by AI
  • Q11. Question on polymorphisms
  • Q12. He again went back to the first question he had asked me. Once again
  • Q13. Then he wrote out some code and asked me how the compiler will generate code for it. I gave some answer, but he was clearly not satisfied. I thought it was all over by then. Then, he asked me a DIP quest...
  • Q14. Given a set of words one after another, give me a data structure so that you’ll know whether a word has appeared already or not
  • Ans. 

    Use a hash table to store the words and check for existence in constant time.

    • Create a hash table with the words as keys and a boolean value as the value.

    • For each new word, check if it exists in the hash table. If it does, it has appeared before. If not, add it to the hash table.

    • Alternatively, use a set data structure to store only the unique words and check for existence in the set.

  • Answered by AI
  • Q15. He asked me some questions on Interprocess Communication: What’s a semaphore? How are they used? He would often pick out words from my answers and ask me what they meant. He wanted to make sure that I rea...
  • Q16. He then asked me some DB fundas. Transaction. Serializability, Consistent state, etc
  • Q17. Finally, he asked me whether I had any questions
  • Q18. There is a clock at the bottom of the hill and a clock at the top of the hill. The clock at the bottom of the hill works fine but the clock at the top doesn’t. How will you synchronize the two clocks. Obv...
  • Q19. There was one more puzzle.. I don’t remember it. but I do remember that we started discussing ways of generating large prime numbers
  • Q20. We also talked a bit about my phone browser project

Interview Preparation Tips

Round: Test
Duration: 15 minutes
Total Questions: 1

Round: Test
Duration: 30 minutes
Total Questions: 2

Round: Test
Duration: 30 minutes
Total Questions: 3

Round: Test
Total Questions: 4

Round: Technical Interview
Experience: 1.When I told him that I had none as I didn’t want to specialize in this stage, he was a little surprised but appeared satisfied with my reason.2.I told him that my profile clearly indicated that I’ve been trying to get into the industry via internships, industry-funded projects right from second year, second sem. I said that I was fully sure that I didn’t want to do MS anytime soon.3.I told him about the web-browser that I had developed for cell-phones. I thought that was the only project which was closest to what Adobe was working on. He appeared satisfied with my answers.4. So people, be fully prepared to explain any anomalous grades. I was prepared with the explanation of the W in the my grade-sheet but not of the B- in DIP. I know that this is really stupid considering that I was interviewing with Adobe. Don’t make this mistake.5.I screwed up, big time in this question. I had superficially discussed this question with my friend a while ago and he had outlined an algorithm which I thought that I had understood, but I hadn’t. I started off explaining it but got stuck in the middle. He sternly told me to read it up again. One solution that I could tell him, and which I had written in the test was this Use two variables – min and second min. Initialize them by comparing the first two elements of the array. This is (1) comparison. Then, go through the entire array, from index 2 to n-1 comparing each element, first with min and then with second min, updating each variable as necessary. This will involve a worst case of two comparisons for each element. Therefore, total number of comparisons = 2*(n-2) + 1 = 2*n – 3 comparisons.I’ll try to update this with a better solution, sometime soon.6.This is an easy, straight question from graphics. You shoot a ray parallel to the x-axis passing through this point. Start with odd parity. Change parity of ray each time it intersects an edge of the polygon (consider special case of when the line passes through a vertex of the polygon. Change parity only if it passes through a vertex which has one edge above it and one edge below the ray). If the parity of ray is even when it passes through the point, it is inside the polygon, else it is not.7.This is simple. Study DIP8.I gave various alternatives – from searching for RGB components, to using OCR.. he didn’t appear fully satisfied. I think he was looking for edge-detection, but that would fail, if the text contained tables, etc.

Round: Technical Interview
Experience: He was friendly at the start but this interview was my worst. He asked me my favorite subject. I said that it was Programming. (He laughed at that)

1. static, extern, register, auto2.I started off correctly, but he was able to confuse me. He brought in shared libraries, static libraries fundas into the discussion. We had a discussion for about twenty-minutes on this. Finally, he was happy with one of my answers because I had deduced which policy made sense and answered correctly. He said that out of all the people interviewed so far (I was second last), nobody had been able to answer all of these questions correctly.3.this is easy – get it from any C++ book. He tried to confuse me again, but this time I was ready and he was finally satisfied.Then he looked at my grades and said that out of all your grades, you have only two Bs and one of them is in Compilers. Why? (Damn it. three non-A grades and that’s all they ask about. What’s wrong with this world?!)Didn’t you like Compilers? “Not in particular”, I replied. “Fine. Now, I HAVE to ask you questions on compilers”, he said.4.He again went back to the first question he had asked me. Once again5.I first suggested that we capture only a small portion of the board. To locate that portion, we could search for the chalk in the prof’s hand – of course, taking care that it had the blackboard in the background (no point capturing a video of the prof scratching his chin, na?). Further, if the prof was writing only text, we could convert the video into text by OCR and then transmitting. Simple diagrams could also be reduced to a set of vector-graphics instructions (we rarely, see the prof shading stuff). I think he liked my approach, but was not completely satisfied. Anyway, we left it at that and went forward.6.I suggested various alternatives. but he kept helping me and finally, we came up with an array of pointers to 26-trees (each node of the tree has 26 children). Store every word as a path from the root to a leaf with pointers in the correct places. For example, hello would be stored as – pointer from ‘h’ index of the root array to a node which had a pointer from ‘e’ index of it’s array to a node which had a pointer from ‘l’ index of the array.. and so on. This is both time and space efficient.7.I was able to answer all his questions, but I made the mistake of telling him, when we started off that I didn’t know much about this subject as I had done it a long time ago. He was very annoyed at that, apparently because a lot of people before me had said this.8.I was able to answer all of them. I stumbled around a bit in a few questions where I was explaining correctly, but not using the keywords that he was looking for.9.I thought that I should say something to make him realize that I was not completely stupid and so asked him whether there was any logic to the order in which the short-listed candidates were called. This turned out to be a dumb move. The order was alphabetic and he sent me off with a parting shot, saying “You guys do pattern recognition and stuff and still you can’t recognize such a simple pattern” Me and my big mouth! Moral of the story: Don’t ask questions for the sake of asking.

Round: Puzzle Interview
Experience: After the first two interviews, this one was like having a warm batch after being cold and wet for days! I did well in this one.1.You have to go up the hill and come back, with horse, without horse, getting four equations to solve four unknowns – time to go uphill – with horse, without horse, time to go downhill – with horse, without horse. Then you can go up the hill and set the clock to ‘(time when you left) + (time to go uphill with horse)’2.  I told him the funda of Mersenee primes (luckily remembered it) and he was decently impressed.

General Tips: Finally hired by Adobe. Special thanks to AmbitionBox team. Really amazing site for sharing experience. That’s all for the Adobe. They are focusing on your approach and your coding skills. All the best.
Skills: Algorithm, Data structure, C++, C, DIP
College Name: BIT Mesra

Skills evaluated in this interview

Interview Questionnaire 

12 Questions

  • Q1. Given a binary tree and an integer x, return whether the binary tree has a path from root to a leaf whose values sum to x
  • Q2. Gievn a binary tree and return all root to leaf node pathss row,col and value
  • Ans. 

    Return all root to leaf node paths in a binary tree with row, col and value.

    • Traverse the binary tree recursively and keep track of the current path.

    • When a leaf node is reached, add the path to the result array.

    • Include row, col and value of each node in the path.

    • Use an array of strings to store the paths.

  • Answered by AI
  • Q3. He then asked me to give test cases for testing this program
  • Q4. Given two unsorted arrays of numbers and asked me to find the intersection
  • Q5. GetMax() function for a stack in O(1)
  • Ans. 

    To get max value from a stack in O(1), maintain a separate stack to keep track of maximum values.

    • Create a separate stack to keep track of maximum values

    • Push the maximum value onto the stack whenever a new maximum is encountered

    • Pop the maximum value stack whenever the top element of the main stack is popped

    • Return the top element of the maximum value stack to get the maximum value in O(1)

  • Answered by AI
  • Q6. GetMax() function for a queue in O(1)
  • Ans. 

    To get max element from a queue in O(1) time complexity

    • Maintain a separate variable to keep track of the maximum element in the queue

    • Update the maximum element variable whenever a new element is added or removed from the queue

    • Return the maximum element variable when getMax() function is called

  • Answered by AI
  • Q7. Given an array in which consecutive elements differ by 1, i.e. a[i] – a[i + 1] = 1 or -1, and an element x, find the element in the array
  • Q8. Given an array, find the Next Greatest Element to the right for each element
  • Ans. 

    Find the Next Greatest Element to the right for each element in an array of strings.

    • Iterate through the array from right to left

    • Use a stack to keep track of elements

    • Pop elements from stack until a greater element is found

    • If no greater element is found, assign -1

    • Return the result array

  • Answered by AI
  • Q9. Given an expression, remove unnecessary parenthesis. For example if (((a + b)) * c) is given make it (a + b) * c, as it evaluates in the same way without those parenthesis also
  • Ans. 

    To remove unnecessary parenthesis from an expression, we need to apply a set of rules to identify and eliminate them.

    • Identify and remove parenthesis around single variables or constants

    • Identify and remove parenthesis around expressions with only one operator

    • Identify and remove parenthesis around expressions with operators of equal precedence

    • Identify and remove parenthesis around expressions with operators of different ...

  • Answered by AI
  • Q10. Given an array of integers, find the maximum product which can be formed by three numbers
  • Ans. 

    Find the maximum product of three integers in an array.

    • Sort the array in descending order.

    • Check the product of the first three numbers and the product of the first and last two numbers.

    • Return the maximum of the two products.

  • Answered by AI
  • Q11. Given an array of integers, find the length of the longest consecutive sub array which forms an AP
  • Ans. 

    Find length of longest consecutive sub array forming an AP from given array of integers.

    • Sort the array in ascending order

    • Iterate through the array and find the longest consecutive sub array forming an AP

    • Use a variable to keep track of the length of the current consecutive sub array forming an AP

    • Use another variable to keep track of the length of the longest consecutive sub array forming an AP seen so far

  • Answered by AI
  • Q12. Given a binary tree, connect all the nodes at the same level. Each node will have a next pointer; you have to make it point to the next node to its right in the same level. If there is no such node, make ...

Interview Preparation Tips

Skills: Algorithm, Data structure
College Name: NA

Skills evaluated in this interview

Contribute & help others!
anonymous
You can choose to be anonymous

Quorum Software Interview FAQs

How many rounds are there in Quorum Software interview?
Quorum Software interview process usually has 2-3 rounds. The most common rounds in the Quorum Software interview process are Aptitude Test, One-on-one Round and Group Discussion.
How to prepare for Quorum Software interview?
Go through your CV in detail and study all the technologies mentioned in your CV. Prepare at least two technologies or languages in depth if you are appearing for a technical interview at Quorum Software. The most common topics and skills that interviewers at Quorum Software expect are Business operations, Agile, Business Solutions, Troubleshooting and PLSQL.
What are the top questions asked in Quorum Software interview?

Some of the top questions asked at the Quorum Software interview -

  1. What is primary key in sq...read more
  2. What is view in s...read more
  3. What is foreign ...read more

Recently Viewed

PHOTOS

InsuranceDekho

3 office photos

LIST OF COMPANIES

Credit Bajaar

Overview

INTERVIEWS

Elektrobit India

No Interviews

INTERVIEWS

GeeksForGeeks

No Interviews

INTERVIEWS

GeeksForGeeks

No Interviews

INTERVIEWS

Antino

No Interviews

INTERVIEWS

GeeksForGeeks

No Interviews

INTERVIEWS

Antino

No Interviews

INTERVIEWS

Elektrobit India

No Interviews

Tell us how to improve this page.

Quorum Software Interview Process

based on 5 interviews

Interview experience

4.8
  
Excellent
View more
Join Quorum Software Connecting people, workflows, and systems across the energy ecosystem

Interview Questions from Similar Companies

IBM Interview Questions
4.0
 • 2.3k Interviews
Oracle Interview Questions
3.7
 • 846 Interviews
Dell Interview Questions
4.0
 • 385 Interviews
Cisco Interview Questions
4.1
 • 370 Interviews
SAP Interview Questions
4.2
 • 283 Interviews
Adobe Interview Questions
3.9
 • 233 Interviews
Salesforce Interview Questions
4.0
 • 221 Interviews
VMware Software Interview Questions
4.4
 • 145 Interviews
View all

Quorum Software Reviews and Ratings

based on 23 reviews

4.3/5

Rating in categories

3.9

Skill development

4.3

Work-life balance

3.9

Salary

4.2

Job security

4.3

Company culture

3.7

Promotions

4.1

Work satisfaction

Explore 23 Reviews and Ratings
Sr. System Administrator

Pune

8-11 Yrs

Not Disclosed

Software Engineer I

Pune

3-6 Yrs

Not Disclosed

Explore more jobs
Senior Software Engineer
36 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Junior Software Engineer
19 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Software Engineer
14 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Support Consultant
10 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Senior Support Consultant
7 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Explore more salaries
Compare Quorum Software with

SAP

4.2
Compare

Oracle

3.7
Compare

Salesforce

4.0
Compare

Microsoft Corporation

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