Transcript title

Computer Science II

Credits

4

Grading mode

Standard letter grades

Total contact hours

50

Lecture hours

30

Other hours

20

Prerequisites

CS 161.

Course Description

Emphasizes the development of data structures, algorithm analysis, recursion, and sorting. Also explores several basic programming constructs, inheritance, interfaces, exceptions, and files/streams. Covers software engineering methods, proper program development, and attention to program planning and documentation.

Course learning outcomes

1. Create proper program documentation.
2. Create and use unit testing.
3. Understand and select appropriate programming STL collections (container) classes.
4. Explore basic data structures.
5. Design OOP software with use of interfaces, abstract classes, inheritance, and polymorphism.
6. Write a simple sorting algorithm.
7. Identify the "Big O" of simple algorithms.

Content outline

1. Software Engineering
   1. Program Documentation 
   2. Program Testing
   3. Module Packaging
2. Data Abstractions
   1. Abstract Data Structures
   2. Database Systems
3. Object Oriented Programming
   1. Interfaces, abstract classes, inheritance, and polymorphism
4. Algorithm Analysis - Complexity and Space
   1. The Big O
5. Web Applications
6. Combining Front End and Back End Applications

Required materials

Access to the Internet

General education/Related instruction lists

• Science not Lab