Description
Prerequisite(s): CS 1350.
A study of methods for implementing data structures such as: lists, linked lists, nary trees, AVL-trees, b-trees, tries, and graphs. Study and analysis of well-known algorithms. Unscheduled laboratory. Credit(s): 3