Interview with MORGAN STANELY


Interview with MORGAN STANELY


1. Stringbuffer and Stringbuilder
2. String Manipulation
String s1 = "Sandesh";
String s2 = "Sandesh";
String s3 = new String("Sandesh");
String s4 = new String("Sandesh");

output:
s1 = s2
s2 = s3
s3 = s4

3. equals and ==
4. equals and hashcode
5. list and sets
6. hashmap
7. join()
8. wait() and notifyall()
9. cycles of thread
10. You are getting a big stream of big numbers. Now you have to design a DS, so that you can store only the unique values.
11. Now whatever system you have desinged, now check your system is compatible with following conditions.
a. If numbers are ranging from 1 to 1000 and repeating a millions time.
b. If numbers are ranging from 1 million to 10 million and repeating thousand times.
12. You are getting a big stream of numbers, now you have to design a DS which will store Latest Occurred number and 5 latest numbers.
13. checked and unchecked exceptions

Comments

Post a Comment

Popular posts from this blog

Interview with Samsung SISO Bangalore

Interview with Samsung SISO Bangalore Written Test: 1. Questions based on C++ programming concepts basically Objects, Inheritance, Virtual functions, Function and Operator Overloading. 2. General Computer Science and OS Concepts. 3. Memory Management. Interview 1: 1. Virtual function and Virtual class in C++. 2. Pure Virtual function in C++. 3. Virtual Destructor in C++. 4. Operator Overloading in C++. 5. What are the operator can't be overload. 6. Define MVC Architecture. 7. Singleton design pattern. 8. If we have two View and one Model(Example Like one DB) then controller going to handle this. 9. How request and response works in Web. 10. Calls type in Ajax 11. How did you achieve Cross Browsing and write a code for this. 12. Memory concept from Address bus to Physical Memory 13. How can i call the base class function while all functions are defined as virtual. 14. Can we create object for Abstract Class. 15. If we will not implement the...
Read more

Interview with Amazon

Interview with Amazon It was awesome experience on 11th August, I never expected to reach till last but i could make it. But i have missed the job :-( Lets see my next attempt will give me this opportunity. Here i am sharing my written Test Exam: Q1. Here two lists are given. list1 = 2 > 4 > 5 > 6 > NULL: list2 = 5 > 6 > 7 > NULL; list3 =     3 > 0 > 2 > 3 > NULL; This is called summation of link lists. Constraint: Link list data node can contain only one digit. Write: Input and Output data by dry running your program. Q2. You have to find out maximum number by rearranging the digits of number. Example: 2789 Output: 9872 Complexity: O(n) Q3. Write a program for finding depth of BST (Binary Search Tree). Write by Iterative and Recursion. Q4. (a) Find output of program int mingle(int a, int b) {     int c;     c  = b /2; if (b<=2) cout< return a*2(b/2) + mingle(a,c); } int mai...
Read more

Interview with Wallmart Labs, Bangalore

Wallmart Labs:  Through the innovative fusion of retail, social and mobile, @WalmartLabs is redefining Commerce for the largest retailer worldwide. We are a group comprised of the brightest technologists and businesspeople in the industry, excited about the limitless opportunities that this next generation of Commerce will bring to billions of people around the globe, all in an effort to help them save money and live better. Date: 01 Sept, 2012 Best experience ever, they have asked so many questions. 1. write a program for finding duplicates from a array in O(n) complexity. 2. write a program for find nearest perfect square of given number. Ex. number is given 13, then nearest perfect squares are 9 and 16. Then answer should be 16 because 16 is nearest to 13. 3. write a program for add two numbers without using mathematical operations. Hint: you can use bit-wise operators, like : XOR, AND and OR. 4. How many types of contract do you use for web services. 5. If i want to a...
Read more