Loading...
|
COMP-SCI 303
Data Structures
|
|
|
Linear and hierarchical data structures, including stacks, queues, lists, trees, priority queues, advanced tree structures, hashing tables, dictionaries and disjoint-set. Abstractions and strategies for efficient implementations will be discussed. Linear and hierarchical algorithms will be studied as well as recursion and various searching and sorting algorithms. Programming concepts include Object Orientation, concurrency and parallel programming. Several in-depth projects in C++ will be required.
|
Prerequisite(s):
COMP-SCI 191 and either COMP-SCI 201 or both COMP-SCI 201R and COMP-SCI 201L. All prerequisites must be passes with C or higher.
|
Faculty:
School of Computing & Engineer
|
Department:
Comp Sci & Elect Engr
|
|
Print