| Each execution of a function is called an ______. |
| |

| ______ ______ is used to estimate the running time of a program. |
| |

| To execute a ______ ______, a sorted array of a particular size is created and there is a variable that keeps track of how many elements are in the list. |
| |

| For a linked list, ______ is similar to the search operation. Each element in the list is checked until the element has been found or until the end of the list is reached. If the element is found, the pointer from the previous element is redirected. |
| |

| The ______ command is based on solving the longest common subsequence. |
| |

| A ______ linked list contains pointers to both the next and previous elements. |
| |

| |

| In terms of runtime memory, the ______ contains dynamically allocated objects. |
| |

| For a linked list, elements are typically ______ at the end. |
| |

| repetition of a mathematical or computational procedure applied to the result of a previous application |
| |

| number of elements in a list |
| |

| A ______ list is a data structure in which each element contains a pointer to the next element, thus forming a linear list. |
| |

| finite set of 0 or more elements that are usually the same type |
| |

| this “divide-and-conquer” algorithm splits an array at each recursive step into two arrays of half the size; these “subproblems” are solved and then combined to form a solution |
| |

| A linked list contains a series of ______ that each contains data and a pointer to the next element. |
| |

| a rearrangement of the elements of an ordered list |
| |

| Most compilers turn infix expressions into ______ expressions. These expressions are then evaluated using a stack. |
| |

| sublist starting at the beginning of the list |
| |

| this is an abstract data type based on the list data model; it is a FIFO (first-in-first-out) structure that can be implemented using a linked list or an array |
| |

| The running time of recursive functions is estimated by deriving ______ ______. |
| |

| the solution of a problem is obtained by using the solutions of smaller instances of the problem; these types of functions call themselves (they must have a basis case) |
| |

| For a linked list, during the ______ operation, each element in the list is checked until the element has been found or until the end of the list is reached. |
| |

| this sorting algorithm sorts an array of a particular size from the smallest value to the largest value, and the array is assumed to consist of a contiguous sorted and contiguous unsorted portion |
| |

| this is an abstract data type based on the list data model; it is a LIFO (last-in-first-out) structure with push and pop operations |
| |

| In terms of runtime memory, ______ ______ contains values of certain constants and external variables used by the program. |
| |

| contiguous part of a list |
| |

| subset of the elements of a list preserving the order of their occurrence in the original list |
| |

| sublist terminating at the end of the list |
| |

| The other elements of a list besides the head form the ______. |
| |