This course studies basic data structures including array lists, linked lists, stacks, queues, binary trees, and hash tables. Efficiency of data structure operations, study of recursion, applications of data structures, and simple analysis of algorithms are covered.
Prerequisite: COMP 141 and COMP 170 and (co-requisite or pre-requisite of COMP 163 (preferred) or MATH 201); For Bioinformatics majors, pre-requisite of COMP 141 and COMP 170; For SCPS students, pre-requisite of COMP 170.
Outcomes: Students learn linear data structures and the performance of their operations, and they learn to solve simple computational problems by designing suitable algorithms and efficient data structures.
Prerequisite: COMP 141 and COMP 170 and (co-requisite or pre-requisite of COMP 163 (preferred) or MATH 201); For Bioinformatics majors, pre-requisite of COMP 141 and COMP 170; For SCPS students, pre-requisite of COMP 170.
Outcomes: Students learn linear data structures and the performance of their operations, and they learn to solve simple computational problems by designing suitable algorithms and efficient data structures.