Filter interviews by
Virtualization in OS refers to creating a virtual version of a resource such as hardware, operating system, or storage.
Virtualization allows multiple operating systems to run on a single physical machine
It enables better utilization of resources and reduces hardware costs
Examples include VMware, VirtualBox, and Hyper-V
When a URL is typed in a browser, it initiates a series of requests and responses to display the requested webpage.
Browser checks cache for DNS resolution
If not found, browser sends a DNS request to resolve the domain name
Browser sends a request to the server for the webpage
Server responds with the requested webpage
Browser renders the webpage and displays it to the user
Double Ordered Traversal is a traversal technique used to traverse a binary tree in a specific order.
In Double Ordered Traversal, we first traverse the left subtree in an inorder manner.
Then we traverse the right subtree in a reverse postorder manner.
Finally, we traverse the root node.
This traversal technique is also known as Morris Traversal.
It is used to traverse a binary tree without using recursion or a stack.
Add two binary numbers given in string form.
Convert the binary strings to integers.
Add the integers.
Convert the sum back to binary string.
Handle cases where the binary strings have different lengths.
Handle cases where there is a carry over.
Thread is a lightweight process that can run concurrently with other threads within a program.
Threads allow for parallelism and can improve performance in certain scenarios.
Threads can communicate with each other through shared memory or message passing.
Thread creation and management is typically handled by the operating system or a thread library.
Examples of thread libraries include pthreads for C/C++ and java.util.co
Binary Search has a time complexity of O(log n) and is derived from dividing the search space in half at each step.
Binary Search is a search algorithm that works on sorted arrays.
It starts by comparing the target value to the middle element of the array.
If the target value is smaller, the search continues on the lower half of the array.
If the target value is larger, the search continues on the upper half of the array.
T...
QuickSort is a sorting algorithm that uses divide and conquer approach.
Choose a pivot element from the array
Partition the array into two sub-arrays, one with elements less than the pivot and one 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
Code for Fibonacci Series using Recursion, Iteration and Dynamic Programming
Recursion: Define a function that calls itself with the previous two numbers in the series as arguments
Iteration: Use a loop to calculate the series by adding the previous two numbers in each iteration
Dynamic Programming: Store the previous two numbers in variables and use them to calculate the next number in the series
Implementing a Queue using Stacks
Use two stacks to implement a queue
Push elements onto the first stack
When dequeuing, pop all elements from the first stack and push onto the second stack
Pop the top element from the second stack to dequeue
If the second stack is empty, pop all elements from the first stack and push onto the second stack
MergeSort is a divide and conquer algorithm that sorts an array of strings.
Divide the array into two halves
Recursively sort the two halves
Merge the sorted halves
Counting Sort is a sorting algorithm that sorts elements by counting the number of occurrences of each unique element.
Count the occurrences of each element in the array
Calculate the cumulative sum of the counts
Place each element in the sorted array based on its count and cumulative sum
Time complexity is O(n+k) where n is the number of elements and k is the range of input
Example: Sort an array of strings based on their
Chrome uses an algorithm to predict and suggest words based on user input.
Chrome's algorithm uses a combination of user history, bookmarks, and popular searches to predict and suggest words.
The algorithm also takes into account the frequency and recency of the user's input.
Chrome's suggestion feature is powered by Google's Autocomplete API, which uses machine learning to predict and suggest words.
The suggestions are di...
I applied via Referral
I applied via Campus Placement
I applied via Referral and was interviewed in Apr 2024. There was 1 interview round.
I applied via Naukri.com and was interviewed before Jul 2023. There were 3 interview rounds.
Coding round and technical questions
Some technical questions and few questions related to past projects
Basic coding questions related to javascript or Java
Specific to your skills, for FE web development angular related questions.
I applied via Campus Placement and was interviewed before Mar 2023. There were 3 interview rounds.
4 questions , 3 DSA questions medium level and 1 DB design round
I applied via Campus Placement and was interviewed before Apr 2022. There were 4 interview rounds.
There were 3 coding and 1 SQL question.
based on 2 reviews
Rating in categories
Associate
21
salaries
| ₹0 L/yr - ₹0 L/yr |
Software Engineer
9
salaries
| ₹0 L/yr - ₹0 L/yr |
Operations Manager
7
salaries
| ₹0 L/yr - ₹0 L/yr |
Devops Engineer
6
salaries
| ₹0 L/yr - ₹0 L/yr |
Senior Product Manager
6
salaries
| ₹0 L/yr - ₹0 L/yr |
Narayana Health
HealthifyMe
Portea Medical
Practo