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. |
|
|||
|
| ||||
| Interview Questions and Answers for 'Coviam' - 2 question(s) found - Order By Newest | ||||
 Very frequently asked. Favorite question in Walk in Drive of many Indian service companies. | ||||
| ||||
| Ans. Underlying data structure for ArrayList is Array whereas LinkedList is the linked list and hence have following differences - 1. ArrayList needs continuous memory locations and hence need to be moved to a bigger space if new elements are to be added to a filled array which is not required for LinkedList. 2. Removal and Insertion at specific place in ArrayList requires moving all elements and hence leads to O(n) insertions and removal whereas its constant O(1) for LinkedList. 3. Random access using index in ArrayList is faster than LinkedList which requires traversing the complete list through references. 4. Though Linear Search takes Similar Time for both, Binary Search using LinkedList requires creating new Model called Binary Search Tree which is slower but offers constant time insertion and deletion. 5. For a set of integers you want to sort using quicksort, it's probably faster to use an array; for a set of large structures you want to sort using selection sort, a linked list will be faster. | ||||
 Sample Code for ArrayList Sample Code for LinkedList | ||||
| Help us improve. Please let us know the company, where you were asked this question : | ||||
 Discuss Correct / Improve  collections java data structures arraylist linkedlist arraylist vs linkedlist  Asked in 61 Companies  Basic  frequent | ||||
 Try 1 Question(s) Test | ||||
 Related Questions | ||||
 If you are given a choice to use either ArrayList and LinkedList, Which one would you use and Why ? | ||||
| Will this code give error if i try to add two heterogeneous elements in the arraylist. ? and Why ? | ||||
| In a Linked list with sorted numbers, insert a new numbers while maintaining the sort order. | ||||
| Collections.sort can only be performed on .. a. Set b. List c. Map d. Any Collection implementation | ||||
| Is this a valid initialization ? Explain. Collection<Collection> collection = new LinkedList<LinkedList>(); | ||||
| What is the difference between List, Set and Map ? or What are the different Java Collections Interfaces ? | ||||
| Difference between Vector and ArrayList ? | ||||
| Overridden methods must have the same ... | ||||
| Which of the following doesn't extend Collection interface ? | ||||
| Frequently asked in CTS ( Based on 2 feedback ) | ||||
| ||||
| Ans. Comparable interface is used for single sequence sorting i.e.sorting the objects based on single data member where as comparator interface is used to sort the object based on multiple data members. | ||||
| Help us improve. Please let us know the company, where you were asked this question : | ||||
| Discuss Correct / Improve java java.util comparable comparator collections Asked in 23 Companies basic frequent | ||||
| Related Questions | ||||
| What is comparator interface used for ? | ||||
| Sort a List of Objects using comparable and comparator | ||||
| What is a comparator ? | ||||
