You have a file with 4 billion 32-bit integers. The distribution of the integers is random but uniform. You are supposed to find a number NOT in the file. If you created a bit array and used the index to that array to determine if a number existed in the file approximately how much memory would you need?

A full binary tree with 2n+1 nodes contains:

Which graph traversal algorithm uses a queue to keep track of the vertices which need to be processed?

A simple graph with n vertices and k components can have at the most _______.

What is the minimum number of edges which must be removed from a complete bipartite graph of six nodes K(6) so that the remaining graph is a planar?

Which feature of heaps allows them to be efficiently implemented using a partially filled array?

The ________ represents a special value that marks the end of a list of values.

After you create an array variable, you still need to ____ memory space.

If an exception occurs in a try-catch block, the code in the finally clause ________.

Fill in the code in comparable________ c = new date();

Before a structure variable can be created, the structure must be _________.