This is an introductory course for computer programming using Java. The course covers the fundamentals of algorithmic problem solving for a variety of problems involving the use of basic control and data structures. Other topics include fundamental data types, control structures including conditions and iteration, arrays, input and output.
Students learn to implement and analyze elementary data structures and the basic complexity classes of algorithms that use strategies such as greedy algorithms, divide-and- conquer algorithms, and backtracking algorithms. This analysis is especially applied to problems in searching, sorting, and parsing.
No summary provided