4 THE BUNNY EAR PROBLEM We have bunnies standing in a line, numbered 1, 2, ... The odd bunnies (1, 3, ..) have the normal 2 ears. The even bunnies (2, 4, ..) we'll say have 3 ears, because they each have a raised foot. Recursively return the number of "ears" in the bunny line 1, 2,... n (without loops or multiplication) for the number of bunnies entered by the user. bunnyEars2(0)→ 0 bunnyEars2(1)→→2 bunnyEars2(2)→→ 5

4 THE BUNNY EAR PROBLEM We have bunnies standing in a line, numbered 1, 2, ... The odd bunnies (1, 3, ..) have the normal 2 ears. The even bunnies (2, 4, ..) we'll say have 3 ears, because they each have a raised foot. Recursively return the number of "ears" in the bunny line 1, 2,... n (without loops or multiplication) for the number of bunnies entered by the user. bunnyEars2(0)→ 0 bunnyEars2(1)→→2 bunnyEars2(2)→→ 5

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

Similar questions

Let ∑={a,b} and T be the set of words in ∑* that have no consecutive a’s (i.e. there cannot be 2 or more a’s in a row). (a) Give a recursive definition for the set T. (b) Use your recursive definition to show that the string “abbaba” is in T. (c) Is your recursive definition uniquely determined? Explain why or why not.
A game is played by moving a marker ahead either 2 or 3 steps on a linear path. Let cn be the number of different ways a path of length n can be covered. Given, Cn =Cn-2 + Cn-3, Ci=0, c2=1, c3=1 Write a recursive algorithm to compute Cn.
Computer Science Describe the state graph of the Towers of Hanoi puzzle for general n. Prove that the puzzle is always solvable, and find the number of moves in the shortest possible solution. (It will be useful to have a recursive definition of the state space.)
Draw the results of using the recursive ruler-drawing algorithm for thesevalues of the arguments: rule(0, 11, 4), rule(4, 20, 4), and rule(7, 30, 5).
For the problems given below, determine whether it is more efficient to use a divide and conquer strategy or a dynamic programming strategy, explain your reason. Give the recursion formula for each. (3*4=12) Find the average of a given set of unsorted numbers. Find whether there is a subset of integers in a given set that adds up to 8 Given a set of numbers, can they set be partitioned into two groups such that the sum of each group is equal; i.e 1,5,11,5 can be partitioned to 1,5,5 and 11
Tiling: The precondition to the problem is that you are given threeintegers n, i, j, where i and j are in the range 1 to 2n. You have a 2n by 2n squareboard of squares. You have a sufficient number of tiles each with the shape . Your goalis to place nonoverlapping tiles on the board to cover each of the 2n × 2n tiles except forthe single square at location i, j. Give a recursive algorithm for this problem in whichyou place one tile yourself and then have four friends help you. What is your base case?
On the Island of Knights and Knaves we have two people A and B. A says: Exactly one of us is a knight if and only if B is a knight. B says: A is a knight if I’m a knight. determine if A and B are each a knight or a knave. (The problem might have no solutions, one solution, or many solutions.)
Consider a case in which recursive binary search might be useful. What would you do in such situation? What is the first stopping condition for a recursive binary search?
Computer Science Please do a simple JAVA code for the Monty Hall problem. Suppose you're on a game show, and you're given the choice of three doors: Behind one door is a car; behind the others, goats. You pick a door, say No. 1, and the host, who knows what's behind the doors, opens another door, say No. 3, which has a goat. He then says to you, "Do you want to pick door No. 2?" Is it to your advantage to switch your choice? Please have the following Main allows the person playing to choose any door class door: should have data member methods Class person: should have data methods
Now suppose that n is not 2i for any integer i. How would we change the algorithmso that it handles the case when n is odd? I have two solutions: one that modifiesthe recursive algorithm directly, and one that combines the iterative algorithm andthe recursive algorithm. You only need to do one of the two (as long as it works anddoes not increase the BigOh of the running time.)
Let E(x) = 1 if x is a multiple of 3, E(x) = 0, otherwise. Show that E(x) is primitive recursive.
with n=6 and A=(3,5,4,1,3,2). Draw the corresponding walkthrough as shown in P.173. No subsequent recursive call to Quicksort is needed.