(= I CSI 213) Data Structures

Catalog description

(Formerly I CSI 310.) This course covers commonly used abstract data structures such as lists, stacks, queues, trees and graphs. The implementation and time-space analysis of these data structures is discussed in the context of recursion, sorting and searching algorithms. May not be taken by students with credit for I CSI 310. Only one of I CSI/I ECE 213 may be taken for credit. Must be completed with a grade of C or better to take I CSI 333 or I ECE 332. Prerequisite(s): grade of C or better in I ECE/I CSI 201, or I ECE 141.