help2200

It's UWAweek 47

help2200

This forum is provided to promote discussion amongst students enrolled in CITS2200 Data Structures and 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 4 articles in this topic

Showing 4 of 176 articles.
Currently 10 other people reading this forum.

UWA week 22 (1st semester, study break) ↓

answer structure for exam questions (all 4)

1:24pm Tue 28th May, ANONYMOUS

Hello, I am wondering when answering questions like these from the past exams: "Explain clearly Kruskal’s minimum spanning tree algorithm." [5 marks] or "Explain clearly the inorder and postorder traversals of binary trees" [5 marks] What are each of the 5 marks allocated for? Do we need to provide complete pseudocode in our explanation? Or is it sufficient just to describe in words the process and data-structures used by certain algorithms?

answer structure for exam questions (all 4)

4:10pm Thu 30th May, Amitava D.

ANONYMOUS wrote:

> Hello, > > I am wondering when answering questions like these from the past exams: > > "Explain clearly Kruskal’s minimum spanning tree algorithm." [5 marks] > or > "Explain clearly the inorder and postorder traversals of binary trees" [5 marks] > > What are each of the 5 marks allocated for? Do we need to provide complete pseudocode in our explanation? Or is it sufficient just to describe in words the process and data-structures used by certain algorithms?

I have mentioned this several times that clear explanation in English is sufficient. You should be able to judge (when you are doing a second year unit) whether you are explaining clearly. Can you convince yourself? If yes, that is a good explanation.

answer structure for exam questions (all 4)

11:38am Sun 2nd Jun, ANONYMOUS

Regarding structing how answer, since no marking key was given for the practice exams, is it fair to assume that the ability to explain the data structures well would grant you the full 5 marks? Or should we be giving examples too, to achieve the full marks for this question and others?

UWA week 23 (1st semester, 1st exam week) ↓

answer structure for exam questions (all 4)

8:39pm Mon 3rd Jun, Amitava D.

ANONYMOUS wrote:

> Regarding structing how answer, since no marking key was given for the practice exams, is it fair to assume that the ability to explain the data structures well would grant you the full 5 marks?

Yes, you will get full marks if I can understand that you have understood.

> > Or should we be giving examples too, to achieve the full marks for this question and others?

help2200 articles all ANNOUNCEMENTS recent articles login to post a new article help2200 topics from today and yesterday from the past week from the past two weeks ALL topics, most recent first	login chapter0 unitinfo research projects csforum csse-feedback csbreakdown cssubmit csmarks 2nd semester help fora Algebra Advanced Algorithms Cloud Computing High Performance Computing Intelligent Agents Professional Computing Relational Database Management Systems Systems Programming