ICS 211 - Introduction to Computer Science II
Course Description
- Prerequisite: ICS 111
Reinforce and strengthen problem-solving skills using more advanced features of programming languages and algorithms such as recursion, pointers, and memory management. Emphasize the use of data structures such as arrays, lists, stacks, and queues.
Student Learning Outcomes
Upon successful completion of ICS 211, the student will be able to:
- Apply data structures and Abstract Data Types (ADT) such as trees, lists, stacks and queues.
- Write programs that manipulate multi-dimensional arrays.
- Define a package and implement that definition.
- Define an interface to describe an ADT.
- Explain the process of defining a class that implements the comparable interface.
- Define an exception class.
- Determine whether to make a checked exception or a runtime exception.
- Explain the quicksort and merge sort algorithms.
- Define complex recursive methods.
- Implement complex recursive methods.
- Analyze complex algorithms to determine their order of magnitude.
- Prove the correctness of a simple algorithm.