CS 211 Fundamentals of Computer Science II • 5 Cr.
Continues CS 210, with data structures algorithm analysis and inheritance. Students learn to create collections, lists, binary trees, and sets. Other topics include sets, generic data types, sorting, recursion, run-time complexity, and graphical user interfaces. Prerequisite: CS 210 or entry code.
After completing this class, students should be able to:
- Create classes via inheritance, use their objects to demonstrate polymorphism of both interfaces and abstract classes; and explain the role of generic class templates within classes.
- Explain the principles of recursion versus repetition, and write recursive methods for a variety of tasks.
- Implement and contrast the uses of various data structures including arrays, sets, lists, collections, and trees.
- Recognize the use of Big-O notation to explain program performance in searching, sorting, recursion, and implementation of existing methods from a software API (Application Programming Interface).
- Compose programs that facilitate error handling using API standard Exceptions with try-catch blocks.
- Design programs using a Graphical User Interface (GUI) and event driven programming.