This document discusses Java program structure and arrays. It defines arrays as collections of homogeneous elements stored in contiguous memory locations. Arrays allow for code optimization through easy data retrieval and sorting, as well as random access to elements by index position. However, arrays are limited in size and cannot grow at runtime, so the collection framework is used to solve this problem.

1. Java Program Structure
Created by
Manish Tiwari

2. Section
Statement
Structure
Method
Class

3. Documentation Section
Package Statement
Import Statement
Interface Statement
Class Definition
Main Method Class

4. Array is a collection of similar type(Homogeneous) of elements
stored in contiguous memory location.
Documentation Section
1. Code Optimization: It makes the code optimized, we can
retrieve or sort the data easily.
2. Random access: We can get any data located at any index
position.
Package Statement
1. Size Limit: We can store only fixed size of elements in the
array. It doesn't grow its size at runtime. To solve this problem,
collection framework is used in java.
Class Definition

5. Array is a collection of similar type(Homogeneous) of elements
stored in contiguous memory location.
Interface Statement
1. Code Optimization: It makes the code optimized, we can
retrieve or sort the data easily.
2. Random access: We can get any data located at any index
position.
Class Statement
1. Size Limit: We can store only fixed size of elements in the
array. It doesn't grow its size at runtime. To solve this problem,
collection framework is used in java.
Import Statement
1. Size Limit: We can store only fixed size of elements in the
array. It doesn't grow its size at runtime. To solve this problem,
collection framework is used in java.
main() method class