# review questions

Posted by aronl
Announcements Last Post
: Programming Students at UNISA School of Computing 06/19/2019 02:01PM
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
 review questions September 29, 2008 12:18PM Registered: 14 years ago Posts: 88 Rating: 0
I have uploaded a document on osprey called "review questions.doc" that contains more practise questions. If you would like your solutions to be checked you can place them on this forum.

regards
Lazarus Aron
 Re: review questions October 02, 2008 06:59PM Registered: 11 years ago Posts: 79 Rating: 0
Thanks. very useful.
 Re: review questions October 16, 2008 09:25AM Registered: 12 years ago Posts: 387 Rating: 0
Thanks Lazarus. The extra practice is confidence-building. Unfortunately some of the answers aren't that easy to publish here because they involve diagrams but I'll work through the others this morning.

Thanks for all your help this year!
 Re: review questions October 16, 2008 10:24AM Registered: 12 years ago Posts: 387 Rating: 0
Question 5:

Preorder : A - M in order
Inorder: CEDFBAHJIKGML
Postorder: EFDCBJKIKMLGA
 Re: review questions October 16, 2008 10:33AM Registered: 12 years ago Posts: 387 Rating: 0
Question 8:

[0] [1] [2] [3] [4] [5] [6]
[0] 0 1 0 0 1 0 0
[1] 0 0 0 1 0 0 0
[2] 1 0 0 0 0 0 0
[3] 1 0 0 0 0 1 1
[4] 0 0 0 0 0 0 0
[5] 0 0 0 0 0 0 0
[6] 0 1 0 0 0 0 0

0 1 4
1 3
2 0
3 0 5 6
4
5
6 1

Depth first: 0134562

When one does the depth first, if you have a choice of paths, do you go to the lowest number, or to the one with the "longest run"? This is easy when the vertex's are numbered, but what if they are string names for example.
 Re: review questions October 16, 2008 11:08AM Registered: 12 years ago Posts: 387 Rating: 0
Just some questions on weighted graphs...

1) If a node has only outgoing vertices, is it infinity on the shortest path?
2) If you aren't told where to start, should you start at a node with outgoing vertices.
 Re: review questions October 16, 2008 11:18AM Registered: 12 years ago Posts: 387 Rating: 0
Question 9

0 1 2 3 4 5
Smallest weight 0 3 15 4 @ @
Weight found T F F F F F

Smallest weight 0 3 8 4 11 15
Weight found T T F F F F

Smallest weight 0 3 8 4 11 15
Weight found T T F T F F

Smallest weight 0 3 8 4 10 15
Weight found T T T T F F

Smallest weight 0 3 8 4 10 15
Weight found T T T T T F

Smallest weight 0 3 8 4 10 15
Weight found T T T T T T
Sorry, only registered users may post in this forum.