Statements (18)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
gptkb:university
|
| gptkbp:department |
gptkb:School_of_Computer_Science
|
| gptkbp:fullTitle |
gptkb:COMP252:_Algorithm_Design
|
| https://www.w3.org/2000/01/rdf-schema#label |
COMP252
|
| gptkbp:languageOfInstruction |
English
|
| gptkbp:level |
undergraduate
|
| gptkbp:location |
gptkb:Montreal,_Canada
|
| gptkbp:offeredBy |
gptkb:McGill_University
|
| gptkbp:prerequisite |
gptkb:COMP250
|
| gptkbp:rating |
3 credits
|
| gptkbp:topic |
gptkb:NP-completeness
dynamic programming algorithm design graph algorithms divide and conquer greedy algorithms |
| gptkbp:bfsParent |
gptkb:COMP251
|
| gptkbp:bfsLayer |
7
|