The marks for assignment 2 have now been finalised. In some cases the auto-testing results and preliminary marks for the complexity analysis have been further adjusted. You can check your final mark on WebCMS3 or by using the following command:
9024 classrun -sturec
You can also fetch your marked assignment, with some feedback, from WebCMS3 or by using
9024 -collect assn2
There were cases of plagiarism, sadly, even though only very few. If your mark is shown as 0 and you cannot fetch your marked assignment anymore, then you can expect a separate email from me.
Some of you have asked me what statements are permitted in pseudocode. Generally speaking, this depends on the context and shared background of the writer and the reader. The writer of pseudocode should always make sure that sufficient detail is provided for the reader (a member of the programming team, a student studying a textbook, ...) to know exactly how to implement it and how to determine the time complexity.
Applied to the exam for this course, this means that:
tree = rotateLeft(node)
of which we have said that it requires constant time, O(1).
I'm using a standard queue that should be implemented by a dynamic, singly-linked linked list in such a way that both enqueue() and dequeue() take O(1) time.
Just a reminder that tomorrow (Friday) I'm offering a pre-exam consultation from 2-4pm in room 401K, K17.
Meanwhile, if you haven't filled out the myExperience evaluation yet, please note that today is the last chance for you to do so. I was very impressed and happy to see that the participation rate already has surpassed the 50% mark, and I thank everyone for your effort and participation.
Some of you expressed an interest in the additional topic that I would have presented if I hadn't had to cancel the lecture in week 11. I'll polish the draft slides that I had prepared, and I promise to add them to the webpage under Lectures -> Week 13 -- under one condition: I will do so as soon as the response rate for the myExperience evaluation has reached 35% (we're currently at 21.6%).
Please fill it out!
For anyone with questions about the assignment, there will be an extra consultation on Monday (16 October) from 11:10am to 12 in room G02 (ground level, building K17). This is in addition to the Help Lab on Tuesday.
Please note that there will be no lecture or consultation tomorrow.
I wasn't at my best last week when I got hoarse midway through the lecture. I have almost but not quite fully recovered. The good news is that you have more time now to finish your assignment. All essential topics will still be covered; I will skip the introduction to the design and analysis of randomised algorithms, which would not have been examinable anyway.
If you were planning on coming to the consultation to discuss your mid-term marks, you can still do so in week 12 or 13 of course
To help you understand better your scoresheet, the maximum scores for each block are shown below.
Question 6 a) Gives the correct answer b) Gives the correct vertex, correct degree c) Gives a correct answer d) Gives the correct answer 3.00 e) Shows current vertex and queue e) Vertices are added at end of queue e) Gives the correct visiting order e) Gives the correct states of the queue 5.00 Total 8.00 / 8.00 Question 7 Uses appropriate pseudocode notation Uses correct program logic 1.50 Algorithm is correct and complete 4.00 Gives the correct complexity Gives correct explanation 1.50 Total 7.00 / 7.00
Your result in the mid-session exam, including detailed feedback on the marks for your answers, is now available from your CSE account using
9024 classrun -collect mse
If you wish to further discuss your marks with me, please come to one of my next consultation sessions. You should also come and see me in case your overall score is below 12.5.
Congratulations to Xu, Feng; Yerneni, Tarun Prasad; and Chen, Anqi on scoring a perfect 25/25, well done.
Just a reminder about the weekly help lab: If you are having any questions or problems with assignment 2, please come to CSE Clavier Lab (Room LG20, Building K14) on Tuesdays between 2 and 4pm. You can use the lab computers, and a tutor, Shanush, will be around to answer any questions you might have.
Assignment 2 has now been released. The main topic is problem solving with graph data structures and graph search. Since the assignment gives you a lot of freedom to develop your own approach to the problem, readability of your program will be very important. Please make sure to adhere to the principles of structured programming and use good commenting.
Pay heed also to the following advice from the Tao of Programming (Book 3):
Thus spake the Master Programmer:
"When a program is being tested, it is too late to make design changes."
The marks for assignment 1 have now been finalised. In some cases the auto-testing results have been further adjusted manually. You can check your final result on WebCMS3 or by using the following command:
9024 classrun -sturec
You can also fetch your marked assignment with some feedback from WebCMS3 or by using
9024 -collect assn1
Some information about the mid-session exam next week (21 September):
Please bring your Photo Student I.D. Card
Please be there at 6pm, the test will start at 6:15pm
Calculators, phones and watches are not allowed and must remain in your bag.
For complete instructions see: instructions.pdf
Assignment 1 has now been released. The main topics are C control structures, abstract data types and dynamic data structures. You will also have to provide the time complexity of some your implemented functions, which is going to be the topic of the upcoming lecture next week.
The assignment is due Wednesday 30 August at 23:59pm (week 6).
A reminder about the weekly help lab starting tomorrow (Tuesday). If you are having difficulties with any of the programming homework, please come to CSE Clavier Lab anytime between 2 and 4pm to use the lab computers for solving the exercises. A tutor, Shanush, will be around who will answer any questions you might have about them or the programs from the lecture.
Clavier Lab is room LG20 in Building K14 (Old Main). The easiest way to find it is to follow a sign outside Keith Burrows Theatre (Building J14) that points to "CSE Computer Labs".
Dear COMP9024 Student,
Welcome to this year's course.
This is a reminder that the course will begin in week 1 on Thursday (27 July) from 6-9pm in Rex Vowels (Building F17).
Meanwhile, have a look at the course webpage www.cse.unsw.edu.au/~cs9024 . Read through the "Course Outline" to learn more about the contents of the course, the assessment and recommended textbooks.
See you next week,