help2200

It's UWAweek 48

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 2 articles in this topic

Showing 2 of 176 articles.
Currently no other people reading this forum.

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

Implementation VS Tarjan Results (both)

10:15pm Sun 2nd Jun, ANONYMOUS

Kruskal's algorithm has complexity of O(ElogV) but in class we learnt an implementation using lists where it comes out to O((E+V)logV). What would we be expected to use when discussing complexities in the exam?

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

Implementation VS Tarjan Results (both)

2:58pm Mon 3rd Jun, Amitava D.

ANONYMOUS wrote:

> Kruskal's algorithm has complexity of O(ElogV) but in class we learnt an implementation using lists where it comes out to O((E+V)logV). > > What would we be expected to use when discussing complexities in the exam?

I only expect you to know the complexity that has been discussed in the lectures.

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