A convenient and fast way to implement an associative container data structure is to use a ____.
- linked list
- binary search tree
- priority queue
In an array list the time complexity of the remove function is identical to the time complexity of the ____ function.
The algorithm ____ is used to find the elements in one range of elements that do not appear in another range of elements.
If we compare the push function of the stack with the insertFirst function for general lists, we see that the algorithms to implement these operations are similar.
The ____ operation is used to add an element onto the stack.
From the binary search algorithm, it follows that every iteration of the while loop cuts the size of the search list by half.
The order of the nodes in a linked list is determined by the data value stored in each node.
Every call to a recursive function has its own code and its own set of ____ and local variables
To simplify operations such as insert and delete, you can define the class to implement the node of a linked list as a struct.
The term asymptotic means the study of the function f as n becomes larger and larger without bound.
The ____ in a binary tree is the number of branches on the path from the root to the node.
- size of a node
- level of a node
- depth of a node
In the second form of ____, the binary operation op is applied to the elements in the range.
The statement ____ declares intList to be a vector and the component type to be int
- vector<int> intList;
- int.vector intList;
- int.vector intList;
When an integer is subtracted from a pointer variable, the value of the pointer variable is decremented by the integer times half the size of the memory to which the pointer is pointing.
Because an AVL tree is a binary search tree, the search algorithm for an AVL tree is the same as the search algorithm for a binary search tree.
Random access iterators are ____ iterators that can randomly process elements of a container.
A(n) ____ is a data type that separates the logical properties from the implementation details.
- abstract data type
Building a linked list forward places the new item to be added at the beginning of the linked list.
____ are systems in which queues of objects are waiting to be served by various servers
- Queuing networks
- Queuing systems
- Holding systems
Using static arrays, depending on the number of servers specified by the user, a list of servers is created during program execution.
To speed up item insertion and deletion in a data set, use ____.
- linked lists
If the data needs to be processed in a First In First Out (FIFO) manner, we typically use a(n) ____.
A binary search can be performed only on ____.
- ordered lists
- comparable lists
- unordered lists
Class objects cannot be passed as parameters to functions or returned as function values.
A queuing system only consists of queues of objects waiting to be served.
A class and its members can be described graphically using a notation known as Unified Modeling Language (UML) notation.
In a ____ queue, customers or jobs with higher priorities are pushed to the front of the queue.
The operation ____ is used to remove the top element from the stack.
In 1736, Euler represented the Königsberg bridge problem as a graph, marking (as recorded) the birth of graph theory.
A sequential search assumes that the data is in a particular order.
The general case in a recursive function is the case for which the solution is obtained directly.
Open addressing can be implemented in several ways.
Every customer has a customer number, arrival time, waiting time, transaction time, and departure time.
The expression vecCont.empty() empties the vector container of all elements.
A B-tree can be ____ in three ways: inorder, preorder, and postorder.
The ____ operation on a queue returns the last element in the queue, but does not remove the element from the queue
A linked list in which the last node points to the first node is called a reverse linked list.
A ____ is a set of elements of the same type in which the elements are added at one end.
- hash table
Assuming deq is a deque object, the expression deq.push_front(elem) deletes the first element from deq.
The function that overloads any of the operators (), , ->, or = for a class must be declared as a member of the class.
The syntax for accessing a class (struct) member using the operator -> is ____.
complexity of the function seqSearch in an array list is O(n2).
Mergesort uses the divide-and-conquer technique to sort a list.
After inserting (or deleting) a node from an AVL tree, the resulting binary tree does not have to be an AVL tree.
The ____ algorithm tries to extend a partial solution toward completion
Indirect recursion requires the same careful analysis as direct recursion.
We need ____ pointers to build a linked list.
The destructor automatically executes when the class object goes out of ____.
An ____ is an object that produces each element of a container, such as a linked list, one element at a time.
Assuming vecList is a vector container, the expression ____ deletes all elements from the container.
- vecList.erase(beg, end)