Title: Module Introduction-3
Course: COP 1510 Programming Concepts > Section: Module 13 - Recursion

Introduction

Module 13 introduces us to the concept of recursion. Recursion can at times be difficult to understand, however there are some algorithms that are more easily solved using a recursive method. As you will see in this module, recursion is never required. Any problem solved with recursion could also be solved using loops. We will look at some common examples of recursive algorithms during this module.

Objectives

Upon completion of this module, the student will be able to:
- Compare and contrast programming languages and choose a language for a programming task.
- Produce computer programs using Integrated Development Environments.
- Design a program using pseudocode and flowcharts.
- Develop, compile, debug and execute application programs for execution.
- Create proper computer programs that include: Reserved Words, Comments, Variables, Constants, Arithmetic and other operators, Decision structures, Input and output, Iteration and looping, Methods or procedures

Readings & Resources

TBD