This course explores introductory data structures including array lists, linked lists, stacks, queues, binary trees, and hash tables. Efficiency of data structure operations is analyzed. Recursion, applications of data structures, and simple analysis of algorithms are covered.
Prerequisite: COMP 400A.
Outcomes: Students describe linear data structures and analyze the performance of their operations. Students will be able to select appropriate data structures to integrate into algorithms to solve computational problems.
Prerequisite: COMP 400A.
Outcomes: Students describe linear data structures and analyze the performance of their operations. Students will be able to select appropriate data structures to integrate into algorithms to solve computational problems.