Which of the Following Methods Would Properly Compute the Value

question 12

Multiple Choice

Which of the following methods would properly compute the value of x % y (x mod y) recursively, assuming that x and y are not negative numbers?

• A) public int recursiveMod(int x, int y)
• {
• If (x < y) return y;
• Else return recursiveMod(x, y - x);
• }
• B) public int recursiveMod(int x, int y)
• {
• If (x == y) return 0;
• Else return recursiveMod(x - y, y) + 1;
• }
• C) public int recursiveMod(int x, int y)
• {
• If (x < y) return x;
• Else return recursiveMod(x - y, y) + 1;
• }
• D) public int recursiveMod(int x, int y)
• {
• If (x < y) return x;
• Else return recursiveMod(x - y, y);
• }
• E) public int recursiveMod(int x, int y)
• {
• While (x > y)
• X = x - y;
• Return x;
• }

---

Definitions:

Convertible Bond

A convertible bond is a type of bond that the holder can convert into a specified number of shares of the issuing company, typically at certain times during its life.

Put Option

A financial contract giving the holder the right, but not the obligation, to sell a specified amount of an underlying asset at a set price within a specific time.

Option Buyer

An individual or entity that acquires the rights, but not the obligation, to buy or sell an asset at a predetermined price within a specific time frame.

Option Writer

An individual or entity that creates and sells options, thus assuming the risk of having to buy or sell the asset at the option's strike price if the option is exercised.