Popular Questions - Uncategorized

1. Given a database D of n cost-performance pairs (c, p), describe an algorithm for finding the maxima pairs of C in O(nlogn) time.2. Show that the methods above(p) and before(p) are not actually...

Write a spell-checker class that stores a lexicon of words, W, in a set, and implements a method, check(s), which performs a spell check on the string s with respect to the set of words, W. If s is...

1. Describe how to modify the skip-list data structure to support the method median( ), which returns the position of the element in the “bottom” list S0 at index ⌊n/2⌋, Show that your...

Suppose that each row of an n × n array A consists of 1’s and 0’s such that, in any row of A, all the 1’s come before any 0’s in that row. Assuming A is already in memory, describe a method running...

Give a concrete implementation of the retainAll method for the set ADT, using only the other fundamental methods of the set. You are to assume that the underlying set implementation uses fail-fast...

Consider sets whose elements are integers in the range [0,N − 1]. A popular scheme for representing a set A of this type is by means of a boolean array, B, where we say that x is in A if and only if...