Mediaspace scheduled maintenance: Aug 25, 2026 07:00 - 12:00 AM. During this time, videos will be temporarily unavailable. Check status updates.

Lecture

Function Building Methodology

Description

This lecture covers the methodology for constructing a function, starting with clearly identifying its purpose and arguments, deciding on pass by value/reference, considering default parameter values, determining the return type, and finally implementing the function body.

Official source

Related concepts (14)

Evaluation strategy

In a programming language, an evaluation strategy is a set of rules for evaluating expressions. The term is often used to refer to the more specific notion of a parameter-passing strategy that defines the kind of value that is passed to the function for each parameter (the binding strategy) and whether to evaluate the parameters of a function call, and if so in what order (the evaluation order). The notion of reduction strategy is distinct, although some authors conflate the two terms and the definition of each term is not widely agreed upon.

Return statement

In computer programming, a return statement causes execution to leave the current subroutine and resume at the point in the code immediately after the instruction which called the subroutine, known as its return address. The return address is saved by the calling routine, today usually on the process's call stack or in a register. Return statements in many programming languages allow a function to specify a return value to be passed back to the code that called the function.

Void type

The void type, in several programming languages derived from C and Algol68, is the return type of a function that returns normally, but does not provide a result value to its caller. Usually such functions are called for their side effects, such as performing some task or writing to their output parameters. The usage of the void type in such context is comparable to procedures in Pascal and syntactic constructs which define subroutines in Visual Basic. It is also similar to the unit type used in functional programming languages and type theory.

Reference (computer science)

In computer programming, a reference is a value that enables a program to indirectly access a particular data, such as a variable's value or a record, in the computer's memory or in some other storage device. The reference is said to refer to the datum, and accessing the datum is called dereferencing the reference. A reference is distinct from the datum itself. A reference is an abstract data type and may be implemented in many ways. Typically, a reference refers to data stored in memory on a given system, and its internal value is the memory address of the data, i.

Argument

An argument is a series of sentences, statements or propositions some of which are called premises and one is the conclusion. The purpose of an argument is to give reasons for one's conclusion via justification, explanation, and/or persuasion. Arguments are intended to determine or show the degree of truth or acceptability of another statement called a conclusion. Arguments can be studied from three main perspectives: the logical, the dialectical and the rhetorical perspective.

Related lectures (29)

Methodology: Building a Method

Covers the methodology for constructing a method in Java.

Method Calls: Evaluation and Examples

Explains method aspects, calls, arguments, evaluation, and return values.

Functions: Python Basics

Covers the basics of functions in Python, including their definition, purpose, and usage.

Planning the First Draft

Covers the basic requirements for the first draft and guides students on project planning and outlining techniques.

Python Functions: Basics and Arguments