A given connected graph G is a Euler graph if and only if all vertices of G are of ______.

Which of the following data structures has a balanced condition?

A matrix is called sparse when______

Which of the following operations in the simple linked list will modify the beginning of the linked list?

You have implemented a queue with a circular array keeping track of the first item, the last item, and the count (the number of items in the array). Suppose the address of the first is zero, and that of the last is CAPACITY-1, what can you say about the count?

In the linked representation of a sparse matrix, the head node for a column list stores_____

Let A be a sorted array of n=10 elements. Assume that only one comparison is required to determine whether the target is equal to, less than, or greater than A[i]. Which of the following denotes the average successful time of finding an arbitrary element x in A using the binary search?

The breadth-first traversal (BFS) is a method to traverse______

What kind of list is the best to answer questions such as "Which is the item at position n?"

In a selection sort algorithm, the number of passes required to perform the sort are ______.