[Year 12 SofDev] SD sample exam - A17
Mark
mark at vceit.com
Wed Aug 3 13:57:00 AEST 2016
Yes, I should have said C, not D.
(Selection sort is *sometimes* more efficient - for example, with small
datasets - but it seems to be the exceptional case.)
Either way, the answer is certainly not 'A'.
I think they misread their own question.
Regards,
Mark
On 3 August 2016 at 13:37, Robert Hallworth <hallworth.r at wcc.vic.edu.au>
wrote:
> What?
>
>
>
> Answer is C. I think they have swapped the thinking to the exact opposite.
>
>
>
> kind regards
>
>
>
> *Robert K Hallworth*
>
> Director of Learning Technology
>
> Mobile:0431 892 398
>
> Ext 640
>
> [image: Description:
> http://www.wcc.vic.edu.au/scm/pdf/WS%20&%20NWS%20Email%20Banner%2013%2005%2014.png]
>
>
>
>
>
> *From:* sofdev-bounces at edulists.com.au [mailto:
> sofdev-bounces at edulists.com.au] *On Behalf Of *Mark
> *Sent:* Wednesday, 3 August 2016 1:26 PM
> *To:* Year 12 Software Development Teachers' Mailing List <
> sofdev at edulists.com.au>
> *Subject:* [Year 12 SofDev] SD sample exam - A17
>
>
>
> Hi, sorting fans
>
>
>
> I refer to the SD sample exam question A17.
>
>
>
> *Question 17*
> Compared to quick sort, the selection sort algorithm, on average, is best
> described as
> *A.* being more complex and taking less time to sort a list.
> *B.* being more complex and taking more time to sort a list.
> *C.* being less complex and taking more time to sort a list.
> *D.* being less complex and taking less time to sort a list.
>
>
>
> The answer given is *A*.
>
>
>
> Since *when* is selection sort more complex and faster than quick sort?
>
>
>
> Wikipedia
> <https://en.wikipedia.org/wiki/Sorting_algorithm#Inefficient_sorts> says
> - under the heading of 'Inefficient Sorts' (with my emphases added)...
>
> "Selection sort is an in-place comparison sort. It has O(n^2) complexity,
> making it *inefficient* on large lists, and generally *performs worse*
> than the similar insertion sort. Selection sort is noted for its
> *simplicity*, and also has performance advantages over more complicated
> algorithms in certain situations."
>
>
>
> I think something is very wrong with the answer given in the solution. It
> should be D.
>
>
>
> Does VCAA stand by their answer?
>
>
>
> --
>
>
>
> Mark Kelly
>
>
>
> mark at vceit.com
>
> http://vceit.com
>
>
>
> Scanned by the Netbox from Netbox Blue <http://netboxblue.com/>
>
>
> Scanned by the Netbox from Netbox Blue <http://netboxblue.com/>
>
> _______________________________________________
> http://www.edulists.com.au - FAQ, Subscribe, Unsubscribe
> IT Software Development Mailing List kindly supported by
> http://www.vcaa.vic.edu.au - Victorian Curriculum and Assessment
> Authority and
> http://www.vcaa.vic.edu.au/vce/studies/infotech/softwaredevel3-4.html
> http://www.vitta.org.au - VITTA Victorian Information Technology
> Teachers Association Inc
> http://www.swinburne.edu.au/ict/schools - Swinburne University
>
--
Mark Kelly
mark at vceit.com
http://vceit.com
-------------- next part --------------
An HTML attachment was scrubbed...
URL: http://www.edulists.com.au/pipermail/sofdev/attachments/20160803/ebc67865/attachment-0001.html
-------------- next part --------------
A non-text attachment was scrubbed...
Name: image001.png
Type: image/png
Size: 69410 bytes
Desc: not available
Url : http://www.edulists.com.au/pipermail/sofdev/attachments/20160803/ebc67865/image001-0001.png
More information about the sofdev
mailing list