A Practical Introduction to Data Structures and Algorithm Analysis

Sec. 2.9 Exercises 51(f) {〈2, 1〉, 〈1, 3〉, 〈2, 3〉} on the set {1, 2, 3}.2.4 How many total orderings can be defined on a set with n elements? Explainyour answer.2.5 Define an ADT for a set of integers (remember that a set has no concept ofduplicate elements, and has no concept of order). Your ADT should consistof the functions that can be performed on a set to control its membership,check the size, check if a given element is in the set, and so on. Each functionshould be defined in terms of its input and output.2.6 Define an ADT for a bag of integers (remember that a bag may contain duplicates,and has no concept of order). Your ADT should consist of the functionsthat can be performed on a bag to control its membership, check thesize, check if a given element is in the set, and so on. Each function shouldbe defined in terms of its input and output.2.7 Define an ADT for a sequence of integers (remember that a sequence maycontain duplicates, and supports the concept of position for its elements).Your ADT should consist of the functions that can be performed on a sequenceto control its membership, check the size, check if a given element isin the set, and so on. Each function should be defined in terms of its inputand output.2.8 An investor places $30,000 into a stock fund. 10 years later the account hasa value of $69,000. Using logarithms and anti-logarithms, present a formulafor calculating the average annual rate of increase. Then use your formula todetermine the average annual growth rate for this fund.2.9 Rewrite the factorial function of Section 2.5 without using recursion.2.10 Rewrite the for loop for the random permutation generator of Section 2.2as a recursive function.2.11 Here is a simple recursive function to compute the Fibonacci sequence:// Recursive Fibonacci generatorstatic long fibr(int n) {// fibr(91) is the largest value that fits in a longassert (n > 0) && (n