Programming & Computer Science Answers

Consider a situation that a user wants to print first n (any value, e.g. first 10) numbers of Fibonacci series.

You need to implement a program that gets a number from user and prints first n Fibonacci series

numbers. Write a function for this purpose that prints Fibonacci series recursively. This function should

accept a number in parameter and then print n number of elements of Fibonacci series

An integer is said to be a perfect number if the sum of its divisors, including 1 (but not the number itself),

is equal to the number. For example, 6 is a perfect number, because 6 = 1 + 2 + 3. Write a function

isPerfect() that determines whether parameter number is a perfect number. Use this function in a

program that determines and prints all the perfect numbers between 1 and 1000. Print the divisors of

each perfect number to confirm that the number is indeed perfect. Challenge the power of your computer

by testing numbers much larger than 1000.

A parking garage charges a $2.00 minimum fee to park for up to three hours. The garage charges an

additional $0.50 per hour for each hour or part thereof in excess of three hours. The maximum charge for

any given 24-hour period is $10.00. Assume that no car parks for longer than 24 hours at a time. Write a

program that calculates and prints the parking charges for each of three customers who parked their cars

in this garage yesterday. You should enter the hours parked for each customer. Your program should print

the results in a neat tabular format and should calculate and print the total of yesterday’s receipts. The

program should use the function calculateCharges() to determine the charge for each customer. Your

outputs should appear in the following format:

Car Hours Charge

1 1.5 2.00

2 4.0 2.50

3 24.0 10.00

TOTAL 29.5 14.50

write an inline function, factorial (int x) which returns the factorial of value x. Test the function by reading values from the keyboard

Design a class having the constructor and destructor functions that should display the number of objects being created or destroyed of class type

consider the invert_dict function from Section 11.5 of your textbook. 

# From Section 11.5 of: 

# Downey, A. (2015). Think Python: How to think like a computer scientist. Needham, Massachusetts: Green Tree Press. 

def invert_dict(d):

   inverse = dict()

   for key in d:

      val = d[key]

     if val not in inverse:

        inverse[val] = [key]

     else:

        inverse[val].append(key)

   return inverse 

Modify this function so that it can invert your dictionary. In particular, the function will need to turn each of the list items into separate keys in the inverted dictionary. 

Run your modified invert_dict function on your dictionary. Print the original dictionary and the inverted one. 

Include your Python program and the output in your Learning Journal submission. 

Python Program

Write a program to print the following, Given a word W and pattern P, you need to check whether the pattern matches the given word.The word will only contain letters(can be Uppercase and Lowercase). The pattern can contain letters, ? and *.

? : Can be matched with any single letter.

* : Can be matched with any sequence of letters (including an empty sequence).

If the pattern matches with the given word, print True else False.

Sample Input1

3

Hello *l?

Hell He?ll

Hell ?*

Sample Output1

True

False

True

Sample Input1

3

Hello Hell*

Hell He*ll

Hell hell*

Sample Output1

True

True

False

Write a program that declares a structure to store BookID, price and pages of a book. It defines two structure variables and inputs values. It displays the record of most costly book.

b. Use the fraction structure from Part a, implement four-function fraction calculator. It uses

functions for each of the four arithmetic operations. They can be called fadd(), fsub(), fmul(), and

fdiv(). Each of these functions should take two arguments of type struct fraction, and return an

argument of the same type.

Search Game

A grid of letters may contain a word hidden somewhere within it. The letters of the word may be traced from the starting letter by moving a single letter at a time, up, down, left or right. For example, suppose we are looking for the word BISCUIT in this grid:

0 1 2 3

0 B I T R

1 I U A S

2 S C V W

3 D O N E

The word starts in the top left corner, continues downwards for 2 more letters, then the letter to the right followed by 2 letters moving upwards, the final letter at the right of the penultimate one.

Write a program in which we give target word and a grid of letters as input returns a list of tuples, each tuple being the row and column of the corresponding letter in the grid (numbered from 0). If the word cannot be found, output the string Not present

input1:

after

4

a b c d

f e f g

t e r r

a b i j

Output: [(0, 0),(1, 0),(2, 0),(2, 1),(2, 2)]

input2:

search

4

s e a c

r c c c

h e e e

h e e e

output: Not Present