Hour 16

1: Why would you want to choose an Array object over an ArrayList object? Why would you choose an ArrayList object over an Array object?
A1: An Array object has a set size, whereas an ArrayList object can grow as items are added to it.
2: The Array class internally allocates contiguous blocks of memory. Does the stack and queue do the same? Why or why not?
A2: No, they don't. Stacks and queues are implemented more like linked lists than arrays. You cannot index a Stack or Queue object in the same way you can index an Array object.
3: What happens when you add a hash table element that has the same key to an element already in the hash table?
A3: You will receive an ArgumentException.

Get Sams Teach Yourself Visual C++® .NET in 24 Hours now with the O’Reilly learning platform.

O’Reilly members experience books, live events, courses curated by job role, and more from O’Reilly and nearly 200 top publishers.