[ Login ]


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:

  • Explain the benefits of abstraction, modularity and encapsulation for program design, reliability and testing.

  • Explain the differences between procedural and object-oriented programming.

  • Define inheritance and polymorphism, and explain the role they play in program design.

  • Create and use new classes through inheritance and virtual functions, and design object structure interfaces and inheritance hierarchies.

  • Explain the principles of recursion versus repetition, and write recursive methods for a variety of tasks.

  • Explain, implement use, and contrast data structures including arrays, sets, lists, collections, and trees.

  • Explain and use container classes, and create linked lists.

  • Measure and evaluate program performance through running time and the use of Big-O notation.

  • Use different approaches and algorithms to search for a value or item in a data structure, such as linear and binary search techniques.

  • Explain different sorting algorithms for various applications, and apply different algorithms, from both the API and user-defined.

  • Compose design elements that facilitate troubleshooting, using Exceptions with try-catch blocks.

  • Design programs using a Graphical User Interface (GUI) and event driven programming.



Footer Navigation

Contact info

Bellevue College
3000 Landerholm Circle SE Bellevue, WA 98007-6484 U.S.A.
Work: (425) 564-1000