A continuation of CSCI 205, this lecture and laboratory course focuses on advanced data structures and the analysis of their performance. After reviewing pointers, linked lists, stacks and recursion, the following topics and their associated algorithms are studied in detail: multi-linked lists, simulating recursion, queues, trees and graphs. Advanced sorting and searching algorithms are also analyzed. Some file structures, such as B-trees and hash files, are studied. Labs and assignments are used for experimentation, to present new algorithms and concepts, to analyze and compare algorithms, and to reinforce lecture material. Students apply their knowledge to new problems, developing solutions by extending or enhancing various algorithms. Prerequisites: Grade of 鈥淐D鈥 or better in CSCI 205 and either CSCI 150 or MATH 250. Spring semester.
Grade Basis: Letter Grade
Credits: 4.0
