Statements (27)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
gptkb:university
|
| gptkbp:creditHours |
3
4 |
| gptkbp:department |
Computer Science
|
| gptkbp:focusesOn |
algorithms
data structures algorithmic analysis |
| gptkbp:fullTitle |
CS 161: Design and Analysis of Algorithms
|
| https://www.w3.org/2000/01/rdf-schema#label |
CS 161
|
| gptkbp:languageOfInstruction |
English
|
| gptkbp:level |
undergraduate
|
| gptkbp:offeredBy |
gptkb:Stanford_University
gptkb:spring Autumn Winter |
| gptkbp:prerequisite |
CS 106B
CS 106X |
| gptkbp:teaches |
gptkb:NP-completeness
dynamic programming graph algorithms divide and conquer greedy algorithms algorithmic problem solving data structure design |
| gptkbp:website |
https://web.stanford.edu/class/cs161/
|
| gptkbp:bfsParent |
gptkb:PRG-240
|
| gptkbp:bfsLayer |
7
|