Procedures are a way to organize code so that a set of instructions can be reused whenever needed. Instead of rewriting the same logic multiple times, a procedure groups those steps under a single name. This makes programs easier to read, easier to debug, and easier to modify. A procedure can take inputs, called parameters, and may produce an output using RETURN. When a procedure is called, the program executes the steps inside it using the given inputs.
Back to Big Idea 3: Algorithms & Programming
Lesson PreviewLesson 13 of 18 in this unit
3.13 Developing Procedures
Part of Big Idea 3: Algorithms & Programming in AP® Computer Science Principles. Read the opening section, then create a free account for the full interactive lesson, practice, and progress tracking.
In this unit
18 lessons
- 3.1Variables and AssignmentsPreview lesson
- 3.2Data AbstractionPreview lesson
- 3.3Mathematical Expressions in ProgrammingPreview lesson
- 3.4StringsPreview lesson
- 3.5Boolean ExpressionsPreview lesson
- 3.6ConditionalsPreview lesson
- 3.7Nested ConditionalsPreview lesson
- 3.8IterationPreview lesson
- 3.9Developing AlgorithmsPreview lesson
- 3.10ListsPreview lesson
- 3.11Binary SearchPreview lesson
- 3.12Calling ProceduresPreview lesson
- 3.13Developing ProceduresThis lesson
- 3.14LibrariesPreview lesson
- 3.15Random ValuesPreview lesson
- 3.16SimulationsPreview lesson
- 3.17Algorithmic EfficiencyPreview lesson
- 3.18Undecidable ProblemsPreview lesson
Continue the full lesson in Stellar
Create a free account to unlock the remaining sections, checkpoints, course practice, and progress tracking for AP® Computer Science Principles.