CISC213 Computer Science III (Java)

Department of Science, Technology, Engineering & Mathematics: Computer/Information Science

I. Course Number and Title
CISC213 Computer Science III (Java)
II. Number of Credits
4 credits
III. Number of Instructional Minutes
3000
IV. Prerequisites
CISC122 (C or better)
Corequisites
None
V. Other Pertinent Information
None
VI. Catalog Course Description
This course is a continuation of Computer Science II. This course will apply object-oriented and software engineering techniques to the design and implementation of programs that manipulate complex data structures. Topics include recursion, stacks, queues, linked lists, hash tables, and trees.
VII. Required Course Content and Direction
  1. Course Learning Goals

    Students will:

    1. solve problems using complex data structures;
    2. design programs that demonstrate understanding of fundamental computing algorithms; and
    3. practice basic principles of software engineering for designing and implementing programs with emphasis on algorithm analysis and top-down design, using good programming style and documentation.
  2. Planned Sequence of Topics and/or Learning Activities

    1. Inheritance and Polymorphism
    2. Recursion
    3. Array-Based Lists
    4. Stack
    5. Queues
    6. Sorting Algorithms
    7. Binary Trees
    8. Hash Tables
    9. Graphs
    10. Collections
    11. Algorithmic Analysis and Strategies
    12. Software Engineering
  3. Assessment Methods for Course Learning Goals

    Students will be evaluated via test results and problem solving. Evaluation will include: writing, testing, and documentation of complete programs. There will be at least 2 one-hour proctored examinations. The laboratory grade will be comprised of no more than one-third of the course grade.
  4. Reference, Resource, or Learning Materials to be used by Student:

    Departmentally-selected textbook. Details provided by the instructor of each course section. See course syllabus.

Review/Approval Date - 5/06; New Core 8/2015