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 |
| Recommendations MAT 144 and
one of CSC
240 or CSC 241 |
| |
Course Description |
Course continues CSC 240 or CSC 241. Contents include survey of introductory algorithms in programming language. Object-oriented methodologies are used to implement algorithms that exhibit backtracking, divide and conquer, the greedy method and branch and bound techniques; analysis of time and memory complexity 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 Textbook:
Peter
Smith Applied Data Structures with C++,
Jones and Bartlett Publishers, 2004. ISBN: 0763725625.
One floppy diskette. |
| |
Instructors: |
| Fall
2008 |
| Section |
Instructor |
|
0C1 |
James
Papademas |
|
| |
Related Courses |
| See
Division II Office
|