2014-2015 Official General Catalog [Archived Catalog]
|
CST 202 W - Data Structures
This course assumes a complete understanding and experience with programming including decisions, loops, file processing and object oriented programming. The course gives the student the necessary design philosophies, fundamental syntax, and experience with advanced programming concepts. Topics covered include: static and dynamic data structures, arrays, structures, files, linked lists, stacks, queues, trees, and recursion. Structured modular programming and extensive documentation is required. An Integrated Development Environment (IDE) will be used. It is a writing emphasis course.
Prerequisite- Corequisite
Prerequisite: CST 150 Object Oriented Programming with a minimum grade of “C” or better
Credits: 3
Hours
2 Class Hours, 2 Laboratory Hours
Course Profile
Learning Outcomes of the Course:
Upon successful completion of this course the student will be able to:
1. State, verbally and in written documentation, five sort routines.
2. List and demonstrate five key concepts with Linked Lists.
3. List and demonstrate five key concepts with Stacks.
4. List and demonstrate five key concepts with Queues.
5. State, verbally and in written documentation, five core sort routines.
6. List and demonstrate five key concepts with Trees.
7. List and demonstrate structured programming techniques for C++.
|
