AmbitionBox
Interview Questions
- Reviews
- Salaries
- Interview Questions
- About Company
- Benefits
- Jobs
- Office Photos
- Community
Add office photos
Filter interviews by
KHIMS - Kanpur Heart Institute & Multispecialty Hospital Sde1 Interview Questions and Answers
Be the first one to contribute and help others!
Interview questions from similar companies
Anonymous
I appeared for an interview in Aug 2017.
Interview Questionnaire
17 Questions
- Q1. -----/ But here the main thing is that handling of corner cases like when there are duplicate tickets and when there is no proper path possible with given tickets
- Q2. -----/
- Q3. N queen problem with problem statement and dry running of code with 4 queens and then writing the code
- Q4. Sub set problem(Check if there exists any sub array with given sum in the array ) . But the thing here is that we have to do it with space complexity of only O( 1 K ) . K is the sum given .
- Q5. What is NP hardness .
- Ans.
NP hardness refers to the difficulty of solving a problem in non-deterministic polynomial time.
NP-hard problems are some of the most difficult problems in computer science.
They cannot be solved in polynomial time by any known algorithm.
Examples include the traveling salesman problem and the knapsack problem.
- Q6. What is the difference between references and pointers
- Q7. What is difference between reference variable and actual reference
- Ans.
A reference variable is a variable that holds the memory address of an object, while an actual reference is the object itself.
A reference variable is declared with a specific type and can only refer to objects of that type.
An actual reference is the object itself, which can be accessed and manipulated using the reference variable.
Changing the value of a reference variable does not affect the original object, but changi...
- Q8. In this round he asked me about previous round questions and their time complexities also . and with every DS and Algo related questions they asked the time complexities
- Q9. Segmentation , virtual memory , paging
- Q10. 0-1 Knapsack problem
- Ans.
The 0-1 Knapsack problem involves maximizing value within a weight limit using items that can either be included or excluded.
Dynamic Programming approach is commonly used to solve this problem.
Each item has a weight and a value; you cannot take fractional items.
Example: If you have items with weights [1, 2, 3] and values [10, 15, 40], and a capacity of 6, the maximum value is 55.
The solution involves creating a table t...
- Q11. What happens when we type an URL
- Ans.
When we type an URL, the browser sends a request to the server hosting the website and retrieves the corresponding webpage.
The browser parses the URL to extract the protocol, domain, and path.
It resolves the domain name to an IP address using DNS.
The browser establishes a TCP connection with the server.
It sends an HTTP request to the server.
The server processes the request and sends back an HTTP response.
The browser re...
- Q12. Implementation of LRU (WIth Production level code)
- Ans.
Implementation of LRU cache using a doubly linked list and a hash map.
LRU (Least Recently Used) cache is a data structure that stores a fixed number of items and evicts the least recently used item when the cache is full.
To implement LRU cache, we can use a doubly linked list to maintain the order of items based on their usage frequency.
We can also use a hash map to store the key-value pairs for quick access and retrie...
- Q13. Given page access sequence and we have to tell final output using different page replacement algorithms like FIFO , LRU etc
- Ans.
Explaining page replacement algorithms like FIFO and LRU using a given page access sequence.
FIFO (First-In-First-Out): Replaces the oldest page in memory.
Example: Access sequence [1, 2, 3, 1, 2, 4] with 3 frames results in [1, 2, 4].
LRU (Least Recently Used): Replaces the page that hasn't been used for the longest time.
Example: Access sequence [1, 2, 3, 1, 2, 4] with 3 frames results in [2, 3, 4].
Optimal: Replaces the ...
- Q14. What is indexing in DBMS How do we maintain it
- Ans.
Indexing in DBMS is a technique to improve query performance by creating a data structure that allows faster data retrieval.
Indexing is used to speed up data retrieval operations in a database.
It involves creating a separate data structure that maps the values of a specific column to their corresponding records.
This data structure is called an index.
Indexes are typically created on columns that are frequently used in s...
- Q15. B trees , B+ trees with examples
- Q16. AVL trees with examples and their balancing
- Q17. Pid ={3,5,0,1} ppid ={5,4,2,2} process id(pid) ppid=parent process id let us say the process that we killed is 2 now we have to print 2,0,1 as 0,1 are child of 2 and suppose that if we have children f...
- Ans.
Given a list of process IDs and their corresponding parent process IDs, print the IDs of all processes that are children of a specific process ID, and recursively kill all their children.
Iterate through the list of process IDs and parent process IDs
Check if the current process ID is the one to be killed
If yes, recursively find and print all its children
If a child has further children, recursively kill them as well
Interview Preparation Tips
Experience: It is a written round .
We are given with 2 coding questions of 10 marks each .There is no negative marking for coding questions
1)Given a string you have to partition the string in such a manner that each part of the partitioned string is a palindrome in itself and you have to count the number of such partition
For eg: given string NITIN
N ITI N
N I T I N
NITIN
So output will be 3.
2)You are given with a large paragraph and N words.
You have to find a min length subparagraph of the paragraph which contain all those N words in any order. Here length of a paragraph is the count of words in the paragraph.
There are 20 MCQ's all are technical questions only majorly from DSA
Tips: Coding it comes from practice . And for aptitude be good at fundamentals like time complexities etc .
Round: Technical Interview
Experience: Some times luck in interview is also important .I was unable to solve the second question initially ,but later with the help of my interviewer I was able to solve it .
Tips: Even if you are not able to solve the question initially don't be panic it will definitely go well
Round: Technical Interview
Experience: There are so many other questions . But sorry to say that I don't remember all of them ,if I remember them at some other time I will again update it here .
This round interviewer was very nice person And he is very helpful in fact .
Tips: Have solid basics at all data structures and algorithms ,Operating Systems
Round: Technical Interview
Experience: This round is entirely about other CS subjects like OS , DBMS,Networking .
Here asked me do you know other CS subjects like compiler design etc .
But as I am from Electronics I told them that I don't know all those subjects
Tips: Be good at other Cs subjects also
Round: Technical Interview
Experience: I solved above question Using DFS .I constructed a Graph using given information . and I did DFS starting from Given process .In the graph I took each process as 1 Node and the corresponding parent child relationship between the process as edges .
Tips: They will give sufficient time for thinking of the solution . So don't worry immediately after seeing the question . First think well you will definitely get it
Skills: Algorithms And DataStructures, Algorithm Analysis, Operating Systems, Basic Knowledge Of DBMS, Networking Basics, Object Oriented Programming (OOP) Basics
College Name: MNIT
Skills evaluated in this interview
Prepare from hackerrank array and trees problems
Interview Preparation Tips
I applied via Campus Placement and was interviewed in May 2021. There was 1 interview round.
Interview Questionnaire
1 Question
- Q1. Medium DSA questions based on trees, linked lists and 1 graph
Interview Preparation Tips
It was a part of placement drive, 1st OA than interview. The OA round was super easy I was able to code in minutes.
(1 Question)
- Q1. 2 Questions were asked. 1. Linked List sorting. 2. DP question.
Interview Preparation Tips
Per question time good amoubnt of questions
(1 Question)
- Q1. Easy questions based on my resume
(1 Question)
- Q1. Bvased on javba as i mentioned java in my resume
- Ans.
Java is a versatile, object-oriented programming language used for building applications across various platforms.
Java is platform-independent due to the Java Virtual Machine (JVM). For example, code written in Java can run on any device with a JVM.
It supports Object-Oriented Programming (OOP) principles like inheritance, encapsulation, and polymorphism. For instance, a 'Car' class can inherit from a 'Vehicle' class.
Ja...
Interview Preparation Tips
I applied via LinkedIn and was interviewed in Jul 2022. There were 2 interview rounds.
(1 Question)
- Q1. Linux Networking Programming
Interview Preparation Tips
Rhea Mehta
I applied via Campus Placement and was interviewed in Jul 2022. There was 1 interview round.
(1 Question)
- Q1. You are given a family tree, and a node, you have to print all the nodes on the same level as it.
- Ans.
Given a node in a family tree, print all nodes on the same level.
Traverse the tree level by level using BFS
Keep track of the level of each node while traversing
Print all nodes with the same level as the given node
Example: If the given node is 'John', print all his siblings and cousins
Interview Preparation Tips
Skills evaluated in this interview
I applied via Campus Placement and was interviewed before Aug 2021. There were 2 interview rounds.
2 coding questions were asked, 1 invloves sorting and manipulation and the other one was trees question.
(3 Questions)
- Q1. 1 trees question and 1 priority queue question
- Q2. Connect n ropes with minimum cost(priority queue question)
- Ans.
Connect n ropes with minimum cost using priority queue
Create a priority queue and insert all the ropes into it
Pop the two smallest ropes from the queue and connect them
Insert the new rope into the queue and repeat until only one rope remains
The cost of connecting two ropes is the sum of their lengths
Time complexity: O(nlogn)
Example: Ropes of lengths 4, 3, 2, and 6 can be connected with a cost of 29
- Q3. Find the height of the tree when the leaf nodes are connected with each other
- Ans.
The height of the tree can be found by counting the number of edges from the root to the farthest leaf node.
Count the number of edges from the root to the farthest leaf node
This will give the height of the tree
Example: If the farthest leaf node is 4 edges away from the root, the height of the tree is 4
Interview Preparation Tips
- Data Structures
- OOPS
Skills evaluated in this interview
Selected
I applied via Campus Placement and was interviewed before Jul 2023. There were 3 interview rounds.
Basic leetcode and hard one question
(2 Questions)
- Q1. Multiply one matrix with another
- Ans.
Matrix multiplication involves multiplying the elements of one matrix with another matrix.
Create two matrices with compatible dimensions
Multiply corresponding elements of each row in the first matrix with each column in the second matrix
Sum the products to get the resulting matrix
- Q2. Dyanmic programming standard question
(2 Questions)
- Q1. Basic linkedin question
- Q2. Hard arrays dp question
Interview Preparation Tips
1. Question on Graph LC-Hard 2. Question on BFS LC-Medium
(2 Questions)
- Q1. 1. Minimum platforms GFG
- Ans.
Calculate the minimum number of platforms required at a railway station for given arrival and departure times.
Sort arrival and departure times.
Use two pointers to track platforms needed at any time.
Increment platform count on arrival and decrement on departure.
Example: For arrivals [10:00, 10:15] and departures [10:30, 10:45], 2 platforms are needed.
- Q2. Find missing number in array without extra space
- Ans.
Find missing number in array without extra space
Iterate through the array and XOR all the elements with their indices and the actual numbers
The missing number will be the XOR result
Example: ['1', '2', '4', '5'] -> XOR(0, 1) ^ XOR(1, 2) ^ XOR(2, 4) ^ XOR(3, 5) = 3
(2 Questions)
- Q1. Question on Heap
- Q2. Implement Heap in C++
- Ans.
Implementing Heap data structure in C++
Use an array to represent the binary tree structure of the heap
Implement functions for inserting elements, deleting elements, and heapifying the array
Ensure that the heap property is maintained (parent node is always greater than or equal to its children)
(2 Questions)
- Q1. Implement LRU Cache
- Ans.
LRU Cache is a data structure that stores a fixed number of items and removes the least recently used item when the cache is full.
Use a combination of a doubly linked list and a hashmap to efficiently implement LRU Cache.
Keep track of the least recently used item at the tail of the linked list.
When an item is accessed, move it to the head of the linked list to mark it as the most recently used item.
When adding a new it...
- Q2. Discussion on CV and previous projects
(1 Question)
- Q1. Easy LLD question
Skills evaluated in this interview
Tell us how to improve this page.
Sde1 Interview Questions from Similar Companies
TCS
Accenture
Wipro
Cognizant
- Home >
- Interviews >
- KHIMS - Kanpur Heart Institute & Multispecialty Hospital Interview Questions
