help2200

It's UWAweek 21 (1st semester, week 12)

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?

2 articles posted by this ANONYMOUS person

Showing 2 of 126 articles.
Currently 1 other person reading this forum.

UWA week 19 (1st semester, week 10) ↓

Practice Test Answers 👍x1

1:52pm Tue 7th May, ANONYMOUS

Hi Sir, I saw in your email that if you got lots of responses you'd post the answers. I am just writing to also ask for them. Thank you

UWA week 15 (1st semester, week 6) ↓

Test 1 👍x2 (all 3)

11:59pm Fri 12th Apr, ANONYMOUS

No, the answer is A. "f(n) is O(g(n))" basically means the graph of f(n) will be bounded by the graph of g(n) at some point, and multiplied by some constant factor. And the notation is confusing because it's " ", but think of it as " " so O(n) O(...

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 1st semester help fora Computer Networks Data Structures and Algorithms Graphics and Animation Mobile and Wireless Computing Object Oriented Programming Open Source Tools and Scripting Software Requirements and Design Software Testing and Quality Assurance