Array Insertion at End in DSA Java - Execution Trace

Concept Flow - Array Insertion at End

Start with array and size

↓

Check if array has space?

No→Resize array or error

Yes↓

Insert element at array[size

↓

Increase size by 1

↓

Done

Shows the steps to insert an element at the end of an array: check space, insert, then update size.

Execution Sample

DSA Java

int[] arr = new int[5];
int size = 0;
arr[size] = 10;
size++;
arr[size] = 20;
size++;

Inserts 10 and 20 at the end of an initially empty array, updating size each time.

Execution Table

Step	Operation	Array State	Size Before	Insert Position	Size After	Visual State
1	Start with empty array	[0, 0, 0, 0, 0]	0	-	0	0 -> 0 -> 0 -> 0 -> 0
2	Insert 10 at arr[0]	[10, 0, 0, 0, 0]	0	0	1	10 -> 0 -> 0 -> 0 -> 0
3	Insert 20 at arr[1]	[10, 20, 0, 0, 0]	1	1	2	10 -> 20 -> 0 -> 0 -> 0
4	Stop - no more insertions	[10, 20, 0, 0, 0]	2	-	2	10 -> 20 -> 0 -> 0 -> 0

💡 Insertion stops after adding two elements; size reaches 2, array capacity is 5.

Variable Tracker

Variable	Start	After Step 2	After Step 3	Final
arr	[0,0,0,0,0]	[10,0,0,0,0]	[10,20,0,0,0]	[10,20,0,0,0]
size	0	1	2	2

Key Moments - 2 Insights

Why do we insert at arr[size] and not at arr[size-1]?

Because size tracks the number of elements already in the array, so the next free position is at index size. See execution_table rows 2 and 3 where insertion happens at arr[0] when size=0 and arr[1] when size=1.

What happens if the array is full and we try to insert?

The check at the start (concept_flow step 'Check if array has space?') fails, so we must resize the array or stop insertion. This example stops at size 2 with capacity 5, so no resizing needed here.

Visual Quiz - 3 Questions

Look at the execution_table, what is the size after inserting 10?

A 1

B 0

C 2

D 10

💡 Hint

Check the 'Size After' column in row 2 of execution_table.

At which step does the array contain [10, 20, 0, 0, 0]?

A Step 1

B Step 3

C Step 2

D Step 4

💡 Hint

Look at the 'Array State' column in execution_table rows.

If we insert one more element after step 3, what will be the new size?

A 4

B 2

C 3

D 5

💡 Hint

Size increases by 1 after each insertion, see variable_tracker for size changes.

Concept Snapshot

Array Insertion at End:
- Insert element at index = current size
- Increase size by 1 after insertion
- Check if array has space before inserting
- If full, resize or stop
- Simple and fast for fixed-size arrays

Full Transcript

This visual trace shows how to insert elements at the end of an array. We start with an empty array and size zero. Each insertion places the new element at the index equal to the current size, then increments size by one. The process stops when no more insertions are done or the array is full. The execution table tracks each step's array state and size changes. Key points include inserting at arr[size] and checking space before insertion.

Practice

1. What happens when you insert an element at the end of a fixed-size array in Java without resizing?

easy

A. The insertion throws an error if the array is full

B. The element is added at the next free position if available

C. The array automatically resizes to fit the new element

D. The element replaces the last element if the array is full

Solution

1. Step 1: Understand fixed-size array behavior

   Java arrays have a fixed size and cannot grow automatically. Attempting arr[size] where size == length throws ArrayIndexOutOfBoundsException.

2. Step 2: Inserting at end when full

   Standard insertion arr[size++] = element; if full (size == arr.length), accesses arr[length] and throws runtime error.

3. Final Answer:

   The insertion throws an error if the array is full -> Option A

4. Quick Check:

   Fixed-size array throws error when full [OK]

Hint: Fixed arrays don't resize; throws error if full [OK]

Common Mistakes:

• Assuming arrays resize automatically
• Thinking insertion overwrites last element
• Believing new element is added beyond array size

2. Which of the following is the correct syntax to insert an element at the end of an array in Java if the array has space?

easy

A. arr[size] = newElement; size++;

B. arr[arr.length - 1] = newElement;

C. arr[arr.length] = newElement;

D. arr.add(newElement);

Solution

1. Step 1: Understand array indexing and size tracking

   Arrays use zero-based indexing; last index is length-1. We track current size separately.

2. Step 2: Insert element at next free position

   Use size as index to insert, then increment size to reflect new element count.

3. Final Answer:

   arr[size] = newElement; size++; -> Option A

4. Quick Check:

   Use size as index and increment after insertion [OK]

Hint: Use size variable as index, then increment size [OK]

Common Mistakes:

• Using arr.length as index (out of bounds)
• Trying to use arr.add() which is for lists
• Overwriting last element without size tracking

3. What will be the output of the following Java code?

int[] arr = new int[5];
int size = 0;
arr[size++] = 10;
arr[size++] = 20;
arr[size++] = 30;
System.out.print(java.util.Arrays.toString(arr));

medium

A. [10, 20, 30]

B. [10, 20, 30, 0, 0]

C. [10, 20, 30, 30, 30]

D. [0, 10, 20, 30, 0]

Solution

1. Step 1: Trace insertions with size increment

   Elements 10, 20, 30 are inserted at indexes 0, 1, 2 respectively; size increments after each insertion.

2. Step 2: Understand default array values

   Remaining positions (indexes 3 and 4) remain 0 as default for int arrays.

3. Final Answer:

   [10, 20, 30, 0, 0] -> Option B

4. Quick Check:

   Inserted elements at start; rest are zeros [OK]

Hint: Inserted elements fill start; rest remain default zero [OK]

Common Mistakes:

• Assuming array shrinks to inserted elements only
• Confusing index positions
• Expecting uninitialized elements to be null

4. Identify the error in the following code that tries to insert an element at the end of an array:

int[] arr = new int[3];
int size = 3;
arr[size] = 5;

medium

A. Compilation error due to wrong syntax

B. No error; element inserted at the end

C. ArrayIndexOutOfBoundsException because size equals array length

D. Logical error; element overwrites first element

Solution

1. Step 1: Check array size and index used

   Array length is 3, valid indexes are 0,1,2. Using index 3 causes error.

2. Step 2: Understand runtime exception

   Accessing arr[3] throws ArrayIndexOutOfBoundsException at runtime.

3. Final Answer:

   ArrayIndexOutOfBoundsException because size equals array length -> Option C

4. Quick Check:

   Index equals length causes runtime error [OK]

Hint: Index must be less than array length to avoid error [OK]

Common Mistakes:

• Assuming index == length is valid
• Expecting compile-time error instead of runtime
• Ignoring size variable correctness

5. You have an integer array of size 4: int[] arr = {1, 2, 3, 4}; and a variable size = 4;. You want to insert 5 at the end but the array is full. Which approach correctly adds 5 at the end without losing existing data?

hard

A. Overwrite arr[3] with 5 directly

B. Increase size variable to 5 and assign arr[4] = 5

C. Use arr[size] = 5 without resizing

D. Create a new array of size 5, copy old elements, then add 5 at index 4

Solution

1. Step 1: Recognize fixed array size limitation

   Original array size is 4; cannot add element beyond index 3 without resizing.

2. Step 2: Create new larger array and copy elements

   Create new array of size 5, copy existing elements, then insert 5 at index 4.

3. Final Answer:

   Create a new array of size 5, copy old elements, then add 5 at index 4 -> Option D

4. Quick Check:

   Resize by new array and copy before insertion [OK]

Hint: Resize array by copying before adding new element [OK]

Common Mistakes:

• Trying to insert without resizing
• Overwriting last element losing data
• Assuming size variable controls array length