Java Collections | Java Collections Framework Explained | Java Tutorial For Beginners | Simplilearn

2. Agenda What are Java Collections? Java Collection Framework Java Collection Hierarchy Java Collection Interface Collection Interface Methods Java Collection Classes Collection API Algorithms Benefits of Java Collection

3. 01 What is Java Collection?

4. Click here to watch the video

5. What are Java Collections? A Java Collection can be defined as a unified collection of objects

6. 02 Java Collection Framework

7. Java Collection Framework A Java Collection Framework is defined as a combined structure that is capable of storing and applying to manipulate data

8. Java Collection Framework A Java Collection Framework is defined as a combined structure that is capable of storing and applying to manipulate data Classes API Interface

9. 03 Java Collection Hierarchy

10. Java Collection Hierarchy Iterable Collection List Queue Set

11. Java Collection Hierarchy List ArrayList LinkedList Vector Stack Queue PriorityQueue Deque ArrayDeque Set HashSet LinkedHashSet SortedSet TreeSet

12. 04 Java Collection Interface

13. Java Collections Interface Set Interface Set is a Java collection that cannot duplicate elements stored in it

14. Java Collections Interface List Interface List is a Java collection that can duplicate elements stored in it

15. Java Collections Interface Queue Interface Queue is in Java is a collection that is capable to store and apply operations on elements. They apply operations on two forms that is FIFO and LIFO

16. Java Collections Interface Dequeue Interface Dequeue is similar to Queue but it can support element insertion and deletion from both the ends

17. Java Collections Interface Map Interface Maps in Java is a pair. This has key and value. The map cannot store duplicate elements

18. Java Collections Interface SortedSet Interface Sorted sets maintain mapping in ascending order. They are used for naturally ordered collection

19. Java Collections Interface SortedMap Interface A map that maintains its mappings in ascending key order. This is the Map analog of SortedSet.

20. 05 Collection Interface Methods

21. Collection Interface Methods Description Method Add objects to collection add() Return true if collection is empty isEmpty() clear() Remove all elements from collection Remove a selected object remove() Find number of elements size() Return sequential elements stream()

22. Collection Interface Methods Description Method Return elements in array form toArray() Returns hashCode of the elements hashCode() equals(obj x) Compare an element with collection Return an iterator over collection iterator() Return max value in collection max() Returns true if selected element is present contains()

23. 06 Collection Classes

24. Java Collection Classes HashSet Class It is basically a HashSet interface combined with HashMap. It can allow null elements

25. Java Collection Classes TreeSet Class TreeSet is a NavigableSet implementation base on TreeMap. Here, the elements are ordered using comparators

26. Java Collection Classes ArrayList Class ArrayList in java is a resizable array that is an implementation of ListInterface that allows null elements Two-D Three-D One-D

27. Java Collection Classes One-D A[1] A[2] A[3] A[4] A[0]

28. Java Collection Classes Two-D A[1][0] A[0][0] A[0][1] A[0][2] A[0][3] A[0][4] A[0][0]

29. Java Collection Classes Three-D 2D Array-1 2D Array-2 2D Array-3

30. Java Collection Classes LinkedList Class LinkedList class is an implementation of a list and deque interfaces. This allows null elements as well Double Circular Single

31. Java Collection Classes Single Head Element Address Element Address Element Null Tail

32. Java Collection Classes Double Head Null Element Address Address Element Address Element Null Tail Address

33. Java Collection Classes Circular Head First Element Address Address Element Address Element First Tail Address

34. Java Collection Classes HashMap Class HashMap table is based on Map interface. It provides map operations and allows null values as well

35. Java Collection Classes TreeMap Class TreeMap is based NavigableMap implementation. The map is sorted according to the natural ordering of its keys, or by a Comparator provided at map creation time, depending on the constructor used

36. 07 Collection API Algorithms

37. Collection API Algorithms Java Collection API algorithms provide implementations that are commonly used in searching, sorting and other jobs

38. Collection API Algorithms Sorting Algorithms Sorting algorithm does the job of ordering the elements in an ascending or descending order based on the algorithm written by the user

39. Collection API Algorithms Shuffling Algorithms Shuffling algorithms are designed to destroy the current arrangements. They are employed on creating randomness in the list

40. Collection API Algorithms Searching Algorithms Searching algorithm is employed to search an element in the list/array based on the type of searching mechanism used. Ex: binary

41. Collection API Algorithms Composition Algorithms Composition has two parts: Frequency: checks the count of an element repeated Disjoint: makes sure no element is repeated

42. 08 Benefits of Java Collections

43. Benefits of Java Collections? • Software/Code Reusability • Ease of designing APIs • Simpler to learn and Use new APIs • Increased speed in programming

45. 01 What is an Exception?