CSCI 2082 - Data Structures and Algorithms

1. Fundamental computing algorithms, e.g O(N log N) sorting algorithms; tree-processing algorithms
2. Asymptotic algorithm complexity analysis
3. Recursion: The concept of recursion, recursive mathematical functions, simple recursive procedures, divide-and-conquer strategies, recursive backtracking, implementation of recursion
4. Algorithmic strategies, e.g. Brute-force algorithms; greedy algorithms; divide-and conquer; backtracking; branch-and-bound; heuristics; pattern matching and string/text algorithms; numerical approximation algorithms
5. Generic programming and the use and creation of template data structures
6. Fundamental data structures, e.g. Stacks, queues, linked lists, trees
7. Fundamental computing algorithms, e.g simple searching and sorting algorithms (linear and binary search, selection, bubble, and insertion sort)

1. apply object-oriented principles to the development and use of algorithms and data-structures.
2. calculate time and space complexity of data structures and algorithms and be able to use these complexities to choose the most appropriate for a given problem environment.
3. create and use templated (generic) classes and methods.
4. demonstrate knowledge of algorithms associated with different data structures.
5. demonstrate knowledge of recursion by describing common applications and by effectively using it to solve problems.
6. use appropriate algorithms to solve common computing problems.
7. use fundamental data structures such as stacks, queues, linked-lists, and trees to represent data and meet application requirements.

Courses and Registration