i
AeonX Digital
Filter interviews by
Plant in SAP represents a physical location within a company where materials are produced, stored, or distributed.
Plants are assigned to a company code in SAP
Plants can be used for production, storage, or distribution purposes
Each plant can have multiple storage locations within it
Plants are used in material management processes like procurement and inventory management
In 5 years, I see myself as a senior SAP MM Consultant leading successful implementation projects and mentoring junior consultants.
Continuing to enhance my skills and knowledge in SAP MM through training and certifications
Taking on more leadership roles within project teams
Mentoring and coaching junior consultants to help them grow in their careers
Successfully leading multiple SAP MM implementation projects
Building str
I applied via Naukri.com and was interviewed in Dec 2023. There were 3 interview rounds.
The accounting entry for the given scenario is a debit to the Inventory account and a credit to the Accounts Payable account.
When goods are received (Posting), the Inventory account is debited to increase the inventory value.
When an invoice is received, the Accounts Payable account is credited to record the liability.
The quantity received (Posting) and the quantity invoiced are both relevant for the accounting entry.
Th...
Pre-requisite in Sub-Contracting is the requirement for a subcontracting purchase order to be created before the actual subcontracting process can take place.
A subcontracting purchase order must be created
The subcontracting material and the vendor must be specified in the purchase order
The components to be provided by the subcontractor must be defined in the purchase order
The quantity and delivery date for the componen...
To take in 2 vendor invoices with different prices during invoice verification, use the 'Split Invoice' functionality.
Navigate to the invoice verification transaction (MIRO).
Enter the first vendor invoice details and save it.
Click on the 'Split Invoice' button to split the invoice.
Enter the details of the second vendor invoice with the different price.
Save the second invoice.
Both invoices will now be posted separately
Pricing Procedures in SAP MM are used to determine the price of materials or services during procurement or sales processes.
Pricing Procedures are a set of rules and conditions that determine how prices are calculated in SAP MM.
They are used to determine the final price of materials or services based on various factors such as quantity, discounts, taxes, and surcharges.
Pricing Procedures can be customized to meet speci...
Top trending discussions
I applied via Walk-in and was interviewed in Jun 2024. There were 3 interview rounds.
I applied via Approached by Company and was interviewed in Apr 2023. There were 3 interview rounds.
Bigquery optimisation
posted on 26 Jun 2024
posted on 25 May 2024
I applied via Company Website and was interviewed in Nov 2023. There was 1 interview round.
VEE stands for Verification, Execution, and Evaluation. V is often used as a shorthand for Validation.
VEE is a process used in software development to ensure that a product meets the requirements and specifications.
Verification involves checking that the software meets the specified requirements.
Execution involves running the software to ensure it functions correctly.
Evaluation involves assessing the software to determ...
I appeared for an interview before Mar 2021.
Round duration - 60 minutes
Round difficulty - Medium
Technical round with questions based on DSA were discussed.
Ninja is tasked with merging two given sorted integer arrays ARR1
and ARR2
of sizes 'M' and 'N', respectively, such that the merged result is a single sorted array w...
Merge two sorted arrays into one sorted array within the first array.
Create a pointer for the last index of ARR1 and ARR2 to start merging from the end.
Compare elements from both arrays and place the larger element at the end of ARR1.
Continue this process until all elements are merged in sorted order within ARR1.
Given a perfect binary tree consisting of 'N' nodes, reverse the nodes at alternate levels in the tree (i.e., reverse level 2, level 4, ...
Reverse alternate levels of a perfect binary tree by reversing nodes at even levels starting from level 2.
Traverse the tree in level order and store nodes at even levels in a separate list.
Reverse the list of nodes at even levels.
Update the tree with the reversed nodes at even levels.
Repeat the process for alternate levels starting from level 2.
Round duration - 60 minutes
Round difficulty - Medium
Technical round with questions based on OS, Java were discussed.
Characteristics of distributed file systems include scalability, fault tolerance, and data replication.
Scalability: Distributed file systems can easily scale to accommodate a large amount of data and users.
Fault tolerance: They are designed to continue functioning even if some components fail, ensuring high availability.
Data replication: Data is often replicated across multiple nodes to ensure reliability and performan...
Design a file sharing mechanism between two users.
Implement a secure login system for both users.
Allow users to upload files to a shared server.
Provide a way for users to view and download files shared by the other user.
Implement access control to ensure only authorized users can access the shared files.
ConcurrentHashMap is a thread-safe implementation of the Map interface in Java.
ConcurrentHashMap allows multiple threads to read and write to the map concurrently without causing any issues like deadlocks or data corruption.
It achieves thread-safety by dividing the map into segments, each of which can be locked independently.
ConcurrentHashMap is more efficient than using synchronized maps for concurrent access.
Example:...
Analyzing usage history involves tracking user interactions, patterns, and trends to improve application performance.
Collect and store user interaction data such as clicks, page views, and time spent on each feature.
Use analytics tools to generate reports and visualize usage patterns.
Identify popular features, user preferences, and areas for improvement based on usage data.
Implement A/B testing to compare different ver...
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.
I appeared for an interview before Mar 2021.
Round duration - 60 minutes
Round difficulty - Medium
Technical interview round with questions based on DSA.
Your task is to compute the In-Order, Pre-Order, and Post-Order traversals for a given Binary Tree with 'N' nodes, where each node has an integer value.
T
For each test cas...
Compute In-Order, Pre-Order, and Post-Order traversals for a given Binary Tree with 'N' nodes.
Implement tree traversal algorithms: In-Order, Pre-Order, and Post-Order.
Use recursion to traverse the binary tree efficiently.
Handle null nodes represented by -1 in the input.
Follow the order of nodes as they appear in the level order traversal.
Ensure the output is space-separated lists for each traversal type.
Design a data structure for a Least Recently Used (LRU) cache that supports the following operations:
1. get(key)
- Return the value of the key if it exists in the cache; otherw...
Design a Least Recently Used (LRU) cache data structure that supports get and put operations with capacity constraint.
Use a combination of hashmap and doubly linked list to implement the LRU cache.
Keep track of the least recently used item and update it accordingly.
Ensure to handle cache capacity by evicting the least recently used item when the cache is full.
Round duration - 60 minutes
Round difficulty - Medium
Technical Interview round with questions on DSA, OS etc.
You have a 2D grid of dimensions 'N' rows by 'M' columns, initially filled with water. You are given 'Q' queries, where each query contains two integers 'X' and 'Y'....
The task is to determine the number of islands present on a 2D grid after each query of converting water to land.
Create a function that takes the grid dimensions, queries, and coordinates as input.
For each query, convert the water at the given coordinates to land and update the grid.
Use depth-first search (DFS) to find connected lands and count the number of islands.
Return the number of islands after each query.
Synchronized blocks are needed in Java to ensure thread safety by allowing only one thread to access a block of code at a time.
Prevents multiple threads from accessing critical sections of code simultaneously
Ensures data consistency and prevents race conditions
Improves performance by reducing contention for shared resources
Example: synchronized block in a method that updates a shared variable
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.
I appeared for an interview before Mar 2021.
Round duration - 90 minutes
Round difficulty - Easy
This test has 2 sections :
Section 1 ( Technical objective questions)
– 25 mcq’s mainly focusing on c , c++ , os , data structures , algorithms
Section 2 ( 2 Coding questions )
– Code was supposed to be written on paper.
Given a string S
which represents a number, determine the smallest number strictly greater than the original number composed of the same digits. Each digit's frequenc...
Given a number represented as a string, find the smallest number greater than the original with the same set of digits.
Sort the digits in non-increasing order to find the next greater number.
Swap the last two digits to get the smallest greater number.
If no greater number exists, return -1.
You are given a string of length N
. Your task is to reverse the string word by word. The input may contain multiple spaces between words and may have leading o...
Reverse words in a string by reversing the order of words while maintaining spaces.
Split the input string by spaces to get individual words
Reverse the order of the words
Join the reversed words with a single space in between
Round duration - 60 minutes
Round difficulty - Easy
First round of interview was based on basic data structures. Concepts related to binary search tree , uses and comparing complexity were asked. He also asked about Hashing , Collisions.
Given an unsorted array containing 'N' integers, you are required to find 'K' largest elements from the array and return them in non-decreasing order.
The fir...
Find K largest elements in an unsorted array and return them in non-decreasing order.
Sort the array in non-decreasing order
Return the last K elements of the sorted array
Round duration - 60 minutes
Round difficulty - Medium
The interview started with a programming question. Then he asked me a puzzle. There was a small discussion about my projects then .Then he started asking questions about operating system. The interviewer wanted to test my understanding about semaphores and asked some tricky and confusing questions .
Given a binary tree of integers, return the level order traversal of the binary tree.
The first line contains an integer 'T', representing the number of te...
Return the level order traversal of a binary tree given in level order with null nodes represented by -1.
Parse the input to create the binary tree using level order traversal
Use a queue to perform level order traversal and print the nodes in the order visited
Handle null nodes represented by -1 appropriately
Producer-Consumer problem involves multiple threads sharing a common buffer. Producers add items to the buffer while consumers remove them.
Producers and consumers need to synchronize their access to the shared buffer to avoid race conditions.
Semaphores can be used to control access to the buffer. Two semaphores are used - one to track the empty slots in the buffer and one to track the filled slots.
Producers increment t...
Round duration - 60 minutes
Round difficulty - Medium
Technical Interview round with questions based on DSA.
For a given array of integers arr
, identify the peak element. A peak element is an element that is greater than its neighboring elements. Specifically, if arr[i]
is the peak, then both...
Find the peak element in an array of integers.
Iterate through the array and check if the current element is greater than its neighbors.
Handle edge cases for the first and last elements of the array.
Return the peak element found.
Round duration - 60 minutes
Round difficulty - Easy
This round was a telephonic interview with the CTO of the company. The he started with a small discussion about my projects and research paper .He then moved on to data structures and asked me how to choose a relevant data structure for a given problem. I gave him advantages of every data structure and certain problems where specific data structures could be useful .Then he gave a question and asked me for what data structure should be used keeping time complexity in mind. He asked me a few HR questions in the end .
Given the initial letter of a student's name and three integer marks for that student, calculate and display the student's initial letter followed by the integer part of th...
Calculate and display the student's initial letter followed by the integer part of their average marks.
Calculate the average of the three marks provided for each student.
Display the initial letter of the student's name followed by the integer part of the average marks.
Round down the average to the nearest integer to get the integer part.
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.
Some of the top questions asked at the AeonX Digital SAP MM Consultant interview -
based on 2 interviews
Interview experience
SAP Abap Consultant
25
salaries
| ₹3.5 L/yr - ₹11 L/yr |
SAP MM Consultant
10
salaries
| ₹3.4 L/yr - ₹5.3 L/yr |
AWS Cloud Engineer
6
salaries
| ₹2 L/yr - ₹3.6 L/yr |
SAP PP Consultant
6
salaries
| ₹2.4 L/yr - ₹7.5 L/yr |
SAP Basis Consultant
6
salaries
| ₹3 L/yr - ₹12 L/yr |
JoulestoWatts Business Solutions
DotPe
Thoughtsol Infotech
Innoplexus