Monash University > School of Computer Science and Software Engineering > CSE3322 > News
Solutions for Assignment 3-4 are online in the assignment section.
Just to let you know that the master solution to assignment 4 will be posted on the web after the assignment sbmission will have closed, so that you can check the validity of your solutions before the exam.
GOOD LUCK with the exam!
Regarding Assignment 4: The grammar given in the assignment generates a shift/reduce conflict for X.
This means you will generate two entries for the corresponding field of the parsing table (one shift entry, one reduce entry) if you apply the table generation algorithm correctly.
For the parser to work, this conflict has to be resolved. The easiest way to do so is to always choose one operation over the other (in this case shift over red uce).
For the assignment both solutions count as correct: putting both entries into th e field or resolving them and only putting the shift entry in.
At last I had time to evaluate the solutions to the 'player' function and decide on the chocolate price (sorry about the delay, if it is any consolation, the prize winners now get double the chocolate!)
I evaluated the 11 answers I got in terms of both efficiency (who did it in less time) and accuracy (who got a better solution). I decided not to test on style, etc, because it is too controversial :-)).
The programs were tested by obtaining the solution to each possible code one can possibly form with a board-size of X and Y colours. Three situations where considered: X = 3 and Y = 5, X = 4 and Y = 6, X = 5 and Y=6. For each situation, the test was run 3 times. After the three runs of every situation were completed, I computed (a) the average time and (b) histograms with the average number of times for each situation it took to guess a code in 1 step, in 2 steps, in 3 steps, in 4 steps, etc. Note that some of the programs included a random factor, which meant the quality of the solution could vary from run to run, thus the need for an average.
The winner is 18574149 This solution was not the best but it was the best achieved in a "reasonable" amount of time. The winner can claim 8 caramel koalas.
The best solution was given by 18547044 followed closely by that of 18583431 However, none of the two had finished the third scenario after 10 hours (the winning solution finished in less than 20 minutes) and the solution of 18583431 had not even finished the second scenario after 10 hours (the winning solution finished in 0.4 seconds while the best solution finished in 300). Thus, the best solutions did not win, but 18547044 can claim 4 caramel koalas while 18583431 can claim 2.
The programs of another 4 people (18563406, 18620108, 18147003, and 18246966) returned solutions that were not too bad in half of the time taken by our winner, so I decided to give them also a price. They can each claim 2 caramel koalas.
The other 4 solutions got either a pretty bad solution or an erroneous one. Still, very good try!
That's all, the winners can drop by my office any time to collect their prices. Thanks to the 11 people who participated!
Remember, on the lecture of Tuesday 19th of October, I will be reviewing the ML and Programming Language Concepts and Issues parts. In particular, I will be discussing the solutions to some new sample exam questions you can find here. These questions do represent the kind of questions you will be getting in the exam (and the amount of space you will get in the exam to answer them). I will expect those who come to the revision lecture to have already tried to solve all questions. Only those who come to the lecture will get the answers (so don't come asking for them afterwards unless you have a solid excuse).
The maximum amount of time it should take you to solve each question can be computed (roughly, don't expect it to be exact or even always the case) by converting the mark into minutes and adding an 80%. For example, a mark of 10 should correspond more or less to a maximum of 18 minutes. Although, to do the exam comfortably, it should take you about 15.
We have now added solutions to the sample exam 2004. It is extremely important to notice that the two sample exams (2003 and 2004) available on our web page correspond to previous year's exams and, therefore, might not represent the kind of exam you will get this year. In particular:
Hope this helps.
BTW, for some reason my web viewer cuts the top of the sample exam 2004. You might need to download the file and then view it.
Please not that there is a deadline extension of 1 week for Assignment 3,
as we illustrated the example code for recursive descent parsing in ML in the tutorials a little later than originally intended.
The revised deadline therefore is 15/10/04
I have now finished marking the assignments. Please go to the general office and collect them, since this Friday Cameron will go over a solution to the assignment + common mistakes I found while marking.
And talking about marking. About 50% failed (or did not hand in) the assignment. That is quite a lot. And no, I do not think I marked harshly (if I have given a 0 for everything I said I would, many more would have failed). Many people did not even try (very few did play and all_codes, let alone player), which is quite disappointing. Keep it that way, and 50% will fail the exam and the subject.
Anyway, be gentle with Cameron (it was me who marked the assignments, not him), and congratulations to the (also many) who did very very well (in particular to the 11 people who did player!)
It was nice to teach you, I have to say I was quite happy during the lectures, you behaved quite well, I would have wished for more questions, but then again, nothing is perfect. Hope you found the lectures interesting.
And remember, I will keep my tuesday consultation hour (once I come back from Europe on the 4th of October), so come and ask questions about ML or the Prog. Princ. part (other questions to Bernd please!)
See you at the revision class!
Submission for assignment 2 is now open (sorry for the delay, I forgot yet again to open the submission).
IMPORTANT NOTE: your code has to work for the particular version I will use to test it, which is the Standard ML of New Jersey, Version 110.0.7 for Linux (the same you have in the ra-clay computers).
The slides for the next 4 lectures (Programming Language Concepts and Issues) are now avaiable for download.
A possible solution to assignment 1 is now available in the assignments page.
IMPORTANT: NEW TUTORIALS AND SAMPLE EXAMS
Two issues were raised at the staff/student meeting yesterday:
IMPORTANT: CORRECTION TO ASSIGNMENT 2.
The Mastermind structure, must contain not only the 'play' function but also all others (i.e., playable, code, validguess, and score) required by the assignment.
This is because I need to be able to test your solution and if you
hide it I will not be.
Also, there was a typo in the type of function score, which should be fn: row -> row -> (int*int) rather than fn: row -> row -> (int,int) as it appeared in the assignment.
These (and some other minor typos) are now fixed in the on-line version of the assignment.
Do not forget, tutorials are scheduled for this week and the next.
The first assignemnt is now marked and a printed version of your solution with my comments is ready for you to collect (from 9:30 till 10:30 and from 14:30 till 15:30, at the main office, ground floor building 75). Please do so before tomorrow's lecture (since I will go through the solution and common mistakes during the lecture).
The second assignment is now available. Enjoy!
As you might have noticed, /cs/cc/bin/submit was not working for cse3322. The problem has now been fixed. Enjoy!
Also, please submit your work even if you have already been marked by Cameron (I want to have everyone's code). And remember to include the declaration at the top of the file (the one indicating the work is indeed yours).
The new tutorial will take place in 106(19) on the appropriate wednesdays from 11am till noon.
There is a new tutorial available (Wednesdays at 11am). This tutorial is open for those people not currently allocated by Allocate+ who attended the tutorials last thursday and friday. If you are one of those people and you wish to attend, please send me an e-mail.
Remember that, according to our schedule, there will be tutorials this coming week, i.e., on the 3rd 5th and 6th of August. I know Allocate+ is telling you differently (for some reason it still has last year's schedule) so disregard what Allocate+ says, I am trying to fix it.
Also, I am trying to schedule a new tutorial (since some of the tutorials seem to be far too full), I will let you know as soon as I organise it.
You can now download a marking guide for assignment 1 from here
Assignment 1 has now been updated to indicate that, since the idea is for you to practice simple ML programming and write your own simple functions, you are only allowed to use pre-defined functions if they are part of the top-level, i.e., if they do not require you to either qualify them with the structure's name or to ``open'' a structure before using them. Thus, functions like tl/1, ord/1 , and >/2 are allowed, while functions like Char.IsAlpha and Char.toUpper are not, (they are part of the Char structure but not of the top-level).
We have added black/white and postscript versions to the colour pdf versions previously offered for lecture notes. All versions now contain 4 slides per page, which is more paper conscious and I think perfectly readable. Contact me if special versions (e.g., less slides per page, longer fonts) are needed.
Welcome to the CSE3322 Semester 2, 2004 courseware page. Currently there is little information about the subject. Watch this space for more news as it breaks.
If there are any problems with the site, please contact Maria Garcia de la Banda or Bernd Meyer.
Big thanks to Kym Fergusson and Debbie Pickett who let us copy their CSE1303 web page structure, and to anyone else who over the years contributed to such structure.
[ Top | Home ]
Last Updated: Monday, 18-Jul-2005 10:10:52 EST