The document discusses arrays and the Java Collections Framework, explaining concepts such as array initialization, copying, and multidimensional arrays. It highlights the iterator interface methods, as well as various collection classes like ArrayList and TreeSet, detailing their functionality and properties. Additionally, it covers sorting elements and managing key-value pairs in map interfaces.

1. P.1
Arrays & Java Collections Framework
ghadeer-al-hasan ghadeerof@gamil.com

2. Array Example: P.2

3. Array Example: P.3

4. Array Example: P.4
 In Java all array are object

5. Array Initialization: P.5

6. Object Array: P.6

7. Copy Arrays: P.7

8. Example Parameters : P.8

9. Arrays Parameters: P.9

10. Arrays Parameters: P.10

11. Arrays Parameters: P.11

12. Arrays Parameters: P.12

13. Private Arrays: P.13
For primitive data type we can use clone method, but for complex type we need
deep copy; override clone.

14. Multidimensional Arrays: P.14

15. Collections: P.15
 Is a framework that provides an architecture to store and manipulate the
group of objects.
Framework in Java:
• Provide readymade architecture.
• Represents set of classes and interface.
• Is optional.

16. Iterator Interface: P.16
 Iterator interface provides the facility of iterating the elements in forward
direction only.
Methods of Iterator interface:
There are only three methods in the Iterator interface.
1. Public Boolean hasNext(): is returns true if iterator has more elements.
2. Public object next(): is returns the element and moves the cursor pointer to the next
element.
3. Public void remove(): it removes the last elements returned by the iterator.

17. ArrayList Class: P.17

18. ArrayList Cont. : P.18

19. ArrayList Cont. : P.19

20. ArrayList Methods: P.20

21. ArrayList Methods: P.21

22. TreeSet Class: P.22

23. Map Interface P.23
 It contains values based on the key,
 Key and value pair.
 Each pair is know as an entry.
 It contains only unique elements.
Entry:
 It is the subinterface of Map.
 It provides methods to get key and value.

24. TreeMap class: P.24
 It contains values on the key.
 It contains only unique elements.
 It cannot have null key can have multiple null values.
 It maintains ascending order

25. Sorting : P.25
 We can sort the elements of:
 String object.
 Wrapper class objects.
 User-defined class objects.

26. Sorting Cont. : P.26

27. Stack class : P.27

28. The End
ghadeer-al-hasan ghadeerof@gamil.com