Filter interviews by
I applied via Recruitment Consulltant and was interviewed in Mar 2024. There were 2 interview rounds.
A backend service to be created for product management.
Set theory is a branch of mathematical logic that studies sets, which are collections of objects.
Set theory deals with the study of sets and their properties.
Sets can be defined by listing their elements or by using set-builder notation.
Operations on sets include union, intersection, and complement.
Venn diagrams are often used to visualize relationships between sets.
Set theory forms the foundation of many branches of m...
Top trending discussions
I applied via Company Website and was interviewed in Apr 2021. There were 4 interview rounds.
I applied via Walk-in and was interviewed in May 2021. There was 1 interview round.
I applied via Campus Placement and was interviewed before Sep 2021. There were 3 interview rounds.
It was a bit tough for a fresher
Java is a high-level programming language used for developing applications. OOPs is a programming paradigm based on objects.
Java is platform-independent and can run on any device with a JVM.
OOPs concepts include encapsulation, inheritance, polymorphism, and abstraction.
Encapsulation is the process of hiding data and methods within a class.
Inheritance allows a class to inherit properties and methods from another class.
P...
I applied via Walk-in and was interviewed before Aug 2023. There were 2 interview rounds.
Easy to medium level of questions
It was easy to crack that
I applied via Naukri.com and was interviewed in Aug 2024. There was 1 interview round.
Binary search is a fast search algorithm that finds the position of a target value within a sorted array.
Ensure the array is sorted before performing binary search.
Compare the target value with the middle element of the array.
If the target value is less than the middle element, search the left half of the array. If greater, search the right half.
Repeat the process until the target value is found or the subarray is empt
Merge sort is a divide and conquer algorithm that divides the input array into two halves, sorts them, and then merges them back together.
Divide the array into two halves recursively
Sort each half separately
Merge the sorted halves back together
AR,core ,os,networking,java
based on 1 interview
Interview experience
based on 12 reviews
Rating in categories
Data Processing Analyst
789
salaries
| ₹0 L/yr - ₹0 L/yr |
Data Analyst
461
salaries
| ₹0 L/yr - ₹0 L/yr |
Data Processing Specialist
339
salaries
| ₹0 L/yr - ₹0 L/yr |
Software Engineer
247
salaries
| ₹0 L/yr - ₹0 L/yr |
Research Associate
179
salaries
| ₹0 L/yr - ₹0 L/yr |
Kantar
GfK MODE
Dun & Bradstreet
Euromonitor International