CSC 240
C++ data structures
|
| Welcome to the Oakton Community College CSC
240 Home Page. Here
you can find the information that pertains to all sections
of the course. |
| |
Prerequisite |
| CSC
155 or CSC 202 required;MAT
143 or higher recommended. |
| |
Course Description |
| This
continuation of CSC 155 is a first
course in the study of data structures. Elementary methods
of complexity analysis are applied to algorithms that manipulate
dynamic and static data structures. Object oriented programming
techniques are utilized to implement lists, trees, tables,
graphs and other classes using the C++ language. Algorithms
emphasize sorting and searching methods.
|
| |
Course Objectives |
|
A. Continue program development emphasizing
modularity and abstract data types.
B. Utilize object-oriented programming skills to design
maintainable classes.
C. Analyze algorithms to optimize memory and time complexity.
D . Implement a collection of data structures into a variety
of applications.
E . Survey methods of sorting and searching.
|
| |
Instructional Materials: |
Required Textbook:
Data
Structures Using C++by D.S.Malik, Thomson Course Technology,
2003.
One floppy diskette. |
| |
Instructors: |
| SPRING
2007 |
| Section: |
Instructor: |
0C1 |
J. Hassett |
|
| |
Related Courses |
| See
Division II Office
|
