CIT 245 - Data Structures and Algorithms Using C++
Credits: 4
4 Lecture Hours
Prerequisites: CIT 130 or permission of instructor
Description
This is a course in software design and development emphasizing data abstraction and data structures. Students learn and use the Object-Oriented Programming (OOP) language C++. The focus of the course is the development of programs utilizing various data structures such as arrays, linked lists, stacks, queues and trees. Algorithm efficiencies involved with sorting, searching and recursion are analyzed.
Learning Outcomes
Upon successful completion of the course, the student will:
- Employ an Integrated Development Environment (IDE) to compile, build and execute C++ programs.
- Develop and present problem solutions using abstract data types.
- Create programs that include various data structures involving arrays, linked lists, stacks, queues and trees.
- Evaluate various algorithm efficiencies and complexities.
- Implement sorting and searching algorithms.
- Apply recursion in a C++ application.
Listed Topics
- Integrated Development Environment (IDE)
- C++ data types, identifiers and operators
- C++ control structures
- OOP
- Data abstraction
- Arrays
- Pointers
- Linked lists
- Stacks
- Queues
- Trees
- Algorithm efficiencies
- Sorting and searching algorithms
- Recursion
Reference Materials
Textbooks/materials, current and appropriate software, multimedia for lecture and demonstration as required by instructor; access to the internet.
Students who successfully complete this course acquire general knowledge, skills and abilities that align with CCAC’s definition of an educated person. Specifically, this course fulfills these General Education Goals: - Critical Thinking & Problem Solving
- Quantitative & Scientific Reasoning
Approved By: Dr. Quintin B. Bullock Date Approved: 2/26/2021
Last Reviewed: 11/11/2022
Course and Section Search
Add to Portfolio (opens a new window)
|