Why collection algorithms matter in Swift - Challenge Your Understanding

Challenge - 5 Problems

🧠 Conceptual

intermediate

Why do collection algorithms improve database query performance?

Imagine you have a large list of customer records. Why is using collection algorithms like filtering and sorting important when querying this data?

A They increase the size of the database to store more data.

B They automatically fix errors in the database schema.

C They make the database run slower by adding extra steps.

D They help process data faster by reducing the number of items to check and organizing results efficiently.

💡 Hint

Think about how sorting and filtering affect the amount of data you work with.

Collection algorithms reduce the workload by selecting only needed data and arranging it, which speeds up queries.

❓ query_result

intermediate

What is the output of this Swift filter on a database array?

Given an array of user ages: [18, 22, 15, 30, 25], what is the result of filtering ages greater than 20?

Swift

let ages = [18, 22, 15, 30, 25]
let filtered = ages.filter { $0 > 20 }
print(filtered)

A [20, 22, 25]

B [18, 15]

C [22, 30, 25]

D [15, 18, 22, 25, 30]

💡 Hint

Filter keeps only items where the condition is true.

The filter keeps ages greater than 20, so 22, 30, and 25 remain.

📝 Syntax

advanced

Which Swift code correctly sorts a database records array by name?

Choose the option that sorts an array of records by the 'name' property in ascending order.

Swift

struct Record { let name: String }
let records = [Record(name: "Zoe"), Record(name: "Anna"), Record(name: "Mike")]

A let sorted = records.sorted { $0.name < $1.name }

B let sorted = records.sorted { $0 > $1 }

C let sorted = records.sorted(by: { $1.name < $0.name })

D let sorted = records.sort { $0.name > $1.name }

💡 Hint

Remember that sorted returns a new array and uses a closure comparing properties.

Option A correctly uses sorted with a closure comparing names ascending.

❓ optimization

advanced

How does using collection algorithms reduce database load?

Which option best explains how collection algorithms help reduce the load on a database server?

A They allow filtering and sorting data before sending it to the server, reducing data transfer and processing.

B They increase the number of queries sent to the server to get more data.

C They store all data in memory, ignoring the database server.

D They disable indexes to speed up data retrieval.

💡 Hint

Think about where filtering and sorting happen and how that affects server work.

Filtering and sorting data before sending it to the server reduces the amount of data processed and transferred, lowering server load.

🔧 Debug

expert

What error does this Swift collection algorithm code raise?

Consider this code that tries to find the first user older than 25:

let users = [("Alice", 24), ("Bob", 30), ("Carol", 22)]
let user = users.first { age > 25 }
print(user)

What error will this code produce?

A SyntaxError: Unexpected token 'age'

B SyntaxError: Missing parameter name in closure

C TypeError: Cannot compare tuple with integer

D RuntimeError: No user found

💡 Hint

Look at the closure syntax and variable usage inside it.

The closure uses 'age' without defining it, causing a syntax error for an unexpected token.

Practice

1. Why are collection algorithms important when working with data in Swift?

easy

A. They help find, sort, and filter data easily and efficiently.

B. They make the app run slower by adding extra steps.

C. They only work with numbers, not text or objects.

D. They require complex code that is hard to read.

Solution

1. Step 1: Understand the purpose of collection algorithms

   Collection algorithms are designed to help manage data by finding, sorting, filtering, and checking items quickly.

2. Step 2: Evaluate the options based on this purpose

   They help find, sort, and filter data easily and efficiently. correctly states their role in making data handling easier and efficient. Other options describe incorrect or negative effects.

3. Final Answer:

   They help find, sort, and filter data easily and efficiently. -> Option A

4. Quick Check:

   Collection algorithms improve data handling = B [OK]

Hint: Remember: algorithms simplify data tasks fast [OK]

Common Mistakes:

• Thinking algorithms slow down the app
• Believing algorithms only work with numbers
• Assuming algorithms make code complex

2. Which of the following is the correct way to use the filter algorithm on an array numbers to get only even numbers in Swift?

easy

A. let evens = numbers.filter { $0 / 2 == 0 }

B. let evens = numbers.filter { $0 % 2 == 0 }

C. let evens = numbers.filter { $0 % 2 = 0 }

D. let evens = numbers.filter { $0 == 2 }

Solution

1. Step 1: Understand the filter syntax in Swift

   The filter method takes a closure that returns true for elements to keep. The condition for even numbers is number % 2 == 0.

2. Step 2: Check each option for correct syntax and logic

   let evens = numbers.filter { $0 % 2 == 0 } uses the correct modulo operator and comparison. let evens = numbers.filter { $0 / 2 == 0 } uses division incorrectly. let evens = numbers.filter { $0 % 2 = 0 } uses assignment (=) instead of comparison (==). let evens = numbers.filter { $0 == 2 } filters only numbers equal to 2, not all evens.

3. Final Answer:

   let evens = numbers.filter { $0 % 2 == 0 } -> Option B

4. Quick Check:

   Correct filter syntax for evens = A [OK]

Hint: Use % 2 == 0 to find even numbers in filter [OK]

Common Mistakes:

• Using / instead of % for even check
• Using = instead of == in condition
• Filtering only one number instead of all evens

3. What will be the output of this Swift code?

let names = ["Anna", "Bob", "Cathy", "David"]
let result = names.contains { $0.hasPrefix("C") }
print(result)

medium

A. nil

B. false

C. SyntaxError

D. true

Solution

1. Step 1: Understand the contains method with a closure

   The contains method checks if any element satisfies the condition. Here, it checks if any name starts with "C".

2. Step 2: Check the array elements for the condition

   "Cathy" starts with "C", so the condition is true, making result true.

3. Final Answer:

   true -> Option D

4. Quick Check:

   names contains prefix "C" = true [OK]

Hint: contains with closure returns true if any match found [OK]

Common Mistakes:

• Thinking contains checks all elements and returns false if any fail
• Confusing hasPrefix with contains
• Expecting syntax error due to closure

4. Identify the error in this Swift code that tries to sort an array of integers:

let numbers = [3, 1, 4, 2]
let sorted = numbers.sorted(by: { a, b in a > b })
print(sorted)

medium

A. The closure should use '<' instead of '>' to sort ascending.

B. The sorted method cannot take a closure.

C. The array must be mutable to sort.

D. The closure parameters must be named 'x' and 'y'.

Solution

1. Step 1: Understand the sorted(by:) closure logic

   The closure defines the sorting order. Using 'a > b' sorts descending, not ascending.

2. Step 2: Identify the intended sort order

   Since the question implies sorting ascending, the closure should use 'a < b'. Other options are incorrect because sorted can take closures, arrays can be immutable for sorted, and parameter names are flexible.

3. Final Answer:

   The closure should use '<' instead of '>' to sort ascending. -> Option A

4. Quick Check:

   Use '<' for ascending sort closure [OK]

Hint: Use '<' in closure for ascending sort [OK]

Common Mistakes:

• Thinking sorted needs mutable array
• Believing closure parameter names are fixed
• Assuming sorted can't take closures

5. You have a list of user scores: let scores = [10, 0, 5, 0, 8]. You want to create a dictionary where keys are the scores and values are the count of how many times each score appears, but you want to ignore zero scores. Which Swift code correctly uses collection algorithms to do this?

hard

A. let counts = scores.filter { $0 == 0 }.count

B. let counts = Dictionary(uniqueKeysWithValues: scores.map { ($0, 1) })

C. let counts = Dictionary(grouping: scores.filter { $0 != 0 }, by: { $0 }).mapValues { $0.count }

D. let counts = scores.reduce(into: [:]) { $0[$1] = 1 }

Solution

1. Step 1: Filter out zero scores

   The code filters scores to exclude zeros using filter { $0 != 0 }.

2. Step 2: Group remaining scores and count occurrences

   Using Dictionary(grouping:by:) groups scores by value, then mapValues { $0.count } counts how many times each score appears.

3. Final Answer:

   let counts = Dictionary(grouping: scores.filter { $0 != 0 }, by: { $0 }).mapValues { $0.count } -> Option C

4. Quick Check:

   Filter zeros, group by score, count occurrences = D [OK]

Hint: Filter zeros first, then group and count [OK]

Common Mistakes:

• Using uniqueKeysWithValues which overwrites duplicates
• Not filtering zeros before counting
• Using reduce incorrectly without counting