Filter interviews by
I applied via Naukri.com and was interviewed before Nov 2021. There were 2 interview rounds.
posted on 30 Mar 2025
I appeared for an interview in Mar 2025, where I was asked the following questions.
Connection pooling is a technique to manage database connections efficiently, reducing overhead and improving performance.
Connection pooling maintains a pool of active database connections for reuse.
It reduces the overhead of establishing a new connection for each database request.
Example: A web application can reuse connections from the pool instead of opening new ones for each user request.
Connection pools can be con...
Mounting in Docker allows you to share files between the host and containers, enabling data persistence and configuration management.
Mounting can be done using volumes or bind mounts.
Volumes are managed by Docker and are stored in a part of the host filesystem which is not directly accessible.
Example of a volume: `docker run -v my_volume:/data my_image`.
Bind mounts allow you to specify an exact path on the host, e.g., ...
What people are saying about Rocket Software
posted on 5 Sep 2023
I applied via Naukri.com and was interviewed before Sep 2022. There were 2 interview rounds.
I applied via Campus Placement
There was pattern question in any programming language and you have make the pattern dynamic.
posted on 20 Jun 2022
I applied via Recruitment Consulltant and was interviewed in May 2022. There were 3 interview rounds.
I applied via Naukri.com and was interviewed in Nov 2021. There were 3 interview rounds.
I applied via Campus Placement and was interviewed in Jul 2023. There were 3 interview rounds.
Binary search is a fast search algorithm that finds the position of a target value within a sorted array.
Binary search works by repeatedly dividing the search interval in half.
It compares the target value with the middle element of the array.
If the target value is equal to the middle element, the position is found.
If the target value is less than the middle element, the search continues on the lower half of the array.
I...
Quick sort is a popular sorting algorithm that uses divide and conquer strategy.
Divide the array into two sub-arrays based on a pivot element
Recursively sort the sub-arrays
Combine the sorted sub-arrays to get the final sorted array
posted on 28 Oct 2024
I applied via Hirest and was interviewed before Oct 2023. There were 2 interview rounds.
Given JavaScript's complex logic on array and list
based on 1 interview experience
Difficulty level
Software Engineer2
98
salaries
| ₹12.7 L/yr - ₹28.4 L/yr |
Software Engineer II
57
salaries
| ₹12 L/yr - ₹23.1 L/yr |
Senior Software Engineer
52
salaries
| ₹21.7 L/yr - ₹39.9 L/yr |
Software Engineer III
47
salaries
| ₹20 L/yr - ₹35 L/yr |
Software Engineer
45
salaries
| ₹11 L/yr - ₹20.7 L/yr |
Softenger
Capital Numbers Infotech
JK Tech
DesignTech Systems