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

Arrays vs Other Data Structures: When to Choose Arrays

📖 Scenario: Imagine you are organizing a small library's book collection. You want to keep track of the books in a way that is simple and fast to access by their position on the shelf.

🎯 Goal: You will create an array to store book titles, set a limit on how many books you want to display, filter the array to get only the first few books, and then print the selected books. This will help you understand when arrays are the best choice for storing and accessing data.

📋 What You'll Learn

Create an array called books with exactly these titles: 'The Hobbit', '1984', 'Pride and Prejudice', 'To Kill a Mockingbird', 'The Great Gatsby'

Create a variable called maxDisplay and set it to 3

Use a for loop with variable i to iterate over the books array and select only the first maxDisplay books

Print the selected books array using console.log

💡 Why This Matters

🌍 Real World

Arrays are used in many real-world apps to store lists like playlists, shopping items, or messages where order matters and quick access by position is needed.

💼 Career

Understanding arrays helps in almost every programming job because they are the basic way to organize and access collections of data efficiently.

1

Create the books array

Create an array called books with these exact titles: 'The Hobbit', '1984', 'Pride and Prejudice', 'To Kill a Mockingbird', 'The Great Gatsby'

DSA Javascript

// Your code here

Hint

Use square brackets [] to create an array and separate the book titles with commas.

2

Set the maximum number of books to display

Create a variable called maxDisplay and set it to 3

DSA Javascript

const books = ['The Hobbit', '1984', 'Pride and Prejudice', 'To Kill a Mockingbird', 'The Great Gatsby'];
// Your code here

Hint

Use const to create a variable that does not change.

3

Select the first few books using a for loop

Use a for loop with variable i to iterate over the books array and select only the first maxDisplay books. Store these selected books in a new array called selectedBooks.

DSA Javascript

const books = ['The Hobbit', '1984', 'Pride and Prejudice', 'To Kill a Mockingbird', 'The Great Gatsby'];
const maxDisplay = 3;
// Your code here

Hint

Start the loop at 0 and run it while i is less than maxDisplay. Use push to add books to selectedBooks.

4

Print the selected books

Print the selectedBooks array using console.log

DSA Javascript

const books = ['The Hobbit', '1984', 'Pride and Prejudice', 'To Kill a Mockingbird', 'The Great Gatsby'];
const maxDisplay = 3;
const selectedBooks = [];
for (let i = 0; i < maxDisplay; i++) {
    selectedBooks.push(books[i]);
}
// Your code here

Hint

Use console.log(selectedBooks) to print the array.

Practice

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

easy

A. You need fast access to elements by index.

B. You want to store data with complex relationships.

C. You need to frequently insert or delete elements in the middle.

D. You want to maintain sorted data automatically.

Solution

1. Step 1: Understand array access speed

   Arrays allow direct access to elements by their index in constant time.

2. Step 2: Compare with other data structures

   Linked lists and trees are better for dynamic insertions or hierarchical data, but slower for direct access.

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 element access by position [OK]

Common Mistakes:

• Choosing arrays for frequent middle insertions
• Thinking arrays maintain sorted order automatically
• Confusing arrays with trees for hierarchical data

2. Which of the following is the correct way to declare an empty array in JavaScript?

easy

A. const arr = [];

B. const arr = ();

C. const arr = {};

D. const arr = new Object();

Solution

1. Step 1: Recall JavaScript array syntax

   Arrays are declared using square brackets [].

2. Step 2: Check each option

   const arr = []; uses [] which correctly creates an empty array.

3. Final Answer:

   const arr = []; -> Option A

4. Quick Check:

   Empty array uses [] [OK]

Hint: Use square brackets [] to declare arrays [OK]

Common Mistakes:

• Using curly braces {} which create objects
• Using parentheses () which are invalid for arrays
• Using new Object() which creates an object, not array

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

const arr = [10, 20, 30];
arr[5] = 50;
console.log(arr.length);

medium

A. 3

B. 6

C. 5

D. Error

Solution

1. Step 1: Understand array length after assignment

   Assigning to index 5 extends the array length to 6 (indexes 0 to 5).

2. Step 2: Check the length property

   Array length becomes 6 because index 5 is the sixth element.

3. Final Answer:

   6 -> Option B

4. Quick Check:

   Array length = highest index + 1 [OK]

Hint: Array length updates to highest index + 1 [OK]

Common Mistakes:

• Assuming length stays 3 after sparse assignment
• Expecting an error for skipping indexes
• Confusing length with number of assigned elements

4. The following code intends to add an element to the end of an array. What is the error?

const arr = [1, 2, 3];
arr[arr.length] = 4;
arr.length = arr.length - 1;
console.log(arr);

medium

A. The array becomes empty.

B. The element 4 is not added to the array.

C. The code throws a runtime error.

D. The array length is incorrectly reduced, removing the last element.

Solution

1. Step 1: Analyze element addition

   arr[arr.length] = 4 adds 4 at index 3, extending array to [1,2,3,4].

2. Step 2: Analyze length reduction

   arr.length = arr.length - 1 reduces length to 3, removing last element (4).

3. Final Answer:

   The array length is incorrectly reduced, removing the last element. -> Option D

4. Quick Check:

   Reducing length truncates array [OK]

Hint: Reducing length removes elements from end [OK]

Common Mistakes:

• Thinking element 4 remains after length reduction
• Expecting runtime error on length change
• Assuming array becomes empty after length change

5. You have a large dataset that requires frequent random access and occasional additions at the end. Which data structure is best and why?

Options:
A) Linked List - fast insertions anywhere
B) Array - fast random access and append
C) Binary Tree - sorted data and search
D) Stack - last-in-first-out access

hard

A. Linked List because it allows fast insertions anywhere.

B. Stack because it manages data in last-in-first-out order.

C. Array because it provides fast random access and efficient appends.

D. Binary Tree because it keeps data sorted for quick search.

Solution

1. Step 1: Identify requirements

   Need fast random access and occasional additions at the end.

2. Step 2: Match data structure features

   Arrays provide constant time access by index and efficient append at the end.

3. Step 3: Compare other options

   Linked lists have slow random access; trees are for sorted data; stacks restrict access order.

4. Final Answer:

   Array because it provides fast random access and efficient appends. -> Option C

5. Quick Check:

   Arrays = fast access + append [OK]

Hint: Arrays excel at random access and appending [OK]

Common Mistakes:

• Choosing linked list for fast random access
• Confusing binary tree use case with array needs
• Selecting stack for general data access