====== Assignment 1 ======
<del>Due date: Wednesday, May 29, 2013</del>
===Due date: Friday, May 31, 2013===

  * [[http://www.cse.yorku.ca/course_archive/2012-13/S/3311/files/a1.pdf|Specification]]

  * [[http://www.cse.yorku.ca/course_archive/2012-13/S/3311/files/3311_a1.zip|Source code]]

  * Solution
  * 
Cover Page: [[http://www.cse.yorku.ca/course_archive/2012-13/F/3311/report1/coverpage.pdf|pdf]] and [[http://www.cse.yorku.ca/course_archive/2012-13/F/3311/report1/coverpage.docx|doc]]

== Hints ==
   - Two useful implementations of SET are
     * [[http://docs.eiffel.com/static/libraries/base/two_way_sorted_set_chart.html|TWO_WAY_SORTED_SET]]
     * [[http://docs.eiffel.com/static/libraries/base/binary_search_tree_set_chart.html|BINARY_SEARCH_TREE_SET]]
Both are generic classes and require the argument to implement interface COMPARABLE (which is true about STRING and INTEGER in Eiffel. In addition they offer you search capabilities that may be useful. 

  - Returning VOID from feature
     * Result variable is **VOID** by default for all complex types (try declaring MY_MAP[STRING, STRING] and test what is returned by get feature
     * Result is set to **0** for all numerical types (e.g. INTEGER) 
     * If Result is complex (e.g. LIST or SET) and you want to per