This course is the third course in the computer science introductory sequence and builds upon the computer science foundations and design principles presented in Computer Science 1 and Computer Science 2. Students will learn how to use linear data structures, such as stacks, queues, and lists and non-linear data structures, such as trees and graphs, and will also be introduced to the design and analysis of algorithms. Students will learn how to analyze the efficiency of basic sorting, searching, and hashing algorithms, and acquire an understanding of how recursion works. Object-oriented programming will be used to design solutions and implement them as Java programs. Programming assignments - labs and projects - are an integral part of the course.
Data Structures & Algorithms in JAVA 4th edition, 2006 by Michael T. Goodrich and Roberto Tamassia (ISBN 0-471-73884-0)
| [ Advising ] | [ CS FAQs ] | [ Instructors ] | [ Faculty and Staff ] | [ Department of Computer Science ] | [ RIT ] |