Upload Button Icon Add office photos
Engaged Employer

i

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

AVEVA Verified Tick

Compare button icon Compare button icon Compare

Filter interviews by

AVEVA Application Consultant Interview Questions and Answers

Updated 19 Mar 2024

AVEVA Application Consultant Interview Experiences

1 interview found

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

I applied via Company Website and was interviewed in Feb 2024. There was 1 interview round.

Round 1 - Technical 

(1 Question)

  • Q1. Tool test in application
  • Ans. 

    Tool test in application involves evaluating the functionality and performance of various tools used within the application.

    • Tool test is essential to ensure that all tools within the application are working as expected.

    • It involves testing the integration of tools with the application and checking for any compatibility issues.

    • Examples of tools that may be tested include debugging tools, performance monitoring tools, and

  • Answered by AI

Skills evaluated in this interview

Interview questions from similar companies

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

I applied via Walk-in and was interviewed before Dec 2023. There was 1 interview round.

Round 1 - Assignment 

Essay writing to check english.

Interview Preparation Tips

Interview preparation tips for other job seekers - Good co with job security.

Interview Questionnaire 

3 Questions

  • Q1. Mostly around client management, handling and collaboration.
  • Q2. Puzzles and Guesstimates
  • Q3. Case study- Simple one

Interview Preparation Tips

Interview preparation tips for other job seekers - It's a cakewalk if you ever handled clients before. Please brush up on your case study solving skills. The interview is a breeze though lengthy.
Interview experience
2
Poor
Difficulty level
-
Process Duration
-
Result
-
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 

The questions were good and conceptual based.
English was also asked in the first round
paragraph questions were also there

Round 3 - Technical 

(1 Question)

  • Q1. Was given a case study to solve

Interview Preparation Tips

Interview preparation tips for other job seekers - prepare about the company well
Interview experience
2
Poor
Difficulty level
Easy
Process Duration
2-4 weeks
Result
Selected Selected

I applied via Naukri.com and was interviewed before Jul 2023. There was 1 interview round.

Round 1 - Assignment 

Easy assignment with basic questions on patent

Interview Preparation Tips

Round: Interview
Experience: They asked to write 2 codes on recursion. Then some questions on resume. I asked them about the job profile and after knowing that they were hiring candidates for frontend programming, about which they didn’t mention in JAF. I told them that I was not interested in frontend development. And didn’t even answer any question after that. Unfortunately, I was selected.

General Tips: Plan your schedule judiciously keeping your capacity in mind. There is no point of making ideal plans and then not able to do even 50% of it.
Don’t get into unnecessary arguments or debate with people.
Don’t think about what others are doing. Focus on your preparation.
How you carry yourself matters. So, make sure you portray yourself in the way you want the other person to perceive you.
Be selective while applying for companies.
College Name: IIT Kanpur

I applied via Naukri.com and was interviewed in Nov 2019. There were 3 interview rounds.

Interview Questionnaire 

3 Questions

  • Q1. Tell us about yourself and your last job?
  • Ans. 

    I have a diverse background in sales and customer service. In my last job, I worked as a Sales Associate at a retail store.

    • Worked as a Sales Associate at a retail store

    • Assisted customers in finding products and making purchases

    • Handled cash transactions and operated the cash register

    • Maintained a clean and organized sales floor

    • Provided excellent customer service and resolved any issues or complaints

  • Answered by AI
  • Q2. What particular achievements have you had?
  • Ans. 

    I have achieved several milestones in my career, including increasing sales by 20% and receiving a promotion to team lead.

    • Increased sales by 20% through strategic marketing campaigns

    • Received a promotion to team lead for consistently exceeding targets

    • Implemented a new customer service system resulting in improved customer satisfaction ratings

  • Answered by AI
  • Q3. Do an assignment on a competition analysis for our client?
  • Ans. 

    Competition analysis assignment for a client

    • Identify direct and indirect competitors

    • Analyze competitors' products, pricing, and marketing strategies

    • Evaluate competitors' strengths and weaknesses

    • Assess market share and growth potential

    • Identify opportunities and threats in the competitive landscape

  • Answered by AI

Interview Preparation Tips

Interview preparation tips for other job seekers - 1) If you don't understand a question, ask the interviewer in you own words.
2) Be prepared for multiple rounds of interview but don't panic. The same questions will be asked in each stage, so you will by and large have the same answer, you may have to talk about specific things that each interviewer may ask. But all in all about you and your experience.
3) Always wait for them to make you an offer for salary.
4) When HR makes you an offer. Be prepared that it will not be what you want.
- Just remember that they have a script of questions they will ask, if you answer them then they will think you can be hired at their decided CTC for you. But if you list out more points they can add to their list then they will also have to increase your salary. For example, you will have to spend a certain percentage of your salary on travelling and rent, and need to save more. List out additional online courses you have done that the average candidate has not. Point out to them that you were nominated for an award in your last job. These things count.
5) If you don't know the answer to a question of their's. Then say you don't know. But always, let them know you think you could learn it.
6) Recruiters know you can't know everything, and they don't expect you to. They also want to judge you on honesty, and how you respond to pressure.
7) JUST BREATHE. It will go far better than you planned. All the best!!!!
Interview experience
4
Good
Difficulty level
Hard
Process Duration
6-8 weeks
Result
Selected Selected

I applied via Naukri.com and was interviewed in Jul 2023. There were 3 interview rounds.

Round 1 - Case Study 

Chargeback rights and case study

Round 2 - Case Study 

Chargeback case study

Round 3 - Chargeback Dispute  

(1 Question)

  • Q1. Normal questionnaire and case study

Interview Preparation Tips

Interview preparation tips for other job seekers - Chargeback dispute work flow

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 Referral and was interviewed in Apr 2021. There were 3 interview rounds.

Interview Questionnaire 

1 Question

  • Q1. Sql based quedtion

Interview Preparation Tips

Interview preparation tips for other job seekers - Prepare continuously don't lose hope

AVEVA Interview FAQs

How many rounds are there in AVEVA Application Consultant interview?
AVEVA interview process usually has 1 rounds. The most common rounds in the AVEVA interview process are Technical.
How to prepare for AVEVA Application Consultant 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 AVEVA. The most common topics and skills that interviewers at AVEVA expect are Data Integration, Product Support, ANSI, ASME and C#.

Tell us how to improve this page.

AVEVA Application Consultant Interview Process

based on 1 interview

Interview experience

5
  
Excellent
View more

Interview Questions from Similar Companies

TCS Interview Questions
3.7
 • 10.5k Interviews
Infosys Interview Questions
3.6
 • 7.6k Interviews
Siemens Interview Questions
4.1
 • 422 Interviews
ABB Interview Questions
4.1
 • 236 Interviews
Chetu Interview Questions
3.3
 • 174 Interviews
AVASOFT Interview Questions
3.6
 • 162 Interviews
Oracle Cerner Interview Questions
3.7
 • 157 Interviews
ServiceNow Interview Questions
4.1
 • 120 Interviews
View all
AVEVA Application Consultant Salary
based on 26 salaries
₹4.6 L/yr - ₹10.8 L/yr
46% less than the average Application Consultant Salary in India
View more details

AVEVA Application Consultant Reviews and Ratings

based on 9 reviews

4.1/5

Rating in categories

4.7

Skill development

4.3

Work-life balance

3.4

Salary

4.5

Job security

4.5

Company culture

3.5

Promotions

4.0

Work satisfaction

Explore 9 Reviews and Ratings
Senior Consultant
133 salaries
unlock blur

₹9 L/yr - ₹23 L/yr

Software Engineer
75 salaries
unlock blur

₹5.5 L/yr - ₹14.2 L/yr

Principal Consultant
64 salaries
unlock blur

₹15 L/yr - ₹33 L/yr

Test Engineer
55 salaries
unlock blur

₹5.4 L/yr - ₹12 L/yr

Consultant
54 salaries
unlock blur

₹7 L/yr - ₹15.2 L/yr

Explore more salaries
Compare AVEVA with

Thomson Reuters

4.1
Compare

Oracle Cerner

3.7
Compare

Chetu

3.3
Compare

R Systems International

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