CSC 255
objects and algorithms
|
| Welcome to the Oakton Community College CSC
255 Home Page. Here
you can find the information that pertains to all sections
of the course. |
| |
Prerequisite |
| CSC
240 or CSC 241; and either MAT
143 or instructor’s consent. |
| |
Course Description |
This course
surveys introductory algorithms in programming languages.
Object-oriented methodologies are used to implement algorithms
that exhibit backtracking, divide and conquer, the greedy
method and branch and bound techniques. Time and memory complexity
are analyzed using discrete metrics.
|
| |
Course Objectives |
A. Continue
the development of object-oriented programming methodologies.
B. Analyze algorithmic complexity using discrete mathematical
metrics.
C. Implement algorithms using a variety of abstract data types.
D. Study and implement sorting and searching algorithms.
E. Study and implement elementary semi-numerical algorithms.
F. Survey introductory distributed algorithms.
|
| |
Instructional Materials: |
Required Textbooks:
1. Data
Structures, Algorithms and Applications in C++ by Sahni, McGraw-Hill,
1998.
2.
Data Structures, Algorithms and Applications in Java by Sahni,
McGraw-Hill, 2000.
One floppy diskette. |
| |
Instructors: |
| Spring
2007 |
| Sections: |
Instructor: |
|
OC1 |
James
Papademas |
|
| |
Related Courses |
| See
Division II Office
|
