A programmer needs to store a list of usernames that will be processed one by one in a program. The number of usernames is known and will not change. Which data structure offers the best performance for sequentially iterating over this fixed-size list?
Hash table
Queue
Array
Linked list
An array is ideal when the number of elements is fixed. Because its elements are stored in contiguous memory, each username can be accessed directly by index in O(1) time, giving the fastest possible iteration performance. A linked list must follow pointers from node to node, a hash table provides no defined order, and a queue enforces FIFO removal rather than random indexed access, all of which make them less efficient for this scenario.
Bash is our AI bot, trained to help you pass your exam. AI Generated Content may display inaccurate information, always double-check anything important.
All IT & Cybersecurity Package plans include the following perks and exams .
Our pricing is simple. Full access to all certifications and exams in each package, for one price.
As many practice tests for as many topics as you want.
Use study mode non-stop, no limits.
Access to our AI assistant, Bash, trained to help you pass your exam.
Track your scores over time in study mode and report cards.
See how you improve over time, and where you need to focus.
Access our store with even bigger discounts than before.
Unlimited access to all performance questions and be prepared for the real thing.
All IT & Cybersecurity Package plans include unlimited access to the following study materials.
Create an account or sign in to access our study materials.