It's UWAweek 47

help3001

This forum is provided to promote discussion amongst students enrolled in CITS3001 Advanced Algorithms.

Please consider offering answers and suggestions to help other students! And if you fix a problem by following a suggestion here, it would be great if other interested students could see a short "Great, fixed it!"  followup message.

How do I ask a good question?
Displaying the 2 articles in this topic
Showing 2 of 202 articles.
Currently 14 other people reading this forum.


 UWA week 43 (2nd semester, study break) ↓
SVG not supported

Login to reply

👍x2
helpful
2:41pm Sun 27th Oct, ANONYMOUS

Will follow through marks be given in the exam? E.g. lets say there were two questions relating to a problem which were 'propose a more efficient algorithm to solve this problem' and 'what is the time complexity of this algortihm', each worth 2 marks. I propose an algorithm that is more efficient than a brute force algortihm, however, it does not solve the problem correctly. If I successfully analyse the time complexity of that algorithm (despite the algorithm being incorrect), would I still get the 2 marks for the 'what is the time complexity of this algorithm" part? Thank you for your time!


 UWA week 44 (2nd semester, 1st exam week) ↓
SVG not supported

Login to reply

👍?
helpful
11:45am Mon 28th Oct, Andrew G.

ANONYMOUS wrote:
> Will follow through marks be given in the exam? > > E.g. lets say there were two questions relating to a problem which were 'propose a more efficient algorithm to solve this problem' and 'what is the time complexity of this algortihm', each worth 2 marks. I propose an algorithm that is more efficient than a brute force algortihm, however, it does not solve the problem correctly. If I successfully analyse the time complexity of that algorithm (despite the algorithm being incorrect), would I still get the 2 marks for the 'what is the time complexity of this algorithm" part? > > Thank you for your time!
I am sorry, but I am not going to make an official statement giving any guarantee about that. The official directions for any test is to answer the questions to the best of your ability. Having said that, you can probably figure out some of the extremes for yourself. For example, if someone were to answer Q7 from the sample exam (the dictionary one) by proposing "always return 1" as a "more efficient algorithm for solving this problem", so that they are able to successfully analyse its complexity as O(1), do you expect that that would deserve the marks for complexity analysis? The above example is hopefully demonstrative of why I am not willing to officially guarantee in writing that you will get the complexity marks even if your algorithm is incorrect. I am deliberately also not giving any guarantee that you will *not* get the marks. My advice, as above, is to simply answer the questions to the best of your ability, and you will be assessed on the ability you demonstrate. Cheers, Gozz

The University of Western Australia

Computer Science and Software Engineering

CRICOS Code: 00126G
Written by [email protected]
Powered by history
Feedback always welcome - it makes our software better!
Last modified  8:08AM Aug 25 2024
Privacy policy