Filter interviews by
I applied via LinkedIn and was interviewed in Feb 2024. There were 2 interview rounds.
Ask question about js and react js
Top trending discussions
I applied via Campus Placement
Aptitude was to the point. Was Easy
Then there was an assignment where have to create a web project.
Good level logical question
I applied via Campus Placement and was interviewed in Aug 2023. There were 2 interview rounds.
They will give you something to make in 2 hours time.
I applied via Campus Placement and was interviewed in Feb 2024. There were 4 interview rounds.
Percentage, logical reasoning
10 min and topics were chosen by ourselves
I applied via Campus Placement
Os,c,ds,aptitude(quants and logical)
I applied via Campus Placement and was interviewed in Sep 2024. There were 2 interview rounds.
OOPS , DBMS , OS , and DSA concepts
posted on 30 Jul 2024
It was easy to crack.questions were quants and logical..amd some technical mcqs
Technical gd..questions were asked from cs fundamentals
Again a technical gd
posted on 28 Feb 2025
What is javascripts, html and css
I applied via Campus Placement and was interviewed in Aug 2022. There were 5 interview rounds.
Apti round took place in online mode but it is not proctored
This one is technical GD and shortlisted people will be divided into batches and will asked technical qns for which ppl has to answer
People who got shortlisted will be having another technical GD and the same process will be continued
Paging is a memory management technique used by the operating system to store and retrieve data from secondary storage.
Paging divides the memory into fixed-size pages and stores them in secondary storage.
When a process needs a page, the operating system retrieves it from secondary storage and loads it into memory.
Paging allows for efficient use of memory and helps prevent fragmentation.
Examples of operating systems tha
Various searching methods include BFS, DFS, binary search, and linear search.
BFS (Breadth-First Search) explores all the vertices at the same level before moving to the next level.
DFS (Depth-First Search) explores as far as possible along each branch before backtracking.
Binary search is a divide and conquer algorithm that searches a sorted array by repeatedly dividing the search interval in half.
Linear search checks ea...
Quick sort works by selecting a pivot element and sorting the array by divide and conquer.
Select a pivot element from the array
Divide the array into two sub-arrays, one with elements smaller than the pivot and the other with elements greater than the pivot
Recursively apply the above steps to the sub-arrays
Combine the sorted sub-arrays to get the final sorted array
Max heap has the largest element at the root while Min heap has the smallest element at the root.
Max heap is a complete binary tree where the parent node is greater than or equal to its child nodes.
Min heap is a complete binary tree where the parent node is less than or equal to its child nodes.
Heaps are commonly used in sorting algorithms like Heap Sort and Priority Queues.
Insertion and deletion operations in heaps ta
based on 1 interview
Interview experience
Research Associate
31
salaries
| ₹2 L/yr - ₹3.3 L/yr |
Software Engineer
22
salaries
| ₹3 L/yr - ₹10 L/yr |
Senior Software Engineer
13
salaries
| ₹9 L/yr - ₹26.5 L/yr |
Software Developer
10
salaries
| ₹5.3 L/yr - ₹8 L/yr |
QA Engineer
10
salaries
| ₹4 L/yr - ₹5.1 L/yr |
Zeta
Hughes Systique Corporation
Konica Minolta Business Solutions India Pvt. Ltd.
Innovatiview India Ltd