Name: CSE225 Homework 1 -Solved
SKU: 91901
Availability: InStock

Description

1/5 - (2 votes)

1) 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, ..) 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).

Example:

Please enter the number of lines (n=): 2

bunnyEars2(0) → 0

bunnyEars2(1) → 2

bunnyEars2(2) → 5

2) In this question, you will write a program to find super digit of a number X using the following

rules:

If X has only 1 digit, then its super digit is X.
If X has more than 1 digit, then its super digit is equal to the super digit of the digit-sum of X.

Example:

superDigit(1245) = superDigit(1+2+4+5)

= superDigit(12)

= superDigit(1+2)

= superDigit(3)

= 3.

The number X will be given to your program with two numbers (n and k) and you will

construct the number X as the number n concatenated k times.

Example:

Please enter a number (n=) : 123

Please enter repetition factor (k=) : 3

Super digit of number 123123123 is 9.Assoc.Prof.Dr. Mustafa AĞAOĞLU

CSE1242 – S’22 | HW#3

2/7

3) In this question, you will print identical triangles nested each other recursively. You will construct

the triangles by using two digits ‘_’(underscore) and ‘1’. There will be number of iterations given

as an input to your program.

If the number of iterations is given as 0, you will print a simple triangle by using 32 rows and

63 columns in a matrix as the following:

_______________________________1_______________________________

______________________________111______________________________

_____________________________11111_____________________________

____________________________1111111____________________________

___________________________111111111___________________________

__________________________11111111111__________________________

_________________________1111111111111_________________________

________________________111111111111111________________________

_______________________11111111111111111_______________________

______________________1111111111111111111______________________

_____________________111111111111111111111_____________________

____________________11111111111111111111111____________________

___________________1111111111111111111111111___________________

__________________111111111111111111111111111__________________

_________________11111111111111111111111111111_________________

________________1111111111111111111111111111111________________

_______________111111111111111111111111111111111_______________

______________11111111111111111111111111111111111______________

_____________1111111111111111111111111111111111111_____________

____________111111111111111111111111111111111111111____________

___________11111111111111111111111111111111111111111___________

__________1111111111111111111111111111111111111111111__________

_________111111111111111111111111111111111111111111111_________

________11111111111111111111111111111111111111111111111________

_______1111111111111111111111111111111111111111111111111_______

______111111111111111111111111111111111111111111111111111______

_____11111111111111111111111111111111111111111111111111111_____

____1111111111111111111111111111111111111111111111111111111____

___111111111111111111111111111111111111111111111111111111111___

__11111111111111111111111111111111111111111111111111111111111__

_1111111111111111111111111111111111111111111111111111111111111_

111111111111111111111111111111111111111111111111111111111111111

3/7

If the number of iterations is given as 1, you will create 3 triangles by calculating their 3

corner points using the original triangle in the previous iteration. It should be noted that the

original triangle at iteration 0 will be decomposed three identical triangles as the following: