PrepAway - Latest Free Exam Questions & Answers

Which collection type should you use?

You are developing an application that includes a class named Order. The application will store a
collection of Order objects.
The collection must meet the following requirements:
Internally store a key and a value for each collection item.
Provide objects to iterators in ascending order based on the key.
Ensure that item are accessible by zero-based index or by key.
You need to use a collection type that meets the requirements.
Which collection type should you use?

PrepAway - Latest Free Exam Questions & Answers

A.
LinkedList

B.
Queue

C.
Array

D.
HashTable

E.
SortedList

Explanation:
SortedList<TKey, TValue> – Represents a collection of key/value pairs that are sorted by key based on
the associated IComparer<T> implementation.
http://msdn.microsoft.com/en-us/library/ms132319.aspx

3 Comments on “Which collection type should you use?

  1. Lord Vader says:

    sortedlists/dictionaries/hashtables have key/value pairs. so leaves sortedlists adn hashtables.

    hashtables can only be accessed by the key and data is stored according to hash code of hte key

    sortedlist can be accessed by the key and index because it is sorted. elements in list are sorted by the icomparable implementation of hte key or icomparer implementation when sortedlist is created

    E




    2



    0

Leave a Reply