DAT/305 - Data Structures for Problem Solving
Course Description
This course covers data structures, recursion, analysis, sorting and searching (sequential and binary), tree and tree algorithms, graphs and graph algorithms, as related to organizational problem solving across industries.
This undergraduate course is 5 weeks.
PLEASE NOTE:
Attendance and participation are mandatory in all university courses, and specific requirements may differ by course. If attendance requirements are not met, a student may be removed from the course. Please review the Course Attendance Policy in the Catalog for more information.
Course Objectives
Week 1
- Explain the use of a data structures to solve organizational problems.
- Apply data structure concepts in an organization.
- Build a pseudocode data structure to solve a provided organizational problem.
Week 2
- Explain the purpose and usability of data structure test and analysis techniques in a data system application.
- Analyze an organization’s data structure.
- Identify an organization’s common data-oriented object expression.
Week 3
- Demonstrate how to apply recursion concepts as they relate to an organization’s data system.
- Explain advantages and disadvantages of using recursion concepts in a data systems application.
- Develop and describe a sample of a recursion routine in pseudocode.
Week 4
- Explain the purpose of sorting and searching techniques and concepts in a data system application.
- Demonstrate how to apply sorting and searching concepts as they relate to an organization data system.
- Explain advantages and disadvantages of using sorting and searching concepts in a data systems application.
- Develop and describe samples of sorting and search algorithms in pseudo code.
Week 5
- Explain the purpose and usability of tree and graph algorithm techniques.
- Apply tree and graph algorithm concepts as they relate to an organization data system.
- Explain advantages and disadvantages of using tree and graph algorithm concepts in a data systems application.
- Develop and describe a sample of a tree algorithm in pseudo code.
Prerequisites
NoneDisclaimers
The University of Phoenix reserves the right to modify courses.
While widely available, not all programs are available in all locations or in both online and on-campus formats. Please check with an Enrollment Representative.
Transferability of credit is at the discretion of the receiving institution. It is the student’s responsibility to confirm whether or not credits earned at University of Phoenix will be accepted by another institution of the student’s choice.
If you have a question contact us at 866-345-1800.