Search Interview Questions |  More than 3000 questions in repository. There are more than 900 unanswered questions. Click here and help us by providing the answer. Have a video suggestion. Click Correct / Improve and please let us know. |
|
|||
|
| ||||
| Core java - Interview Questions and Answers for 'Walmart' - 4 question(s) found - Order By Newest | ||||
 Frequently asked at Manhattan Associates ( Based on 2 feedback ) | ||||
| ||||
| Ans. Its an anonymous method without any declaration. Lambda Expression are useful to write shorthand Code and hence saves the effort of writing lengthy Code. It promotes Developer productivity, Better Readable and Reliable code. | ||||
 Sample Code for lambda | ||||
| Help us improve. Please let us know the company, where you were asked this question : | ||||
 Discuss Correct / Improve  java java8 lambda expression architecture  Asked in 58 Companies  expert  frequent | ||||
 Try 1 Question(s) Test | ||||
| ||||
| Ans. It in Java is used to indicate that a field should not be serialized. | ||||
| Help us improve. Please let us know the company, where you were asked this question : | ||||
| Discuss Correct / Improve java oops serialization transient java keywords Asked in 39 Companies intermediate frequent | ||||
| Try 2 Question(s) Test | ||||
| Very Frequently asked. Favorite question in walkins and telephonic interviews. Usually among first few questions. Asked in different variants. Must know for intermediate and expert professionals.Among Top 10 frequently asked questions. | ||||
| ||||
| Ans. A Class must override the hashCode method if its overriding the equals method. | ||||
| Help us improve. Please let us know the company, where you were asked this question : | ||||
| Discuss Correct / Improve java collections hashcode hash code equals collections Asked in 44 Companies intermediate frequent | ||||
| Try 1 Question(s) Test | ||||
| Frequently asked in face to face interviews. | ||||
| ||||
| Ans. int count = 15; int[] fibonacci = new int[count]; fibonacci[0] = 0; fibonacci[1] = 1; for(int x=2; x < count; x++){ fibonacci[x] = fibonacci[x-1] + fibonacci[x-2]; } for(int x=0; x< count; x++){ System.out.print(fibonacci[x] + " "); } | ||||
| Help us improve. Please let us know the company, where you were asked this question : | ||||
| Discuss Correct / Improve ebay fibonacci series Asked in 66 Companies basic frequent | ||||
Which Java version introduced Lambda expressions ?
