What is true of the complete bipartite graphs K(3,3) and K(2,4)?

If X is the adjacency matrix of a graph G with no self loops, the entries along the principle diagonal of X are ______.

Consider a linked list implementation of a queue with two pointers: front and rear. The time needed to insert element in a queue of length n is:

What is the worst-case scenario for mergesort to sort an array of n elements?

Consider a hashing function that resolves collision by quadratic probing. Assume that the address space is indexed from 1 to 8. If a collision occurs at position 4, the location which will never be probed is:

In which data structure is the concept of rotation used?

An immutable class cannot have ________.

A _____ specifies the fields and identifies the primary key in a particular file.

A _____ language feature allows users to type commands or requests in normal text phrases.

A _____ key can be described as a minimal superkey, a superkey without any unnecessary attributes.

A ____ connection is one in which both sender and receiver may transmit at the same time.