CS 0251 - NON-JAVA ALGORITHMS AND DATA STRUCTURES 2

Minimum Credits: 3
Maximum Credits: 3
As the second in a two-course sequence on algorithms and data structures, this course covers a broad range of the most commonly used algorithms. Some examples include algorithms for searching, encryption, compression, graphs, and dynamic programming. The students will implement and test several algorithms. The course is programming intensive, focusing on a programming language other than Java.
Academic Career: Undergraduate
Course Component: Lecture
Grade Component: LG/SNC Elective Basis

Click here for class schedule information.

Add to Portfolio.

Close Window