CS 202 Fundamental Structures of Computer Science II
|
|
The course discusses concepts related with algorithmic efficiency on basic abstract data types. First the course introduces algorithmic efficiency on basic abstract data types and some sorting algorithms that utilize recursion. Then the course discusses the abstract data types of trees, tables, priority queues, and graphs. It also shows how one can implement these abstract data types in C++ using fundamental data structures by emphasizing run-time complexity analysis.
Credit units: 3 ECTS Credit units: 6, Prerequisite:
CS 201.
|
|
|
| Bilkent University Main Page |
Last regenerated automatically on September 6, 2008 by OAC - Online Academic Catalog Software.
|
|
