CS Chapter 8: Abstract Data Types & Subprograms

Abstract Data Type (ADT)

A model that defines a set of operations for a data structure, without specifying how they are implemented or how data is organized in memory.

Data Structures

A specialized format for organizing, processing, retrieving, and storing data efficiently within a computer system.

Containers

Folder in which data items are stored.

Linked Structure

A data structure composed of a set of data records, known as nodes, that are linked together an organized by links.

Binary Tree

A tree in which each node is capable of having at most two successor nodes.

Root

The beginner node, which only has successor nodes, and none before them.

Leaf Nodes

A node in the tree that has no children or successors.

Binary Search Tree

A sored list for nodes based on their meaning or relationships.

Graph

A made up set of nodes called vertices, and a set of lines called edges (or arc’s).

Verticies

Fundamental units or nodes that made up a graph.

Edges (Arc’s)

A set of lines that connect the nodes.

Undirected Graph

A graph that has edges with no direction/

Directed Graph

A graph whose edges are directed from one vertex to another.

Subprogram

A semi-independent portion of a program that can be reused and invoked from multiple locations within a larger program.

Sub-algorithm

An algorithm that is used as a part of another algorithm.

Parameter List

A list of identifies or values which the subprogram works at.

Parameters

A list of variable names.

Arguments

A list of identifiers that help the subprogram work.

Passing Parameter

A value that is passed into a function or procedure when it is called.

Value Parameter

A variable passed to a function or procedure, that receives a copy of the original data.

Reference Parameter

A variable passed to a function or procedure, that receives the original data directly.