 |
CSCI160
- Algorithms/Lecture, Discussion, Laboratory
Emphasizes how the design of algorithms is supported by advanced data structures such as sets, trees, and graphs. Applications to searching and sorting are discussed. Topics include: design and analysis of algorithms, general trees, balanced trees, priority queues, hash tables, merge-sort, quick-sort, radix sorting and searching, and elementary graph algorithms. Programming projects are assigned for the laboratory component. Prerequisites for this course require a grade of C or better. Prerequisites: CSCI121 and MATH114. Mr. Green, Ms. Han/ Offered every year
Faculty
Frederic Green, Ph.D. - Professor and Chair, Department of Mathematics
and Computer Science
Li Han, Ph.D. - Assistant Professor of Mathematics and Computer Science
Ping Xuan, Ph.D. - Assistant Professor of Mathematics and Computer Science
|
