Array Insertion at End in DSA C# - Execution Trace

Concept Flow - Array Insertion at End

Check if array has space

Yes↓

Insert element at last index

↓

Increase array size count

↓

Done

No↓

Cannot insert - array full

The flow checks if there is space in the array, inserts the element at the end if possible, updates the size, or stops if full.

Execution Sample

DSA C#

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

// Insert 10
if (size < arr.Length) {
  arr[size] = 10;
  size++;
}

This code inserts the number 10 at the end of the array if there is space.

Execution Table

Step	Operation	Array State	Size Before	Size After	Visual State
1	Check if size < capacity	[_, _, _, _, _]	0	0	[empty, empty, empty, empty, empty]
2	Insert 10 at index 0	[10, _, _, _, _]	0	0	[10, empty, empty, empty, empty]
3	Increase size by 1	[10, _, _, _, _]	0	1	[10, empty, empty, empty, empty]
4	Check if size < capacity	[10, _, _, _, _]	1	1	[10, empty, empty, empty, empty]
5	Insert 20 at index 1	[10, 20, _, _, _]	1	1	[10, 20, empty, empty, empty]
6	Increase size by 1	[10, 20, _, _, _]	1	2	[10, 20, empty, empty, empty]
7	Check if size < capacity	[10, 20, _, _, _]	2	2	[10, 20, empty, empty, empty]
8	Insert 30 at index 2	[10, 20, 30, _, _]	2	2	[10, 20, 30, empty, empty]
9	Increase size by 1	[10, 20, 30, _, _]	2	3	[10, 20, 30, empty, empty]
10	Check if size < capacity	[10, 20, 30, _, _]	3	3	[10, 20, 30, empty, empty]
11	Insert 40 at index 3	[10, 20, 30, 40, _]	3	3	[10, 20, 30, 40, empty]
12	Increase size by 1	[10, 20, 30, 40, _]	3	4	[10, 20, 30, 40, empty]
13	Check if size < capacity	[10, 20, 30, 40, _]	4	4	[10, 20, 30, 40, empty]
14	Insert 50 at index 4	[10, 20, 30, 40, 50]	4	4	[10, 20, 30, 40, 50]
15	Increase size by 1	[10, 20, 30, 40, 50]	4	5	[10, 20, 30, 40, 50]
16	Check if size < capacity	[10, 20, 30, 40, 50]	5	5	[10, 20, 30, 40, 50]
17	Cannot insert - array full	[10, 20, 30, 40, 50]	5	5	[10, 20, 30, 40, 50]

💡 At step 16, size equals capacity (5), so insertion stops because array is full.

Variable Tracker

Variable	Start	After Step 3	After Step 6	After Step 9	After Step 12	After Step 15	Final
size	0	1	2	3	4	5	5
arr	[_, _, _, _, _]	[10, _, _, _, _]	[10, 20, _, _, _]	[10, 20, 30, _, _]	[10, 20, 30, 40, _]	[10, 20, 30, 40, 50]	[10, 20, 30, 40, 50]

Key Moments - 3 Insights

Why do we check if size < capacity before inserting?

Because the array has fixed size, checking size < capacity ensures we don't write outside the array bounds, as shown in steps 1, 4, 7, 10, 13, and 16.

Why do we increase size after inserting?

Increasing size after insertion (steps 3, 6, 9, 12, 15) tracks how many elements are currently stored, so next insertion goes to the correct index.

What happens when the array is full?

When size equals capacity (step 16), no more insertions happen and the process stops (step 17), preventing overflow.

Visual Quiz - 3 Questions

Look at the execution table, what is the size variable after step 9?

A 3

B 2

C 1

D 0

💡 Hint

Check the 'Size After' column in row with Step 9.

At which step does the array become full?

A Step 15

B Step 16

C Step 14

D Step 17

💡 Hint

Look for the step where size equals array capacity in the execution table.

If we try to insert another element after step 17, what will happen?

A Array size will double automatically

B Insertion will succeed and size will increase

C Insertion will fail because array is full

D The first element will be overwritten

💡 Hint

Refer to the exit note and step 17 in the execution table.

Concept Snapshot

Array Insertion at End:
- Check if current size < array capacity
- Insert element at index = size
- Increase size by 1
- Stop if array is full
- Fixed size arrays need capacity checks

Full Transcript

This visual trace shows how to insert elements at the end of a fixed size array. We start with an empty array and size zero. Each insertion checks if there is space by comparing size with capacity. If space exists, the element is placed at the index equal to size, then size is increased by one. This process repeats until the array is full. When full, no more insertions happen to avoid overflow. The variable tracker shows how size and array contents change step by step. Key moments clarify why capacity checks and size increments are necessary. The quiz tests understanding of size changes, full array detection, and insertion failure when full.

Practice

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

easy

A. An error occurs because the array size is fixed

B. The array automatically resizes to fit the new element

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

D. The element is added at the first position

Solution

1. Step 1: Understand fixed-size array behavior

   In C#, arrays have a fixed size once created and cannot grow automatically.

2. Step 2: Inserting at the end without resizing

   Inserting at the end requires accessing index arr.Length, which is out of bounds and throws IndexOutOfRangeException.

3. Final Answer:

   An error occurs because the array size is fixed -> Option A

4. Quick Check:

   Fixed-size array insert at end causes error [OK]

Hint: Fixed arrays can't grow; insert at end causes error [OK]

Common Mistakes:

• Assuming array resizes automatically
• Thinking insertion shifts elements
• Believing insertion adds new slot

2. Which of the following is the correct syntax to insert an element at the end of a List<int> named numbers in C#?

easy

A. numbers.Push(5);

B. numbers.InsertEnd(5);

C. numbers.Add(5);

D. numbers.Append(5);

Solution

1. Step 1: Identify List insertion method

   In C#, List<T> uses the Add() method to insert elements at the end.

2. Step 2: Check other options

   InsertEnd, Push, and Append are not valid List<T> methods in C#.

3. Final Answer:

   numbers.Add(5); -> Option C

4. Quick Check:

   List Add method inserts at end [OK]

Hint: Use Add() to insert at end of List [OK]

Common Mistakes:

• Using non-existent methods like InsertEnd or Push
• Confusing List with Stack methods
• Trying Append which is for strings

3. What will be the output of the following C# code?

int[] arr = new int[3] {1, 2, 3};
arr[2] = 10;
Console.WriteLine(string.Join(", ", arr));

medium

A. 1, 2, 3

B. 1, 2, 10

C. 10, 2, 3

D. Runtime error

Solution

1. Step 1: Understand array initialization

   The array arr has 3 elements: 1, 2, 3 at indexes 0, 1, 2.

2. Step 2: Assign new value at last index

   arr[2] = 10 replaces the last element (3) with 10.

3. Final Answer:

   1, 2, 10 -> Option B

4. Quick Check:

   Last element replaced with 10 [OK]

Hint: Index 2 is last element; assignment replaces it [OK]

Common Mistakes:

• Thinking array resizes or shifts elements
• Expecting original array unchanged
• Assuming runtime error on assignment

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

int[] arr = new int[3] {1, 2, 3};
arr[arr.Length] = 7;

medium

A. Syntax error due to missing semicolon

B. Null reference exception

C. No error, code runs fine

D. Index out of range error

Solution

1. Step 1: Check array index used

   arr.Length is 3, but valid indexes are 0,1,2 only.

2. Step 2: Understand index out of range

   Accessing arr[3] causes an IndexOutOfRangeException at runtime.

3. Final Answer:

   Index out of range error -> Option D

4. Quick Check:

   Array index must be less than length [OK]

Hint: Array indexes go 0 to Length-1 only [OK]

Common Mistakes:

• Using arr.Length as index directly
• Ignoring runtime exceptions
• Confusing syntax errors with runtime errors

5. You have an array int[] arr = new int[3] {1, 2, 3};. You want to insert 4 at the end without losing existing elements. Which approach is correct?

hard

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

B. Assign arr[3] = 4 directly

C. Use arr.Add(4) method

D. Resize arr using arr.Resize(4) method

Solution

1. Step 1: Understand fixed array size

   Arrays in C# have fixed size; cannot add elements beyond initial size.

2. Step 2: Correct way to add element

   Create a new larger array, copy existing elements, then insert new element at the end.

3. Step 3: Check other options

   Assigning arr[3] causes error; arr.Add() doesn't exist for arrays; arr.Resize() is invalid.

4. Final Answer:

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

5. Quick Check:

   Fixed arrays need new array to grow [OK]

Hint: Arrays fixed size; create new bigger array to add [OK]

Common Mistakes:

• Trying to assign beyond array length
• Using List methods on arrays
• Assuming Resize method exists