|
CS/SE
Course Assessment |
 |
| |
Search: |
|
|
| |
|
|
Course
Numbers |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
CS 4336 |
| |
| |
| |
| |
| |
| |
CS 4386 |
| |
| |
| |
| |
| |
| |
|
Class
Learning Objectives
CS/SE 3345 Data Structures and Introduction to Algorithmic
Analysis
Ability to use asymptotic notations
Ability to perform simple algorithm analysis
A knowledge of basic proof techniques
Understand and use the following data structures:
link lists
stacks
queues
trees
hash tables
priority queues (binary heaps)
disjoint sets
Understand and use the following algorithms:
basic sorting algorithms
basic graph algorithms
|
|
|
|
|
|