ICS 211 Spring 2020 – 33363

Introduction to Computer Science II

Quick Links

Class Information

  • Class Time: Mon & Wed 2:30 – 3:45 pm
  • Class Location: Koki’o 207
  • CRN: 33363
  • Prerequisite: A grade of B or higher in ICS 111, or consent of instructor.
  • Credit Hours: 3
  • Note:  A minimum grade of B is required in this course to progress to ICS 212.

Instructor: Lisa Miller, M.S.

  • Office: Koki’o 109 C
    • Across the hall from the elevator.
  • Office Hours
    • 10:00 am – 12:00 pm Mon & Wed
    • 2:30 pm – 4:00 pm  Tues & Thurs
    • Or by appointment.

Course Description

ICS 211 reinforces and strengthens problem-solving skills using abstract data types and introduces software development practices. ICS 211 emphasizes the use of searching and sorting algorithms and their complexity, recursion, object-oriented programming, and data structures.

Student Learning Outcomes

At the completion of this course, students will be able to:

  1. Use and implement abstract data types such as lists, stacks, queues, and trees.
  2. Select the appropriate searching or sorting algorithm based on the algorithm’s behavior.
  3. Develop recursive algorithms and programs.
  4. Use standard libraries or packages as well as advanced object-oriented programming techniques (polymorphism, inheritance, and encapsulation).
  5. Produce robust and secure programs using exception handling and extensive program testing.

Suggested Texts

Suggested readings are in the class schedule

Other Free Online Textbooks:


Optional other IDEs