技术控

    今日:3| 主题:49249
收藏本版 (1)
最新软件应用技术尽在掌握

[其他] Morgan Stanley Interview | Set 24 (On-Campus for Internship)

[复制链接]
回憶〤亂人心 发表于 2016-10-10 18:47:05
133 0

立即注册CoLaBug.com会员,免费获得投稿人的专业资料,享用更多功能,玩转个人品牌!

您需要 登录 才可以下载或查看,没有帐号?立即注册

x
Recently Morgan Stanley visited our campus for internship. Here is my experience.
    Round 1 (Coding and Aptitude- Online Test 75 minutes):   
    19 MCQ on C++, DSA concepts and few aptitude questions
    2 Coding Questions
    Both questions could be solved using DP.
    15 out of 27 students were shortlisted for next round.
      Round 2 (F2F):   
    Interviewer was quite friendly. First he asked about two of my projects from my resume. Then he asked me to choose any of my favorite programming language. It was C++ for me. So following questions were asked:
    What is inheritance? Explain with an example. (Wrote sample code on paper)
    What is friend class and friend function? When do we use them? Explain with one example. (Again wrote code on paper)
    Then he asked about which one questions you couldn’t do in first round. I told it could be done with DP. Then he asked difference between DP and recursion. Again asked to write a code for pow(x,y) using DP and recursion and calculate time complexity.
    Last questions was on OS. Given a list of numbers (total size of list is 2GB) and RAM size is 1 GB. Can you find the max of these numbers? (Obviously yes) Then how? and then name some of page replacement algorithms.
    Finally 6 of us were selected for final round.
      Round 3 (F2F):   
    This time also the interviewer was very friendly. He first talked about extra curricular activities and other things to make me comfortable. Following three questions were then asked:
    1. When you type in search box on Google, it automatically gives you some suggestions. What data structures and algorithms will you use, to provide search suggestions. The discussion went on for 10-15 minutes with slight variations in problem statement. (He was satisfied with answers)
    2. Similar to facebook friend suggestions. What DSAs will you use to suggest friends? How can you improve if you don’t need the best solution. (I couldn’t improve much)
    3. There is an intersection of two perpendicular roads. The traffic can be either up-down or right-left. But both traffics can’t be together. You just have to put traffic light with two signals only (Red and Green). The question is simply to implement a switch to turn on/off traffic on each side. (A simple synchronization problem).
    Answered using semaphores and threads. Wrote code for the same. Interviewer was very happy and convinced from this.
    If you like GeeksforGeeks and would like to contribute, you can also write an article and mail your article to [email protected] See your article appearing on the GeeksforGeeks main page and help other Geeks.
友荐云推荐




上一篇:揭秘!这才是比BAOCMS更强的本地生活门户O2O系统!
下一篇:揭秘令人生畏的以色列神秘8200“军工厂”及旗下的37家安全公司 ...
酷辣虫提示酷辣虫禁止发表任何与中华人民共和国法律有抵触的内容!所有内容由用户发布,并不代表酷辣虫的观点,酷辣虫无法对用户发布内容真实性提供任何的保证,请自行验证并承担风险与后果。如您有版权、违规等问题,请通过"联系我们"或"违规举报"告知我们处理。

*滑动验证:
您需要登录后才可以回帖 登录 | 立即注册

本版积分规则

我要投稿

推荐阅读

扫码访问 @iTTTTT瑞翔 的微博
回页顶回复上一篇下一篇回列表手机版
手机版/CoLaBug.com ( 粤ICP备05003221号 | 文网文[2010]257号 )|网站地图 酷辣虫

© 2001-2016 Comsenz Inc. Design: Dean. DiscuzFans.

返回顶部 返回列表