Fwd: Morgan Stanley (viky.nandha@gmail.com)
radha krishnan
From: sivanesan <siva...@gmail.com>
Date: Thu, Aug 4, 2011 at 9:21 PM
Subject: Fwd: Morgan Stanley (viky....@gmail.com)
To: mitcse08info <mitcse...@googlegroups.com>
---------- Forwarded message ----------
Date: Thu, 4 Aug 2011 08:33:47 -0400
Subject: Fwd: Morgan Stanley (viky....@gmail.com)
To: itss2...@googlegroups.com
Hi,
The details about Morgan Stanley rounds, as posted in our class group.
(Jagadish is one of the guys who got placed there last yr.)
HTH :)
Morgan Stanley
Edited by Tamil Selvan
/*
First round written had 3 sections
1. Analytical
2. Computer Fundamentals
3. C/C++/Java (Chose one of ur wish)
Second Round Technical Interview
1. Question based on Has A relation in OOP
2. Given a string of 0’s and 1’s how ll u reverse it efficiently?
3. Given a triangle
1
1 2
1 2 3
1 2 3 4
….
Find the path that sums upto max (A standard DP problem)
4. A puzzle (I dont remember)
Third Round Technical Group Activity
Given straws and pins they asked us to build something out of it which
reflects strength, height and aesthetics
They gave us a chart, markers to advertise the thing we do
We tried building a house (we tried till the end :D)
Fourth Round HR
Full of HR questions
What should be the qualities of a good leader?
Explanation for the best Project that i have done
Situation in life from which i took a transformation
Why MS?
Fifth Technical again :(
Which is fast and better Compiled code r Interpreted Code?
Whats the diff between new and malloc?
Diff stack and heap mem?
What are the ways to initialise a string in c and which gets mem allocated
from what(stack and heap)
Asked to explain Schema of library mgmt system project of mine and they
asked to optimize it using NFs
DS used to implement undo and redo operation in a wordpad
Given words in a newspaper as input find the words that have occured oly
once
Im dead :(
*/
<<<<<<<<<<<<JAGADISH V, CSE, CEG>>>>>>>>>>>>>>>
1. There was no specific priority for CEG/MIT.
1. PPT Significance: Generally, it is advisable to attend
preplacement talks. You get to know more about the company and atleast can
have a concrete reply tailor-made to suit the company when you are asked
“Why do you want to work with us? “ apart from the usual blah blah sort of
an answer which ppl normally give.
1. Number of rounds and Types:
The written test was purely technical and had questions from
Programming (30 qns), Quant (10 qns), Computer Funda (20
qns). We were given the choice on the programming language.
(C/C++/Java). Quants tested on basic math like (time-distance,
time-work,logical reasoning etc) Computer Funda ranged from OS,Networks, to
comp arch to databases. This was followed by the preliminary shortlist of
candidates who were taken in for a technical interview. The first Technical
interview focussed on a multitude of areas of computer science
from OOP to design patterns to OS to networks and some coding
questions. The second round was a test of communication and marketing skills
and was named ‘ ‘group activity’ The situation was:
we were given some packets of straws. and some bell-pins. Within a time of
45 mins, one had to design a product which was tall, strong and
aesthetic :P.. using only the straws and the needles. The
next was to prepare a poster on the unique features of your product done in
the previous round and market the same in front of all
interviewers. Doing some creativ work was fun :P. Then followed technical
interviews. I had questions like 1.Normalization -
and various normal forms 2.Given a Binary Tree (not a BST),
find the lowest common ancestor of 2 given
nodes 3.Given an nxn screen, Each pixel is represented by
intensity values. Given a specific pixel as
an input, find the no. of pixels of the same
colour which can reached from this pixel.
Assume any suitable data structure for a screen. 4.Print a matrix in
spiral order ; in zigzag order. 5.2 numbers are represented as a linked list
of digits- find their difference. 6.AVL Tree Balancing. Then was
a HR interview with the usual questions like - “why morgan stanley?,
strengths? weaknesses? one great achievement? “ and usual stuff. Some basic
puzzles were also a part of the HR process. Some advice:
1. Always think aloud -- let people know your thought process and how to
proceed.
1. When asked about a weakness, say a genuine answer instead of sounding
fancy like, “ I am such a perfectionist who always is frank”
2. Ask meaningful questions to the interviewer which show your passion
for their technology .
3. Try coding on paper rather than on a system.
4. A must know list of funda---
DataStructures- Lists, Trees, Tries, Stacks,Vectors, HashTables Algorithms:
BFS,DFS,Searching and sorting Concepts: Bit manipulations, Design patterns,
Recursion, Big-O The above is merely a MUST KNOW list.
Some steps for technical questions. 1. RESOLVE
AMBIGUITY IN QUESTIONS: Most questions are deliberately ambiguous /
unclear. so clarify with interviewers. 2.DESIGN AN ALGO: Think aloud and
communicate your thought-process to the interviewer. 3.Before rushing the
paper at the interviewer check if the solution works. 4.In case, you get a
question u know, do not directly start to code head-on so that it seems like
you memorize the answer. Exhibit your skills in dramatising for a while
(dont over-act :D ) and solve :P General Information on CS interviews:
<<<<<<<<<<<<<<<<<What
to prepare for CS interviews>>>>>>>>>>>>>>> Tips
1. Get your CS funda right (Stress on OS and Algorithms). It will be very
difficult to look back again into the text books.
2. Wiki is the best place for general overviews of the topics with neat
examples.
3. Your preparation should be based on the company thats visiting. You
can browse the net for patterns/type of questions they usually ask.
Topics
1. Operating Systems
1. Memory management
1. Paging
2. Virtual Memory [F]
3. Dynamic Memory Allocation
4. Watermarking
1. Threading & Concurrency Control
1. Semaphores [T]
2. Deadlocks / mutex
3. Dining Philosophers
1. Scheduling algorithms [T]
2. Inter process communication
1. Data structures
1. Trees - <http://www.google.com/url?q=http%3A%2F%2Fcslibrary.stanford.edu%2F110%2FBinaryTrees.html%23s2&sa=D&sntz=1&usg=AFQjCNEFq3EYT0PnZXJiwdl0mglwV-EaDA>Problems
& Solution<http://www.google.com/url?q=http%3A%2F%2Fcslibrary.stanford.edu%2F110%2FBinaryTrees.html%23s2&sa=D&sntz=1&usg=AFQjCNEFq3EYT0PnZXJiwdl0mglwV-EaDA>
(Very
Important)
2. Stacks, Queues (This would be fairly easy)
3. Linked list - lots of puzzles where the catch is to use recursion and
only O(1) space.
1. Pointer Train/Chain [ask around]
2. Set of problems with
solution<http://www.google.com/url?q=http%3A%2F%2Fcslibrary.stanford.edu%2F105%2FLinkedListProblems.pdf&sa=D&sntz=1&usg=AFQjCNEMApRwsa14igy4u1x9EaCaKYIyzg>
1. Tree - DLL
interconversion<http://www.google.com/url?q=http%3A%2F%2Fcslibrary.stanford.edu%2F109%2FTreeListRecursion.html&sa=D&sntz=1&usg=AFQjCNG3f16QZHHrem8GbVFviXZE-Jx2Gw>
1. Algorithms
1. Analysis of Algorithms
1. Sorting Algorithms [F] [T]
2. Heaps [T]
3. Difference between best, worst and average case analysis [F]
1. Greedy and Dynamic Programming ( Browse the net for questions or look
into CLRS book )
1. Programming
1. C Puzzles - all over the internet
2. Pointer basics -
<http://www.google.com/url?q=http%3A%2F%2Fcslibrary.stanford.edu%2F102%2FPointersAndMemory.pdf&sa=D&sntz=1&usg=AFQjCNHSrP2IWTHqyD50UECFWkBwaVtarw>start
here<http://www.google.com/url?q=http%3A%2F%2Fcslibrary.stanford.edu%2F102%2FPointersAndMemory.pdf&sa=D&sntz=1&usg=AFQjCNHSrP2IWTHqyD50UECFWkBwaVtarw>
3. Malloc implementation<http://www.google.com/url?q=http%3A%2F%2Fen.wikipedia.org%2Fwiki%2FMalloc&sa=D&sntz=1&usg=AFQjCNGPtfqQ2SG50bkO_Cf9OjAoyWWXiQ>
Legend [F] - Know full funda. What is ___ and why is ______. Expect probing
questions. [T] - Work out an example manually, and see how it works Other
Links
1. Crash prep -
<http://www.google.com/url?q=http%3A%2F%2Fcourses.csail.mit.edu%2Fiap%2Finterview%2Fmaterials.php&sa=D&sntz=1&usg=AFQjCNHVh39Ku8Quz6K6DbyU9-isI-GX1g>
http://courses.csail.mit.edu/iap/interview/materials.php<http://www.google.com/url?q=http%3A%2F%2Fcourses.csail.mit.edu%2Fiap%2Finterview%2Fmaterials.php&sa=D&sntz=1&usg=AFQjCNHVh39Ku8Quz6K6DbyU9-isI-GX1g>
2. Gradual long term puzzle prep - <http://inder-gnu.blogspot.com/>
http://inder-gnu.blogspot.com/ [Questions only]
3. For Aptitude questions -this may help
<http://www.google.com/url?q=http%3A%2F%2Fwww.indiabix.com%2Faptitude%2Fquestions-and-answers%2F&sa=D&sntz=1&usg=AFQjCNFD5GOcfXiuuPvNg6WIVkRMrNamkw>
http://www.indiabix.com/aptitude/questions-and-answers/<http://www.google.com/url?q=http%3A%2F%2Fwww.indiabix.com%2Faptitude%2Fquestions-and-answers%2F&sa=D&sntz=1&usg=AFQjCNFD5GOcfXiuuPvNg6WIVkRMrNamkw>
ALL THE BEST GUYS!! ~~~~~~~~~~~~~ JAGADISH~~~~~~~~~~~
Interview questions:
1. You are given 2 text files. one file contains the key for
replacing each char in other file.
file 2 will be like
a g
c d ...
in file 1, there wil be a text, you’ve to encrypt it(char a
should be replaced with g and c with d and so on). write a pseudo code and
explain it.
2. Hashing and re-hashing concepts
3. write a query for finding second maximum
4. give an example for inheritance and polymorphism
5. how stack and heap are maintained in memory
6. what is the significance of thread over process
7. Given an array of integers with N-1 elements whose range is
between 1..N . Write a code for finding the missing integer in the array.
8. Explain in-order, pre-order traversal of a tree.
Google Docs makes it easy to create, store and share online documents,
spreadsheets and presentations.
[image: Logo for Google Docs] <https://docs.google.com>
--
Vignesh Nandha Kumar
Nikhil Deshingkar
good information