Arrays vs Other Data Structures When to Choose Arrays in DSA C# - Build Both Approaches

Arrays vs Other Data Structures: When to Choose Arrays

📖 Scenario: Imagine you are organizing a small library shelf where you want to keep track of book titles in the order they arrive. You want to decide if using an array is the best choice for this task.

🎯 Goal: You will create a simple program using an array to store book titles, set a limit on how many books can be stored, add new books, and then display the list of books. This will help you understand when arrays are a good choice compared to other data structures.

📋 What You'll Learn

Create an array of strings called books with exactly 5 slots.

Create an integer variable called maxBooks and set it to 5.

Add exactly 3 book titles to the books array at the first three positions.

Use a for loop with variable i to print all non-null book titles in the books array.

💡 Why This Matters

🌍 Real World

Arrays are used in situations like storing fixed sets of data such as days of the week, months, or fixed-size buffers.

💼 Career

Understanding when to use arrays helps in writing efficient code for memory and speed, which is important in software development and technical interviews.

1

Create an array to hold book titles

Create a string array called books with exactly 5 elements.

DSA C#

# Your code here

Hint

Use string[] books = new string[5]; to create an array of 5 strings.

2

Set the maximum number of books

Create an integer variable called maxBooks and set it to 5.

DSA C#

string[] books = new string[5];
# Your code here

Hint

Use int maxBooks = 5; to store the maximum number of books.

3

Add book titles to the array

Add these book titles to the books array at positions 0, 1, and 2: "The Hobbit", "1984", "Pride and Prejudice".

DSA C#

string[] books = new string[5];
int maxBooks = 5;
# Your code here

Hint

Assign each book title to the correct index in the books array.

4

Print all stored book titles

Use a for loop with variable i to print all non-null book titles in the books array.

DSA C#

string[] books = new string[5];
int maxBooks = 5;
books[0] = "The Hobbit";
books[1] = "1984";
books[2] = "Pride and Prejudice";

# Your code here

Hint

Loop from 0 to maxBooks - 1. Print only if books[i] is not null.

Practice

1. Which of the following is the best reason to choose an array over other data structures like lists or dictionaries?

easy

A. You need fast access to elements by index

B. You want to store key-value pairs

C. You need to frequently add or remove elements in the middle

D. You want automatic resizing without manual handling

Solution

1. Step 1: Understand array characteristics

   Arrays provide fast access to elements using their index because elements are stored contiguously in memory.

2. Step 2: Compare with other data structures

   Lists and dictionaries offer flexibility like dynamic resizing or key-value storage but may not provide constant-time index access like arrays.

3. Final Answer:

   You need fast access to elements by index -> Option A

4. Quick Check:

   Arrays = fast index access [OK]

Hint: Arrays give quick access by position, unlike dictionaries [OK]

Common Mistakes:

• Confusing arrays with dictionaries for key-value storage
• Thinking arrays resize automatically
• Assuming arrays are best for frequent insertions

2. Which of the following is the correct way to declare an integer array of size 5 in C#?

easy

A. int[] arr = new int[5];

B. int arr = new int[5];

C. int arr[] = new int(5);

D. array<int> arr = new array<int>[5];

Solution

1. Step 1: Recall C# array declaration syntax

   In C#, arrays are declared using the syntax: type[] name = new type[size];.

2. Step 2: Check each option

   int[] arr = new int[5]; matches the correct syntax. Options A, B, and C have syntax errors or incorrect usage.

3. Final Answer:

   int[] arr = new int[5]; -> Option A

4. Quick Check:

   C# arrays use type[] name = new type[size]; [OK]

Hint: Remember: type[] name = new type[size]; for arrays [OK]

Common Mistakes:

• Missing square brackets after type
• Using parentheses instead of square brackets for size
• Confusing array syntax with other languages

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

int[] numbers = {10, 20, 30, 40, 50};
Console.WriteLine(numbers[2]);

medium

A. 10

B. 20

C. 40

D. 30

Solution

1. Step 1: Identify the array elements and indexes

   The array numbers has elements: 10 at index 0, 20 at index 1, 30 at index 2, 40 at index 3, and 50 at index 4.

2. Step 2: Access the element at index 2

   Accessing numbers[2] returns the element 30.

3. Final Answer:

   30 -> Option D

4. Quick Check:

   Index 2 element = 30 [OK]

Hint: Array indexing starts at 0, so index 2 is the third element [OK]

Common Mistakes:

• Confusing index 2 with the second element (index 1)
• Off-by-one errors in indexing
• Assuming arrays start at index 1

4. Consider the following code snippet. What is the error and how to fix it?

int[] arr = new int[3];
arr[3] = 10;
Console.WriteLine(arr[3]);

medium

A. Syntax error; fix by declaring array size 4

B. No error, prints 10

C. Index out of range error; fix by using arr[2]

D. Null reference error; fix by initializing array elements

Solution

1. Step 1: Understand array indexing limits

   An array of size 3 has valid indexes 0, 1, and 2. Accessing index 3 is out of range.

2. Step 2: Identify the error and fix

   Accessing arr[3] causes an IndexOutOfRangeException. Fix by using a valid index like arr[2].

3. Final Answer:

   Index out of range error; fix by using arr[2] -> Option C

4. Quick Check:

   Array size 3 means max index 2 [OK]

Hint: Array indexes go from 0 to size-1, never size [OK]

Common Mistakes:

• Using index equal to array size
• Thinking array indexes start at 1
• Confusing syntax error with runtime error

5. You need to store a fixed number of student grades and access them quickly by position. However, you also want to add or remove grades dynamically later. Which data structure should you choose and why?

hard

A. Array, because it provides fast access and dynamic resizing

B. List, because it allows fast access and dynamic resizing

C. Dictionary, because it stores key-value pairs for grades

D. LinkedList, because it provides fast random access

Solution

1. Step 1: Analyze requirements for fixed size and dynamic changes

   Arrays provide fast access but have fixed size and cannot resize dynamically without creating a new array.

2. Step 2: Identify suitable data structure

   Lists allow fast access by index and can dynamically resize to add or remove elements easily.

3. Step 3: Evaluate other options

   Dictionaries are for key-value pairs, not ideal for position-based access. LinkedLists do not provide fast random access.

4. Final Answer:

   List, because it allows fast access and dynamic resizing -> Option B

5. Quick Check:

   List = fast access + dynamic size [OK]

Hint: Use List for fast access plus easy resizing [OK]

Common Mistakes:

• Choosing array for dynamic resizing
• Confusing linked list with fast random access
• Using dictionary when keys are not needed