Abstract Data Types and Subprograms Ch.8

Graph

A data structure consisting of nodes and edges that relate the nodes

Undirected graph

A graph with edges having no direction

Directed graph

A graph with edges having a specific direction

Depth-First Searching Algorithm

An algorithm that finds a path from a starting vertex to an ending vertex

Breadth-First Search

An algorithm that examines all vertices adjacent to a starting vertex before moving to the next level

Subprogram

A section of code with a name that can be called from another part of the program

Parameter

An identifier listed in parentheses beside the subprogram declaration

Value parameter

A parameter that expects a copy of its argument to be passed

Array-based visualization

Data visualization using an array

Linked visualization

Data visualization using linked structures

Array

A collection of elements stored in contiguous memory locations

List

A collection of elements with no specific order

Unsorted list

A list with elements in no particular order

Sorted list

A list with elements arranged in a specific order

Stack

An abstract data type with LIFO behavior

Queue

An abstract data type with FIFO behavior

Binary tree

A linked container with a unique starting node and each node having two child nodes

Binary search tree

A binary tree with values in each node satisfying a specific property

Reference parameter

A parameter that expects the address of its argument to be passed

Composite data type

A data type in which a name is given to a collection of data values

Data Structures

The implementation of composite data fields in an abstract data type

Containers

Objects whose role is to hold and manipulate other objects

Abstract Data Type (ADT)

A data type whose properties are specified independently of any particular programming language.

Application (user) level

-view of the data within a particular problem

-view sees data objects in terms of properties and behaviors

Logical (abstract) level

Abstract view of data and set of operations to manipulate them.

View sees data objects as groups of objects with similar properties and behaviors.

Implementation level

A specific representation of the structure that hold the data items and the coding operations in a programming language.