| Units: |
4.00 |
| Prerequisite: |
CISP 400 (Object
Oriented Programming with C++) or 401 (Object
Oriented Programming with Java) with a grade of
"C" or better |
| Hours: |
54 hours lecture, 54
hours laboratory |
| Description: |
This course applies
object-oriented techniques for systematic problem
analysis and the managing of program complexity
using abstraction. Specifications, design, coding,
testing, and documentation of large multi-file
programs are covered. It uses advanced language
features such as classes, strings, non-text files,
pointers, and recursion. Abstract data types such as
stacks, queues, lists, binary trees, heaps/priority
queues, hash tables, and graphs are examined.
Various sorting and searching algorithms are
presented and analyzed using Big-O notation. |
|
Section 3: Learning Outcomes and Objectives
Upon completion of this course, the
student will be able to:
- propose solutions to complex programming problems
and create code to implement these solutions.
- implement singly linked lists, doubly linked lists,
circular linked lists, stacks, queues, trees and graphs.
- implement recursive modules.
- implement various sorting and searching techniques.
- estimate the efficiency of various sorting and
searching algorithms using Big-O notation.
|
