Why data structures matter for efficiency in Intro to Computing - Challenge Your Understanding

Challenge - 5 Problems

🧠 Conceptual

intermediate

Why choose the right data structure?

Imagine you have a list of names and you want to find if a particular name exists quickly. Which data structure helps you find the name fastest?

A A list, because you can check each name one by one.

B A hash set, because it can check if a name exists in almost constant time.

C A queue, because it keeps names in order and you can dequeue to find the name.

D A stack, because you can pop names until you find the one you want.

💡 Hint

Think about which structure lets you check membership without looking at every item.

A hash set uses a method called hashing to find if an item exists very quickly, usually in constant time. Lists, queues, and stacks require checking items one by one, which takes longer as the list grows.

❓ trace

intermediate

Trace the time to find an item in different structures

Given these data structures holding 5 items each, how many steps does it take to find the item '3'?

Structures: List [1,2,3,4,5], Set {1,2,3,4,5}, Queue [1,2,3,4,5], Stack [1,2,3,4,5]

A List: 3 steps, Set: 1 step, Queue: 3 steps, Stack: 3 steps

B List: 1 step, Set: 5 steps, Queue: 5 steps, Stack: 1 step

C List: 5 steps, Set: 3 steps, Queue: 1 step, Stack: 5 steps

D List: 2 steps, Set: 2 steps, Queue: 2 steps, Stack: 2 steps

💡 Hint

Remember how each structure stores and accesses items.

Lists, queues, and stacks require checking items one by one until the target is found. Sets use hashing to find items quickly, usually in one step.

❓ Comparison

advanced

Compare insertion times for data structures

Which data structure generally allows the fastest insertion of a new item?

A Array (fixed size) because you can add at the end quickly.

B Hash table because it places items using a hash function.

C Linked list because you can add a new node without shifting others.

D Binary search tree because it keeps items sorted automatically.

💡 Hint

Think about whether items need to be moved or shifted when inserting.

Linked lists allow fast insertion by changing pointers without moving other items. Arrays may require shifting if full. Binary search trees and hash tables have overhead for balancing or hashing.

❓ identification

advanced

Identify the data structure from its efficiency traits

This data structure allows fast search, insertion, and deletion on average, but can degrade to slow operations if poorly balanced. Which is it?

A Binary search tree

B Linked list

C Array

D Hash table

💡 Hint

Think about a tree that keeps items sorted but can become unbalanced.

A binary search tree offers fast average operations but can become slow if it becomes unbalanced, turning into a linked list in the worst case.

🚀 Application

expert

Choose the best data structure for a phone book app

You are building a phone book app that needs to store thousands of contacts and quickly find a contact by name. Which data structure should you use for the contact names to ensure fast search and efficient memory use?

A An unsorted list, because it is simple to implement.

B A stack, because it allows quick access to the most recently added contact.

C A hash table, because it provides very fast search but does not keep names sorted.

D A balanced binary search tree, because it keeps names sorted and allows fast search.

💡 Hint

Consider if sorting is important and how fast you need to find contacts.

A balanced binary search tree keeps contacts sorted and allows fast search, insertion, and deletion in logarithmic time. Hash tables are fast but do not keep order, which may be important for a phone book.