| |
Mar 12, 2026
|
|
|
|
|
Website Catalog (In Development)
|
CST 202 - Data Structures
This course requires a solid foundation in programming, including proficiency with decision structures, loops, file handling, and object-oriented programming techniques. The course enhances student understanding of design philosophies, fundamental syntax, and experience with advanced programming concepts. Topics covered include: static and dynamic data structures, files, linked lists, stacks, queues, trees, recursion, and algorithms. Knowledge of structured modular programming and object-oriented programming techniques with extensive documentation is required. An Integrated Development Environment (IDE) will be used.
Prerequisite- Corequisite
Prerequisite: CST 138 Object Oriented Programming with a minimum grade of “C” or better
Credits: 4
Hours
3 Lecture Hours, 2 Laboratory Hours
Course Profile
Learning Outcomes of the Course:
Upon successful completion of this course the student will be able to:
- State, verbally and in written documentation sort routines.
- List and demonstrate concepts with Linked Lists.
- List and demonstrate concepts with Stacks.
- List and demonstrate concepts with Queues.
- List and demonstrate concepts with Trees.
|
|
