Data Structures and Algorithms
A course focusing on abstract data types, such as linear lists, linked lists, stacks, queues, graphs, and trees, and the design, implementation, and efficiency of the algorithms for processing these structures. More advanced searching and sorting techniques will be introduced and analyzed. Upon completion of this course, the student will be able to utilize data abstraction to solve a wide variety of computational problems using various data structures and to analyze the efficiency of their solutions. Prerequisite: Information Science and Technology 146. Offered fall terms.