Why slices are used in Go - Quick Recap

Recall & Review

beginner

What is a slice in Go?

A slice in Go is a flexible and powerful way to work with sequences of elements. It is like a window into an array that can grow or shrink in size.

beginner

Why are slices preferred over arrays in Go?

Slices are preferred because they are dynamic in size, easier to use, and more efficient for many operations compared to fixed-size arrays.

intermediate

How do slices help with memory efficiency?

Slices share the underlying array's memory, so they avoid copying data when passed around, making programs faster and using less memory.

intermediate

What are the three components of a slice in Go?

A slice has three parts: a pointer to the underlying array, its length (number of elements), and its capacity (maximum size before needing to grow).

beginner

Give a real-life analogy for slices in Go.

Think of a slice like a bookmark in a book: it points to a part of the book (array) and can move to cover more or fewer pages without copying the whole book.

What is the main advantage of using slices over arrays in Go?

A Slices can change size dynamically

B Slices use more memory than arrays

C Slices cannot be passed to functions

D Slices are slower than arrays

Slices can grow or shrink in size, unlike fixed-size arrays.

Which of these is NOT a component of a Go slice?

A Pointer to underlying array

B Capacity

C Index map

D Length

Slices do not have an index map; they have a pointer, length, and capacity.

How do slices improve memory usage in Go?

A By copying the entire array each time

B By using global variables

C By storing data in a linked list

D By sharing the underlying array's memory

Slices share the underlying array's memory, avoiding unnecessary copying.

What happens when a slice exceeds its capacity?

A It automatically creates a new underlying array with more space

B It deletes old elements

C It causes a runtime error

D It stops growing

Go automatically allocates a bigger array and copies the data when capacity is exceeded.

Which statement best describes a slice?

A A fixed-size collection of elements

B A pointer to a part of an array with length and capacity

C A map of keys to values

D A function that returns arrays

A slice points to an array segment and tracks length and capacity.

Explain why slices are used in Go instead of arrays.

Think about flexibility and performance.

Describe the structure of a slice and how it manages data.

Consider what parts make a slice and how it grows.

Practice

1.

Why are slices preferred over arrays in Go?

easy

A. Because arrays cannot store multiple values

B. Because slices use less memory than arrays

C. Because slices can change size dynamically while arrays have fixed size

D. Because slices are slower but more secure

Solution

1. Step 1: Understand array size behavior

   Arrays in Go have a fixed size defined at creation and cannot grow or shrink.

2. Step 2: Understand slice flexibility

   Slices are built on arrays but can dynamically change size, making them more flexible for varying data.

3. Final Answer:

   Because slices can change size dynamically while arrays have fixed size -> Option C

4. Quick Check:

   Slice size flexibility = A [OK]

Hint: Remember: slices grow, arrays don't [OK]

Common Mistakes:

• Thinking arrays can resize dynamically
• Confusing memory usage between slices and arrays
• Believing slices are slower than arrays

2.

Which of the following is the correct way to declare a slice of integers in Go?

var s _____

easy

A. []int

B. [5]int

C. int[]

D. slice int

Solution

1. Step 1: Recall slice syntax

   In Go, slices are declared with square brackets and no size: []type.

2. Step 2: Identify correct option

   []int uses []int which is the correct syntax for a slice of integers.

3. Final Answer:

   []int -> Option A

4. Quick Check:

   Slice declaration = []int [OK]

Hint: Slices use []type without size [OK]

Common Mistakes:

• Using fixed size like [5]int for slices
• Writing type after brackets like int[]
• Using invalid keywords like 'slice int'

3.

What will be the output of this Go code?

arr := [3]int{1, 2, 3}
slice := arr[:2]
slice = append(slice, 4)
fmt.Println(arr)

medium

A. [1 2 4]

B. [1 2 3 4]

C. [1 2 3]

D. Runtime error

Solution

1. Step 1: Understand slice and array relation

   The slice references the first two elements of arr: [1, 2], with length 2 and capacity 3.

2. Step 2: Append behavior on slice

   Appending 4 to slice: since current length 2 < capacity 3, it appends in place to the underlying array, setting arr[2] = 4. Thus, arr becomes [1 2 4].

3. Final Answer:

   [1 2 4] -> Option A

4. Quick Check:

   Append within capacity modifies underlying array = B [OK]

Hint: Append within capacity modifies shared array [OK]

Common Mistakes:

• Thinking append always reallocates a new array
• Expecting arr to grow to 4 elements
• Thinking append causes runtime error

4.

Identify the error in this Go code snippet:

var s []int
s[0] = 10
fmt.Println(s)

medium

A. Syntax error: slice declaration is incorrect

B. Slice s is nil and has no elements, so s[0] assignment causes runtime panic

C. No error, code prints [10]

D. Compile error: cannot assign to slice element

Solution

1. Step 1: Check slice initialization

   Variable s is declared but not initialized; it is nil with length 0.

2. Step 2: Understand assignment to s[0]

   Assigning to s[0] causes runtime panic because no elements exist yet.

3. Final Answer:

   Slice s is nil and has no elements, so s[0] assignment causes runtime panic -> Option B

4. Quick Check:

   Assigning to nil slice index = runtime panic [OK]

Hint: Initialize slice before assigning elements [OK]

Common Mistakes:

• Assuming slice auto-expands on index assignment
• Thinking code compiles with no error
• Confusing compile error with runtime panic

5.

You want to collect an unknown number of user scores efficiently. Which approach best uses slices?

1. Use a fixed-size array
2. Use a slice and append scores as they come
3. Use a map with indexes
4. Use a string to store scores

hard

A. Use a fixed-size array

B. Use a string to store scores

C. Use a map with indexes

D. Use a slice and append scores as they come

Solution

1. Step 1: Consider data size flexibility

   User scores count is unknown, so fixed-size array is not suitable.

2. Step 2: Evaluate slice usage

   Slices can grow dynamically and efficiently handle unknown data sizes by appending.

3. Step 3: Exclude other options

   Maps add overhead and strings are not suitable for numeric data storage.

4. Final Answer:

   Use a slice and append scores as they come -> Option D

5. Quick Check:

   Dynamic data collection = slice append [OK]

Hint: Use slices to grow lists dynamically [OK]

Common Mistakes:

• Choosing fixed arrays for unknown sizes
• Using strings for numeric data
• Overcomplicating with maps when slices suffice