Morgan Stanley

-

1. Sprint Bean scopes (Default/ Nested bean of different scope)

2. Dependency Injection/IOC => Knows the bookish definition but can’t explain who will create the object  or how it works?

3. Web Server/Application

4. Hibernate (One to Many /Many to Many relationship) How it will be stored in DB side

5. Array List/Linked List (How Array List works internally/ Array List Implementation)

6. HashMap (hashcode/equals) 

7.  What is volatile and use case.?

8. Complexity of array List, Linked list and stack.?

9. Merge sort

10. Pythagorean triples

11. How to calculate height of tree.?

12. Array List Sorting based on given criteria.?


Comments

Post a Comment

Popular posts from this blog

Full Stack Java Developer - FAQ

-
PROJECT Explain project architecture & technologies stack used in current project?   Your current project deployment process, If its Microservices then explain its CI/CD process?   How do you scale up and down your application if its support microservice architecture?   If you worked on Jenkins then explain it job/pipeline?   What all approach you will take to track slow running application from end to end, Explain step by step?   How do you deal the difficult customer with adhoc requirement?   How will you handle pressure situation within team?   All achievements in IT career?   Anything you have learned during COVID situation last year? CORE JAVA Static method can be overloaded? Static method can be override...
Read more

DSA Interview Coding Questions

-
1] Arrays 1] Find first and second best score Example Given an array, write a function to get first, second best scores from the array and return it in new array. Array may contain duplicates. Example myArray = { 84 , 85 , 86 , 87 , 85 , 90 , 85 , 83 , 23 , 45 , 84 , 1 , 2 , 0 } firstSecond ( myArray ) // {90, 87} Solution: import java . util . Arrays ; import java . util . Collections ; public class Exercise { public static int [] findTopTwoScores ( int [] array ) { int firstHighest = Integer . MIN_VALUE ; int secondHighest = Integer . MIN_VALUE ;   for ( int score : array ) { if ( score > firstHighest ) { secondHighest = firstHighest ; firstHighest = score ; } else if ( score > secondHighest && score < firstHighest ) { secondHighest = score ; } }   return new int []{ firstHighest , secondHighest }...
Read more

Java Interview Question - New FAQs

-
1. Performance Testing & Setting up benchmarks Performance testing evaluate how a system performs under load & to setup benchmarks below steps to be noted down. Steps are: Define KPIs: Response time, throughput, CPU/memory usage etc. Identify Critical Scenarios: like login, search, submit form Use Tools: Gatling, Apache Bench, JMeter (Use to simulate 1000 concurrent users hitting a Rest API and measure the response time Baseline Measurement: Run tests under normal load to establish a baseline Load Testing: Gradually increase users to find system limits Stress Testing: Push beyond limits to see how the system fails Bench marking: Compare results against industry standards or previous releases 2. ACID properties in database It ensure the reliable transaction Atomicity : All operations in a transaction succeed or none do Consistency : DB remains in a valid state before and after the transaction Isolation : Concurrent transactions don't interfere Durability : Once commited...
Read more