Dear All,
You can view your final result and exam result by following this link: https://cgi.cse.unsw.edu.au/~give/code/login.php?app=/~give/Student/give.php. Your exam result and final result are shown in the fields exam and final, respectively.
Congratulations to the following HD winners:
Shao, Hui
Halden, Torjus
Shanthidewa, Nipuna
Shea, John Michael
Manandhar, Manish
Ding, Yihao
Zhang, Yi
Xu, Haonan
Hoare, Leo Richard
Wang, Yunhan
Xie, Pengcheng
Tian, Zhu
Qiu, Yu
Poona, Srihari Saishar
Well done guys!
Note that if your final result denoted in the field final is at least 50, you have passed this course. If your final result is between 40 and 49, you will be given a supplementary exam. However, your final result will be at most 50 (Pass) after the supplementary exam. CSE Student Office will inform you of the time and venue of the supplementary exam soon.
Wish you all the best in the future.
Cheers,
Hui
Dear All,
I have scheduled two sessions of consultations for the final exam:
Session 1: 9-12 2-5pm Wed
Session 2: 9-12 Thursday
Venue: my office K17-501D. After you come to level 5, call me on 56572 using the phone on the wall near the lift.
Cheers,
Hui
Dear All,
Your assignment 4 results are available. If you have any queries about your results, contact Umair asap. His email is available by clicking Staff in the left pane of the course homepage.
I have computed your total assignment marks and your ranks with respect to total assignment marks. The relevant fields are:
assn4: your assignment 4 marks
total_assn: your total assignments marks which is the sum of all the four assignment marks
assn_rank: your relative rank in the whole class, where = means equal ranking. For example, 3=/110 means you are the 3rd with some other students of the whole class with 110 students., and 10/110 means that you are 10th.
To view your results, use this link to sign in:
https://cgi.cse.unsw.edu.au/~give/code/login.php?app=/~give/Student/sturec.php
I did not release marks distribution as rank can reflect you standing better.
Cheers,
Hui
Dear All,
The exam will be held in CSE labs. Please use your zIDs and zPasses to check your labs and seats here: https://cgi.cse.unsw.edu.au/~cs9024/18s1/seating/final/register.cgi/allocations.
Cheers,
Hui
Dear All,
This is a reminder that the deadline is tomorrow midnight. Note that there is a detour to the submission page. Click on any item of Assignment Four, then click on Assignment Four at the top, and then click on Make Submission.
Cheers,
Hui
Dear All,
The previous spec is not precise. I have made it clear and added a sample output to Introduction to the sample main() .
If your output has a different format but gives the correct BFS order, no penalty will be applied.
Cheers,
Hui
Dear All,
A number of students requested a deadline extension due to concurrent assignments. I have extended the deadline to 23:59 Wed June 6. However, I strongly recommend you guys finish it asap.
Cheers,
Hui
Dear All,
There is a mistake in the email you received today about COMP9024 exam. Please be advised that COMP9024 exam is a written exam without using computer.
Cheers,
Hui
Dear All,
Our last lecture will start at 6pm tomorrow at CLB 8, the same room as before. I will finish randomised algorithms first and then talk about the final exam, including scope, question types and sample questions.
Cheers,
Hui
Dear All,
Your assignment 3 results are available. Use the same procedure as before to view your results, that is, either collecting your submission with the breakdown of your marks via Assignment Page or viewing it directly using command "9024 classrun -sturec" on a CSE machine, where assn3 is the field for assignment 3.
Contact Umair directly if you have any questions about your results. His email can be found by clicking Staff in the left pane of course homepage.
Cheers,
Hui
Dear All,
I have released a sample main() for testing your program. It is inside MyGraph.c. An introduction to the sample main() is also available to help you quickly understand how the sample main() works.
Please let me know if you find any errors.
Cheers,
Hui
Dear All,
I have made ShortestPath() function optional. You will get 2 bonus marks if you apply Dijkstra’s shortest path algorithm using a heap-based priority queue to correctly implement this function with a time complexity of O((m+n) log n), where m and n are the number of edges and the number of vertices of graph g.
Cheers,
Hui
Dear All,
In the last assignment, you need to implement Dijkstra's algorithm using a heap-based priority queue where keys can be updated. I explained how to update a key in a heap-based priority queue for this assignment in the lecture last night after I finished Dijkstra's algorithm. You can watch the lecture video for details. Two key points are: 1. Each vertex in the linked list of vertices should have a pointer to its entry in the heap-based priority, and this pointer neds to be dynamically updated when the position of its entry changes due to up-heap or down-heap bubbling. 2) When a key is changed, up-heap or down-heap bubbling needs to be done in order to restore the heap-order property.
Cheers,
Hui
Dear All,
I have made some changes to assignment 4. Specifically, I have changed all struct identifiers to pointers. The other contents remain the same. Please download the specs and MyGraph.C. Thanks Leo for pointing this out.
Cheers,
Hui
Dear All,
I have released the last assignment as some students have completed assignment 3. Please finish assignments 3&4 asap so that you have time to prepare for the final exam.
In the lecture last night, I discussed assignment 3 and gave two possible extensions to adjacency list representation given in the lecture notes.
Cheers,
Hui
Dear All,
Your assignment 2 results are available. To view your results via a broswer, use the link https://cgi.cse.unsw.edu.au/~give/code/login.php?app=/~give/Student/give.php, and select current session and COMP9024.
To see the breakdown of your marks, go to the assignment 2 page and click on "Make submission". Then click on "Collect submission".
If you have any doubts about your marks, please contact Umair (email:u.tariq@unsw.edu.au) asap.
Cheers,
Hui
At the beginning of the lecture last night, I discussed assignment 3. If you did not attend the lecture, watch the lecture video.
Cheers,
Hui
Dear All,
First, many thanks to several students who found a number of errors/typos. Please download the specs and MyTaskScheduler.c again.
You need to use two heap-based priority queues, one storing all the tasks and using release times as the keys and one storing all ready tasks with deadlines as the keys.
Before coding, work out the algorithm for the task scheduler and analyse its time complexity to ensure that it meets the time complexity requirement.
Cheers,
Hui
Dear All,
I just released Assignment 3.
What you need to do:
1. Read the specifications.
2. Download MyTaskScheduler.c which contains the basic data structures and functions as well as a sample main method for testing your program.
3. Download the four text files samplefile1.txt, samplefile2.txt, samplefile3.txt, and samplefile4.txt, and store them in the same folder containing MyTaskScheduler.c. These four text files are used in the sample main method.
If you find any errors/typos, contact me asap. Bonus marks will be given to students who found errors.
The deadline is the midnight of May 19. There will be no deadline extension. Please start working on it asap.
Cheers,
Hui
Dear All,
Due to many requests, I have extended the deadline to 23:59 May 2 (next Wed). I discussed the clone and merge function at the begining of the lecture tonight.
Cheers,
Hui
Dear All,
As you may have noticed, there is a missing ; in main. I have fixed it. Please download main again. Thanks to Arthur Pegios and Hao An for pointing it out.
Cheers,
Hui
Dear All,
I have added a sample main to MyAVLTree.c for testing purpose. You need to create a text file named file1.txt to include a set of items with distinct keys.
Cheers,
Hui
Dear All,
Umair has marked all the submissions. To collect your submissions, follow this link:
https://cgi.cse.unsw.edu.au/~give/code/login.php?app=/~give/Student/give.php
You need to log in using your z-pass, and select this session and COMP9024 as well as assn1 (for assignment one).
Or click on Make Submission on Assignments page, and you will find the Collect Submission button.
Or log into your CSE account and type the following command:
9024 classrun -sturec
It will list all your marks, where the assn1 field shows your assignment 1 marks and the bonus field shows your bonus marks you have earned so far.
Marking scheme:
Total marks: 10
1. DLList *CreateDLListFromFileDlist(const char *filename): 2 marks
2. void printDLList(struct DLList *u ) : 1 mark
3. DLList *cloneList(struct DLList *u). 1 mark
4. DLList *setUnion(struct DLList *u, struct DLList *v): 2.5 marks
5. DLList *setIntersection(struct DLList *u, struct DLList *v): 2.5 marks
6. void freeDLList(struct DLList *u): 1 mark
Time analysis: 10% for each function.
If you have any questions, contact Umair (email: u.tariq@unsw.edu.au) as soon as possible.
Cheers,
Hui
Dear All,
The correct prototypes of DeleteNode and Search are as follows:
int DeleteNode(AVLTree *T, int k) {}
AVLTreeNode *Search(AVLTree *T, int k) { }
I have fixed the typos in both specs and MyAVLTree.c. Thanks Sai Poona for pointing this out.
Cheers,
Hui
Dear All,
Again, it's an individual assignment. The deadline is 23:59 28 April.
Cheers,
Hui
Dear All.
It's extended to 23:59 Wed 4 April due to a large number of requests in the lecture tonight. This is a firm deadline.
Cheers,
Hui
I have added a sample main function and two text files (file1.txt and file2.txt) for testing your program. The sample main is included in the MyDLList.c.
Cheers,
Hui
Both are available now.
Dear All,
The first assignment is now available. If you downloaded it before, please download it agian as I have made a major revision to both specfications and the code template MyDLLlist.c.
All the basic data structures and function prototypes are given in MyDLList.c. Complete functions for creating a node and a doublly linked list are already given. You can add your own helper functions and test code in main().
Since I have not finished linked lists, the new deadline is 23:59 1 April.
I will discuss this assignment in detail in next lecture. However, I would like to recommend you start working on it ealier.
If you have any questions, feel free to post them to the forum or email them to me.
Cheers,
Hui
The input from command line will be taught next week. You can read the relevant slides for Week 2 in advance.
Cheers,
Hui
The Lecture recording of first lecture is available now. Click on "Lecture Recordings" in the left pane. Let me know if you have any issues.
Cheers,
Hui
Dear All,
The first homework ia available. Under Course Work in the left pane, click on Homework, then you can find it.
Cheers,
Hui
Dear All,
The first lecture will start at 6pm at CLB 8 this Tuesday.