This course provides students with a basic understanding of programming development practices. Concepts covered include the application of algorithms and logic to the design and development of procedural and object oriented computer programs to address the problem solving requirements associated with business information systems. This course will cover procedural programming concepts including data types, controls structures, functional decomposition, arrays, and files, classes and objects.
Identify how a computer processes and stores data.
Describe procedural and object-oriented programming languages.
Problem Solving and Algorithm Development
Describe the process and methods for problem recognition.
Analyze the development of procedural and object-oriented problem solutions.
Define the process of algorithm development.
Describe the importance of using a structured modular approach to program development.
Demonstrate the sequential and selection processing control structure.
Examine the iteration control structure.
Apply flowcharts to represent logic.
Structures, Verification, and Validation
Explain array structures.
Define objects and object-oriented classes.
Apply arrays to program logic and data manipulation.
Verify algorithms using requirements and desk review design.
Demonstrate reading and writing sequential files in pseudocode.
Differentiate between sequential and direct access.
Compare and contrast procedural and object-oriented programming.
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 a University 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.
Start your journey now
Speak live with an enrollment representative M-F 6:00 a.m. — 6:00 p.m. MST.