COIN 315 - Data Structure Analysis

(4 hours) Prerequisites: COIN 325 grade of “C” or better, and MATH 231 grade of “C” or better. The effective application of data structures and abstract data types. Abstract data types studied include: lists, stacks, queues and trees. Implementation methods include: arrays, classes, pointers and recursion. Analysis methods include Big-Oh notation using induction and recurrence relations. Topics also include ethical issues in computer science. (C++ currently used). Lecture 3 hours, laboratory 2 hours. (Laboratory fee required)