CSCI 202
Introduction to Computer Science II

Course Description:

CSCI 202  Introduction to Computer Science II    Four Credit Hours
     Prerequisite: CSCI 201 with a grade of “C” or higher; prerequisite or corequisite: MATH 206.
     Required for B.S. degree in computer science.
     A continuation of the material covered in CSCI 201. This course emphasizes object-oriented programming and a disciplined approach to program development. Topics include data abstraction, recursion, inheritance, polymorphism, linked data structures, stacks and queues.
    Lecture: Three hours; laboratory: two hours.

Major Topics:

• Abstraction and encapsulation
• Inheritance and interfaces
• Polymorphism
• Streams and file I/O
• Swing and the Java event model
• Exceptions
• Recursion
  • Merge sort
  • Quick sort
• Abstract Data Types
  • Lists
  • Stacks
  • Queues
• Software engineering driven design, implementation, documentation, and testing practices

Course Outcomes:

Upon successful completion of this course, a student will be able to

• Create algorithmic solutions to problems of moderate complexity
• Apply the object-oriented principles of polymorphism and inheritance in the development of software
• Implement and trace recursive solutions to problems
• Analyze and compare sorting algorithms including the Quick and Merge sort
• Explain the abstract data types list, stack and queue and their various implementations
• Analyze problems to identify an appropriate ADT and implementation, from list stack and queue, to be used in the problem solution
• Use a modern IDE to create, compile, debug, test and execute medium length JAVA programs.

Textbooks:

Java Concepts (Fourth Edition) by Cay Horstmann, John Wiley & Sons, Inc., 2005.

Projected Schedule:

Every Fall

Recent Syllabi:

Fall 2007, Rudolph