Round 1
Questions:
- Discuss your internship project at Samsung R&D, Bangalore. What are potential single points of failure in the project and how would you address them?
- What is the role of 'doChoreographer' frames and how can they help in identifying performance bottlenecks?
- Explain different traversal algorithms for trees and graphs, emphasizing their real-world applications.
Aptitude Questions:
- Scooter and Tires Problem: You have a scooter with two tires and a third spare tire. Each tire can last for 5 km. What is the maximum distance you can travel? (Answer: 7.5 km, think greedily.)
- Weighing Coins Problem: You are given 10 bags of coins, with one bag weighing differently. What is the minimum number of weighings required to identify the odd bag? (Use a divide and conquer method, which results in log2(10) moves.)
- Discuss Dijkstra's Algorithm, Bellman-Ford, and Floyd-Warshall, including their time and space complexities.
- Discuss a dynamic programming problem involving directed graphs that appeared in the SWC Advanced test.
- Discuss core CS fundamentals like semaphores, threads, locking, critical sections, race conditions, and ways to handle them.
Candidate's Approach
No approach provided.
Interviewer's Feedback
No feedback provided.