CS 202 Computer Science II (5 credits)
Prerequisite CS& 141 with a 2.0 or higher; or instructor permission.
Course Description Introduction to Object Oriented Programming (OOP). Application of the concepts of inheritance, polymorphism, abstraction and encapsulation. Addresses classes, objects, recursion, basic data structures and abstract data types. Utilize maintainability, and reusability techniques. Introduce effective object-oriented programming, code versioning and error handling.
Course Content A. Object-oriented Programming
B. Design
C. Programming terms and concepts
D. Testing/Debugging
E. Lists, Collections, and other Data Structures
F. Recursion, Search and Sort Algorithms
Student Outcomes 1. Develop programs by taking complex problems and breaking them down using various algorithms.
2. Utilize branching, iteration, recursion, arrays (single- and multi-dimensional) and basic abstract data types (Lists, Queues, Sets, Stacks).
3. Develop and design object-oriented programs using classes, interfaces, and objects.
4. Program and use data structures (arrays, linkedlist, binary tree) and related collections.
5. Apply recursion, searching, and sorting algorithms.
6. Design an effective program utilizing Unified Modeling Language (UML).
7. Develop programs using maintainability and reusability concepts such as method overloading, method overriding.
8. Design and implement source code versioning and error handling.
9. Develop programs using inheritance, polymorphism, abstraction and encapsulation.
10. Formulate and understand (Big O) algorithmic performance, complexity and scalability.
Degree Outcomes Creative and Reflective Thinking: Graduates will evaluate, analyze, synthesize, and generate ideas; construct informed, meaningful, and justifiable conclusions; and process feelings, beliefs, biases, strengths, and weaknesses as they relate to their thinking, decisions, and creations.
Lecture Contact Hours 50 Lab Contact Hours 0 Clinical Contact Hours 0 Total Contact Hours 50
Add to Portfolio (opens a new window)
|