CS 0445 - ALGORITHMS AND DATA STRUCTURES 1

Minimum Credits: 3
Maximum Credits: 3
This course emphasizes the study of the basic data structures of computer science (stacks, queues, trees, lists) and their implementations using the java language. Included in this study are programming techniques that use recursion, reference variables, and dynamic memory allocation. Students in this course are also introduced to various searching and sorting methods and also expected to develop an intuitive understanding of the complexity of these algorithms.
Academic Career: Undergraduate
Course Component: Lecture
Grade Component: LG/SNC Elective Basis
Course Requirements: PREQ: CMPINF 0401 or CS 0401 or COE 0401 or 0422 or CIST 0150 or CS 0207 (MIN GRADE ‘C’ or Transfer); Enrollment blocked if enrolled or previously enrolled in CS 0245

Click here for class schedule information.

Add to Portfolio(opens a new window)