Dell
Proud winner of ABECA 2024 - AmbitionBox Employee Choice Awards
Filter interviews by
Clear (1)
I applied via Campus Placement
I am interested in areas related to machine learning, data analysis, and natural language processing.
Machine learning
Data analysis
Natural language processing
I know several programming languages including Java, Python, and C++.
Java
Python
C++
I appeared for an interview before Jun 2016.
I applied via Campus Placement and was interviewed before Jan 2020. There were 3 interview rounds.
I applied via Naukri.com and was interviewed in Sep 2020. There were 3 interview rounds.
Intercompany process in Oracle Projects involves transactions between different legal entities within the same organization.
Intercompany process facilitates financial transactions between different legal entities within the organization.
It ensures accurate recording of revenue, costs, and profits for each legal entity involved.
Intercompany transactions are typically managed through intercompany billing and intercompany...
Rates in Oracle Projects are setup using rate schedules and rate matrices.
Rate schedules define the rates for different resources or roles in a project
Rate matrices define the rates based on different criteria such as project type, organization, or location
Rates can be setup for different time periods, such as hourly, daily, or monthly
Rates can also be setup for different cost types, such as labor, material, or equipme...
I applied via Referral and was interviewed before Jun 2020. There were 3 interview rounds.
Around 600 flights are handled by Bangalore airport on a daily basis.
Bangalore airport is one of the busiest airports in India
It handles both domestic and international flights
On average, there are around 25-30 flights per hour
The number of flights may vary depending on the day of the week and time of the year
Heap sort is a comparison-based sorting algorithm that uses a binary heap data structure.
Heap sort works by first building a heap from the input array.
Then it repeatedly extracts the maximum element from the heap, and places it at the end of the sorted array.
The heap is then updated to exclude the extracted element, and the process is repeated until the heap is empty.
Heap sort has a worst-case and average time complexi...
based on 1 interview
Interview experience
Senior Software Engineer
1.7k
salaries
| ₹10 L/yr - ₹41.5 L/yr |
Software Engineer
1.1k
salaries
| ₹5.1 L/yr - ₹18 L/yr |
Principal Software Engineer
911
salaries
| ₹14.5 L/yr - ₹53.2 L/yr |
Software Engineer2
856
salaries
| ₹7 L/yr - ₹22.1 L/yr |
Senior Analyst
515
salaries
| ₹6 L/yr - ₹22 L/yr |
Helmerich & Payne
Lenovo
Apple
Acer India