CS 2500 - Computer Programming II

3 unit(s)

Continued development of discipline in program design, in style and expression, and in debugging and testing, especially for larger programs. Introduction to algorithmic analysis, string processing, recursion, internal search/sort methods, and simple data structures. Introduction to professional methodologies and ethics.

Prerequisites: CS 1500.

Hours: (Lecture, 2 hours; laboratory, 2 hours)

Course Learning Outcomes List
Student will be able to:

Write programs that use each of the following data structures: arrays, records, strings, linked lists, stacks, queues, and hash tables (PLO #2.2);

Implement, test, and debug simple recursive functions and procedures;

Evaluate tradeoffs in lifetime management (scope, garbage collection, etc);

Explain how abstraction mechanisms support the creation of reusable software components;

Design, implement, run, test, and debug simple programs in a general-purpose programming language (PLO #1.2); and,

Compare and contrast object-oriented analysis and design with structured analysis and design.

Schedule of Classes | University Bookstore