Filter interviews by
I applied via Approached by Company and was interviewed before Jan 2024. There were 2 interview rounds.
Basic Python syntax, along with problem-solving techniques and code structure, has been covered.
I applied via Approached by Company and was interviewed before May 2021. There were 4 interview rounds.
To create a complete schema for a hotel, you need to consider various entities like rooms, guests, reservations, staff, amenities, etc.
Entities to include: rooms, guests, reservations, staff, amenities, invoices, payments
Relationships between entities: guest stays in a room, staff manages reservations, amenities are available in rooms
Attributes for each entity: room number, guest name, reservation date, staff ID, ameni
I applied via Campus Placement and was interviewed in Jan 2023. There were 3 interview rounds.
In the first round test was conducted on hackerrank platform
it consist of one coding question and one sql question and total 4 mcq are there
the difficulty of coding(dsa) problem is leetcode medium-hard and sql is hard
I applied via Naukri.com and was interviewed in Oct 2023. There were 2 interview rounds.
Simple questions ,logical reasoning questions easy to crack the round
Array related questions and string related question.4 question will be there in coding
I was interviewed before Aug 2023.
I attend online aptitude test.
Coding test was bit difficult.
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
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
based on 1 interview
Interview experience
based on 1 review
Rating in categories
Data Scientist
4
salaries
| ₹0 L/yr - ₹0 L/yr |
Data Scientist 2
4
salaries
| ₹0 L/yr - ₹0 L/yr |
Software Development Engineer II
3
salaries
| ₹0 L/yr - ₹0 L/yr |
Watchyourhealth.com
Subex
Kiya.ai
Sedemac Mechatronics