COMP2521 Final Exam

Locations

You have been assigned to a lab for the exam, based on your last name.

Please check the table below and make sure you go to the correct lab on the day

Surname/Last NameExam Location
A-Fkora
G-Ksitar
L-Pbrass (horn and bugle)
Q-Vflute
W-Zoboe

Exam Format

Sample Exams

Note: Ignore any questions about 2-3-4 trees or red black trees. We did not cover them in this course.

Sample exam 1

Sample exam 2

Prac Exam 2 Questions

questions

Note: for the djkstra's question, don't forget the dists have already been added together....

Exam Instructions

Start-of-Exam Instructions: End-of-Exam Instructions: Actual Exam Instructions: The prac exam consists of 10 Multiple Choice Questions, Short Answer questions and 5 programming questions. You have 10 minutes reading time and then 3 hours to complete the exam.

As always, it is a good idea to start with the simplest question - be mindful of the time, if you get stuck, try to move to the next question and come back to the problem later. Don't spend too much time on theory and leave yourself no time for programming questions or vice-versa.

To submit the multiple choice and theory sections, just press save.

For the programming questions, the submission instructions are detailed in the file for each question. When submitting your program, the system will run a couple of simple tests. The test code is available for all questions and if a test fails, you can use gdb, set a break point at the function you implemented, and step through the execution to see where things are going wrong.

To check what you have submitted, you can simply type the command '''submit''' on its own.

For all programming questions, you may create your own additional helper functions, but be sure to make them static.

To access the C reference card, the C manual Information or the algorithms almanac, right click on the desktop and select from the menu.

Don't forget you can copy and paste by simply high-lighting text to copy and clicking with the middle mouse button to paste.

Exam Tips and Feedback from Prac tests

I am not expecting everyone to finish all the programming questions. So don't panic if you don't get them all out. Especially the last one as you will likely be too pushed for time.

So try to use your time wisely.

For questions when you need compare algorithms do not say things like merge sort is faster or selection sort is slower. Use the exact time complexities. For example Bubble sort with early exit is adaptive and has a time complexity of O(n) on ordered data, whereas quicksort has a time complexity of O(n^2) for ordered data etc.

For some questions you may be required to type in a tree. You should do so in the following type of format

    5
   / \
  2  10
       \
       17
etc  

For programming questions:

Don't forget you can copy and paste by simply high-lighting text to copy and clicking with the middle mouse button to paste.

Other Exam Information

During the exam you will have access to the following C information You will be able to access it by right clicking on the desktop and selecting it from the menu.

During the exam you will have access to the following C Reference Card You will be able to access it by right clicking on the desktop and selecting it from the menu.

During the exam you will have access to the following algorithm almanac. Note this has been updated with extra material since the last prac exam. You will be able to access it by right clicking on the desktop and selecting it from the menu.