• Groups
• COMP372 Design and Analysis of Algorithms

## COMP372 Design and Analysis of Algorithms

Owner: Oscar Lin

Group members: 384

Description:

Welcome to the COMP372 discussion forum. You are encourged to participate in discussions by posting

• your introduction to the group.
• a response to action requested in unit activities.
• a comment on a peer’s response.
• resources you wish to share with peers, including your comments on why they are useful.

Note: After you have completed the assignments, quizzes or final exam, do not discuss their contents on any forum or post them anywhere on the Internet. Doing so will be considered cheating and will be dealt with accordingly.

To know the participation marks for COMP 372 R2, please visit the following URL:

```
https://learning.athabascau.ca/d2l/le/content/14625/viewContent/423315/View
```

Brief description: This is for course discussion.
Type of group:

This group has a closed membership.

• ### More resources to help student in COMP 372 Course

By Kayode Orija June 2, 2022 - 3:26pm
Hi there, my name is Kayode Abraham Orija, here is various youtube links that i find will be very useful to other students in these courses https://m.youtube.com/playlist?list=PLDN4rrl48XKpZkf03iYFl-O29szjTrs_O (This guy is really good) This is...
• ### COMP372 Exercise 16.2-3

By Guangya Wang September 22, 2021 - 12:24pm
As the question describes, the order by increasing weight is the same with order by decreasing value. That means the first item ordered in this way has the biggest value per pound. By intuition, the first item must be put into the knapsack to get...
• ### COMP372 Abuses of asymptotic notation

By Craig Belair January 12, 2020 - 11:22pm
One of the most common abuses of asymptotic notation is the use of the "=" sign when representing set membership. For example, we might write f(x)=12x3+5x2+x+3 = Θ(x3). Clearly it would be more proper to write f(x)∈Θ(x3)....
• ### COMP372 PROBLEM 1-1

By Craig Belair January 12, 2020 - 11:21pm Comments (2)
In order to solve Problem 1-1, we first convert all times into microseconds:1 second = 10^6 microseconds1 minute = 60*10^6 microseconds1 hour = 3600* 10^6 microseconds1 month ~= 30*24*3600*10^6 microseconds1 year ~= 12*30*24*3600*10^6...
• ### Unit 3 Exercise 15.3-6 Discussion Question

By Danny Elliott August 6, 2017 - 2:57pm Comments (2)
Proof that finding the best sequence of exchanges for currencies exhibits optimal substructure when commission Ck = 0 for all k trades. Let U1, U2, ..., Un be a collection of currencies. We can represent all possible sequences from U1 to Un as a...
More blog posts

### Free HTML

This widget is not yet configured

### COMP372 Design and Analysis of Algorithms

This is for course discussion.