Announcements | Last Post | |
---|---|---|

SoC Curricula | 09/30/2017 01:08PM | |

Demarcation or scoping of examinations and assessment | 02/13/2017 07:59AM | |

School of Computing Short Learning Programmes | 11/24/2014 08:37AM | |

Unisa contact information | 07/28/2011 01:28PM |

old xams October 03, 2006 10:21AM |
IP/Host: ---.saix.net Registered: 12 years ago Posts: 5 Rating: 0 |

Re: old xams October 03, 2006 02:06PM |
IP/Host: ---.cache.isnet.net Registered: 14 years ago Posts: 1 Rating: 0 |

Re: old xams October 03, 2006 03:33PM |
IP/Host: ---.cache.isnet.net Registered: 13 years ago Posts: 133 Rating: 0 |

Anonymous User
Re: old xams October 03, 2006 06:54PM |
IP/Host: 196.22.156.--- Rating: 0 |

Re: old xams October 04, 2006 08:55AM |
IP/Host: ---.unisa.ac.za Registered: 14 years ago Posts: 88 Rating: 0 |

Hi here are some solutions for the 2004/2005 big oh questions

2004 question 1b)

algorithm A - O(n) as n increases by 10 the running time also increases by 10.

algorithm B - O(n2) (that's n squared) as n increases by 10 the running time increases by 10 squared (ie 100).

algorithm C - O(log n)(thats log to the base 10) the running time increases slowly. Running time T = 10 log n - 10.

When you see that the running time is increasing slowly it is most likely a log function.

2005 question 1a)

Algorithm A O(n) see A above

Algorithm B O(n log n) (thats log to the base 10) Running time T = 2n log n.

If you look at this algorithm you will notice that it is not quite O(n) nor is O(n squared). It is someting in between hence it most likey O(n log n). From this you can determine that T=2n log n.

regards

Lazarus

2004 question 1b)

algorithm A - O(n) as n increases by 10 the running time also increases by 10.

algorithm B - O(n2) (that's n squared) as n increases by 10 the running time increases by 10 squared (ie 100).

algorithm C - O(log n)(thats log to the base 10) the running time increases slowly. Running time T = 10 log n - 10.

When you see that the running time is increasing slowly it is most likely a log function.

2005 question 1a)

Algorithm A O(n) see A above

Algorithm B O(n log n) (thats log to the base 10) Running time T = 2n log n.

If you look at this algorithm you will notice that it is not quite O(n) nor is O(n squared). It is someting in between hence it most likey O(n log n). From this you can determine that T=2n log n.

regards

Lazarus

Re: old xams October 05, 2006 11:43PM |
IP/Host: ---.3g.vodacom.co.za Registered: 14 years ago Posts: 240 Rating: 0 |

Hi,

I have recently moved and have not received any post from UNISA lately. Can anyone please send me exam papers to esckays@gmail.com

Did we receive any answer to the exam papers ? If not, does anyone have any suggested solutions.

Please help ....

Thanks,

Esckays

I have recently moved and have not received any post from UNISA lately. Can anyone please send me exam papers to esckays@gmail.com

Did we receive any answer to the exam papers ? If not, does anyone have any suggested solutions.

Please help ....

Thanks,

Esckays

Re: old xams October 06, 2006 10:31PM |
IP/Host: ---.3g.vodacom.co.za Registered: 14 years ago Posts: 240 Rating: 0 |

Hi,

I completed the exam tonight and made a word doc. Anyone want to double check my answers and discuss them ?

Mail me at esckays@gmail.com

Cheers,

Esckay

I completed the exam tonight and made a word doc. Anyone want to double check my answers and discuss them ?

Mail me at esckays@gmail.com

Cheers,

Esckay

Sorry, only registered users may post in this forum.