Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Scribd
Upload
23 views

Discussion 2: CS 61B Spring 2020

The document contains code examples and explanations of methods for calculating Fibonacci numbers and sorting arrays. It includes a recursive fib1 method to calculate the Nth Fibonacci number directly and a memoized fib2 method. It also includes mystery1 and mystery2 methods - mystery1 returns the index of the smallest element greater than or equal to the element at index k, and mystery2 sorts an array by calling mystery1.

Uploaded by

Pranav Karthikeyan
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
23 views

Discussion 2: CS 61B Spring 2020

The document contains code examples and explanations of methods for calculating Fibonacci numbers and sorting arrays. It includes a recursive fib1 method to calculate the Nth Fibonacci number directly and a memoized fib2 method. It also includes mystery1 and mystery2 methods - mystery1 returns the index of the smallest element greater than or equal to the element at index k, and mystery2 sorts an array by calling mystery1.

Uploaded by

Pranav Karthikeyan
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 3

CS 61B Discussion 2 Spring 2020

1 Old Town Code


Next to each line, write out in words what you think the code will do when it is run. Assume the
Singer class exists and that the code below compiles.

1 int x = 7;
2 String chorus = "Thank u, next";
3 Singer queen = new Singer("Ariana");
4
5 while (x > 0) {
6 x -= 1;
7 queen.sing(chorus);
8 }
9
10 String[] phrases = {"love", "patience", "pain", "what does the fox say?"};
11
12 for (int i = 0; i < 3; i += 1) {
13 System.out.println("One taught me " + phrases[i]);
14 }
15
16 System.out.println(phrases[phrases.length - 1]);

Hint: For reference, here is an equivalent Python program.


1 x = 7
2 chorus = "Thank u, next"
3 queen = Singer("Ariana")
4
5 while (x > 0):
6 x -= 1
7 queen.sing(chorus)
8
9
10 phrases = ["love", "patience", "pain", "what does the fox say?"]
11
12 for i in range(3):
13 print("One taught me " + phrases[i])
14
15
16 print(phrases[len(phrases) - 1])

CS 61B, Spring 2020, Discussion 2 1


2 Reading Code: A Mystery
Below is a function (or method) called mystery1. It takes in two arguments and returns an
integer, answer. The first argument it takes in is an array of integers called inputArray, and
the second argument it takes in is an integer, k.
1 public static int mystery1(int[] inputArray, int k) {
2 int x = inputArray[k];
3 int answer = k;
4 int index = k + 1;
5 while (index < inputArray.length) {
6 if (inputArray[index] < x) {
7 x = inputArray[index];
8 answer = index;
9 }
10 index = index + 1;
11 }
12 return answer;
13 }

Write the return value of mystery1 if inputArray is the array {3, 0, 4, 6, 3} and k is 2. What
is the significance of the value returned by mystery1 (what is the significance of answer)?

Extra: Below is another function called mystery2. It takes a single array of integers called
inputArray as an argument and returns nothing.
1 public static void mystery2(int[] inputArray) {
2 int index = 0;
3 while (index < inputArray.length) {
4 int targetIndex = mystery1(inputArray, index);
5 int temp = inputArray[targetIndex];
6 inputArray[targetIndex] = inputArray[index];
7 inputArray[index] = temp;
8 index = index + 1;
9 }
10 }

Describe what mystery2 will do and return if inputArray is the array {3, 0, 4, 6, 3}. Then,
explain in English what the method mystery2 does.

CS 61B, Spring 2020, Discussion 2 2


3 Recursion Practice: Fibonacci
Implement fib1 recursively. fib1 takes in an integer N and returns an integer representing the
Nth Fibonacci number. The Fibonacci sequence is 0, 1, 1, 2, 3, 5, 8, 13, 21, . . . , where 0 is the 0th
Fibonacci number. As a reminder, the Nth Fibonacci number is calculated as follows:
fib(N) = fib(N - 1) + fib(N - 2)
public static int fib1(int N) {

Extra: Implement fib2 in 5 lines or fewer that avoids redundant computation. fib2 takes in an
integer N and helper arguments k, f0, and f1 and returns an integer representing the Nth Fibonacci
number. If you’re stuck, try implementing fib1 iteratively and then see how you can transform
your iterative approach to implement fib2.
public static int fib2(int N, int k, int f0, int f1) {

Hint: To compute the Nth fibonacci number, call fib2(N, 0, 0, 1).

CS 61B, Spring 2020, Discussion 2 3

You might also like