 |
.. (לתיקייה המכילה) | |
When I am trying to compile my program using "SmartEiffel" I keep getting this message: "Installation problem Please enter the path for the header files (...)" | |
|
This installation bug can be easily fixed by running the 'Wedit' program which is part of the SmartEiffel package: `Start menu -> Programs -> SmartEiffel -> Wedit The first time you invoke Wedit it will show a small message box, with the following text: "New path to compiler c:\....". This indicates that the problem has been fixed |
What is the difference between ''SmartEiffel" and "SmallEiffel"? | |
| "SmartEiffel" is a newer version of "SmallEiffel". |
How can I use the SmartEiffel compiler from the command line prompt? | |
|
This is actually very simple. Suppose the name of your root class is ABC and its creation method is called make: c:\my-eiffel-projects\prj1>compile -trace ABC make - You can change the "-trace" option to "-boost" to get a non-debug executable - Note that you do not have to mention the names of all other classes which are part of the program you are writing. Only the root class is needed. The Eiffel compiler will automatically find all the necessary sources. |
Should I implement the IHANDLER interface? | |
| No, This interface is implemented by the test program. |
Can I use advanced features of Eiffel? | |
| Yes. Your code may utilize any legal Eiffel facility, including features which were not covered in class |
How do I throw/catch an exception ? | |
| The EXCEPTIONS class in the Eiffel library offers all necessary services needed for throwing and/or catching an exception. This class is available under both compilers. |
What is the "procedure" for creating a new bank? | |
|
You may assume that new banks, new accounts, and new currencies, are only introduced thru the open_account method. If your program relies on some other convention it should be stated on the documentation. |
Which Eiffel class offers a dictionary functionality (maps keys to values) ? | |
|
The class is called HASH_TABLE in EiffelStudio, and DICTIONARY in SmartEiffel. Here is a little sample: fff is local d: HASH_TABLE[STRING,INTEGER] -- SmartEiffel: d: DICTIONARY[STRING,INTEGER] do !!d.make(10) -- 10 is the initial size -- SmartEiffel: !!d.make d.put("five", 5) d.put("six", 6) print((d @ 5) + "%N") -- Output: "five" end |
Do I have to use fast algorithms for searching/sorting/etc..? | |
|
No. Performance is not a main concern in this assignment. You can write/use naive code: O(N*N) for sorting, and O(N) for searching, are acceptable |