CS 111

Major Prerequisites

Completion of CS 110.

Learning Outcomes

Upon successful completion of this course, students will be able to…

  • Write programs using Java source code at an intermediate level.

  • Employ software engineering principles to develop abstract data types.

  • Employ data structures using static and dynamic memory allocation including bags and sets , stacks, queues and priority queues, lists and sorted lists, dictionaries, and trees.

  • Employ recursion and analysis of algorithms in algorithm design.

  • Employ sorting algorithms and searching algorithms on abstract data types.

  • Employ interfaces, generics, iterators, inheritance, polymorphism, and encapsulation in object-oriented programs.

  • Appraise data structures and algorithms for solving nontrivial problems.

Full syllabus is available upon request.


The recommended text is Data Structures and Abstractions with Java 5th Edition by Carrano and Henry (ISBN 978-0134831695) for study and reference.

Mr. Reaser
Teaching Instructor

Lane Department at West Virginia University.