I will send it to a postnet near you overnight for R45.

http://www.amazon.com/Data-Structures-Using-C%2B%2B-Programming/dp/0619159073/sr=8-2/qid=1166017268/ref=sr_1_2/104-6961982-9548720?ie=UTF8&s=books

R200 + postage

it's got 2x pig ears so live with it.

i spent a lot of time with this book and you'll prob too and if i had to accept my wife , you can accept the book.]]>

How did it go for y'all?

Happy holidays!

:)-D]]>

I am suppose to finish my degree next year in ITM with only four modules to pass{Strategic Mangmnt 3A & 3B, COS311, COS321}. i need someone to clarify me wether i have to do java-COS214 as it appear as a compulsory module in my stream(ITM), but i did COS212 before java was introduced as a compuslory module.

And UNISA state that BSc Degree comprise of 30 modules of which if i do java i will have 31 modules on my credit/degree.

Plz somone clarify me......................

DJ BASS]]>

Call the lectures and give them crap- we demand a re-write and restructure!!!]]>

what I get is the following .... (but i dont think its right)

The following six expressions represent the running times of various algorithms in terms of the input size N:

N/1000 + 23

1000/N + 23

3 log 3 N

log N2

N2 - 23N

1023

Answer:

1023, 1000/N + 23, 3 log 3 N, N/1000 + 23, log N2, N2 - 23N

It this right ?]]>

Hope someone can help me, I am a bit stuck with this one. Question 8 c .... level-order ?

I dont know if I worked a bit crap through the text book or if I missed some info, but I cant recall level-order traversal, I know the inorder, preorder and postorder binary tree traversals ... but level-order?

Can someone please shed some light on this?

Thanks,

Esckay]]>

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]]>

1) Application of queues

2) Priority Queues

3) Hashing

4) Heap Sort

5) AVL Height Balanced Trees

6) Graph Implementation

7) Graph Topological Order]]>

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

]]>

those ones I can do

I need an example if possible

]]>

If anyone would be so kind, please mail me the username/password or the COSALL.

tmcarstens [a] gmail [dot] com]]>

This was a question in assignment 04. According to the solutions, you basically traverse to the leftmost node and that will be the smallest node in the BST. I am not entirely convinced that this efficient. Here's my argument:

1. Assume you have an initially empty BST.

2. Now assume that you enter the following values in order:

x[1]; x[2]; ...; x[n]

and let x[1] be the smallest element in the list of values.

Because the BST is initially empty, when x[1] is entered, it becomes the root of the BST and x[2]...x[n] follow the normal conditions. But if we traverse to the leftmost node now- we dont get the smallest value because the root is the smallest value. Am I missing something somewhere or is my logic sound?

Regards]]>

Regards

Laurence

]]>

Add me to your msn messenger

captain407@hotmail.com]]>

Did anyone else receive this TUT ?

I havent received it and I can see it available as a download on the web site. Can anyone please mail this to me, I would really appreciate it.

Thanks,

Esckays

mailto: eskcays@gmail.com ]]>

txs

ian]]>

I see that tut 103 contains the 2005 Exam....alas no model solutions...

Any chance that somebody has them?

]]>

Help me to complete a list of all possible sorting and searching algorithms. The changes of getting one of them in the xams is fairly strong. I know they will explain how this or that type of search or sort works but working through them now will help with time and easy points .

Sorting.

Bubble Sort

Selection Sort

Insertion Sort

Quick Sort

Merge Sort

Heap Sort

Bucket Sort

Searching

Ternary Search

Sequential Search

Binary Search

( is there any other sorts or searches ? )

]]>

Question: finding the largest element in an array

///////////////////////////

#include <iostream>

int largest(int first[], int temp, int count, int i)

{

if (count == (i+1))

return temp;

else

{

if (first

{

temp = first

i++;

return largest(first,temp,count,i);

}

else

i++;

}

}

using namespace std;

int main() {

int arr[3];

arr[0] = 3;

arr[1] = 7;

arr[2] = 4;

arr[3] = 3;

int temp = 1;

int count = 4; // size of array

int i = 0;

cout <<largest(arr,temp,count,i)<<endl;;

return 0;

}

Also does anyone have any old exam papers?]]>

1. Question 5b

2. Question 5d

Thanks]]>

Please find answers to your questions

Question 1:

There is a print error on tutorial letter 204, page 7, line 2:

d) Breadth First Traversal: V0 V2 V3 V2 V5 V4

Should the correct one be: V0 V1 V3 V2 V5 V4 ?

Question 2:

Malik, p237, Iterators.

How do we declare the following five types of iterators, what are their types?

Ã‚Â· Input iterators

Ã‚Â· Output iterators

Ã‚Â· Forward iterators

Ã‚Â· Bidirectional iterators

Ã‚Â· Random access iterators

Question 3:

For COS211-X, what do you emphasis on this module? Is how much the student understands the concept, or how much the student memorizes the concept? Do we need to memorize the codes appeared in Malik?

To understand the assignment type of questions very well, does it mean we could do well in our exam? Please do not put the fill- in-missing-words type of question in the exam as some other INF modules do, it's not a good method to measure how much you understand the concept.

Good luck for the exams

Lazarus

]]>