Why maps are used in Go - Quick Recap

Recall & Review

beginner

What is a map in Go?

A map in Go is a built-in data type that stores key-value pairs. It allows you to quickly find a value by using its key, like a dictionary or a phone book.

beginner

Why do we use maps instead of arrays or slices?

Maps let you access data by a unique key instead of a numeric index. This makes it easier and faster to find specific information when the key is known.

intermediate

How do maps improve performance in Go programs?

Maps provide fast lookups, insertions, and deletions because they use a hash table internally. This means you can find or change data quickly without searching through all items.

beginner

Give a real-life example where maps are useful.

Maps are like a phone book where you look up a person's phone number by their name. In programming, you might use a map to store user information where the key is the username.

intermediate

What happens if you try to access a key that does not exist in a Go map?

If you access a key that does not exist, Go returns the zero value for the map's value type. You can also check if the key exists using a second return value.

What is the main advantage of using a map in Go?

A Fast access to values using keys

B Storing data in order

C Using numeric indexes only

D Automatically sorting data

Maps allow fast access to values by their keys, unlike arrays which use numeric indexes.

Which data structure does a Go map resemble in real life?

A Stack of books

B Phone book

C Queue line

D Calendar

A map is like a phone book where you look up a phone number by a person's name (key).

What does Go return if you access a map with a key that does not exist?

A Zero value of the value type

B An error message

C The last value stored

D A random value

Go returns the zero value for the map's value type if the key is missing.

Which operation is NOT efficient with maps?

A Finding a value by key

B Inserting a new key-value pair

C Deleting a key-value pair

D Accessing elements by numeric index

Maps do not support numeric index access; arrays or slices do.

What internal structure do Go maps use to provide fast lookups?

A Linked list

B Binary tree

C Hash table

D Array

Go maps use hash tables internally to achieve fast key-based lookups.

Explain why maps are useful in Go programming and give a simple example.

Think about how you find information quickly using a name or ID.

Describe what happens when you try to get a value from a Go map using a key that does not exist.

Remember Go's way of handling missing keys safely.