What is the worst-case time complexity of finding a maximum cardinality matching in a bipartite graph G = (V,E)?

What is the worst-case time complexity of the simple Ford-Fulkerson algorithm for finding the maximum flow in a graph given a source and a sink, and all integer capacities on edges? Assume the graph G = (V,E) has a finite, integer maximum flow value of f.

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 _______.

A bubble sort is sometimes called a ____.

A ________ is used to travel through a linked list and search for data.

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 ________.