please help to solve a c program, C/C++ Programming

Assignment Help:
Padovan String
Problem Description

A Padovan string P(n) for a natural number n is defined as:

P(0) = ‘X’

P(1) = ‘Y’

P(2) = ‘Z’

P(n) = P(n-2) + P(n-3), n>2
where + denotes string concatenation.
For a string of the characters ‘X’ , ‘Y’ and ‘Z’ only, and given value of n, write a program that counts the number of occurrences of the string in the n-th Padovan string P(n).


An example is given below.

For n = 6 and the string ZY, the program should count the occurrences of ZY in P(6).

P(0) = ‘X’

P(1) = ‘Y’

P(2) = ‘Z’

P(n) = P(n-2) + P(n-3), n>2


P(3) = P(1)+P(0)

P(3) = YX


P(4) = P(2)+P(1)

P(4) = ZY


P(5) = P(3)+P(2)

P(5) = YXZ


P(6) = P(4)+P(3)

P(6) = ZYYX

So, the number of occurrences of the string ZY in P(6) is 1.
Instruction to work with Open PBT Client:
1. Specify the work directory path in the ''Work directory Path'' field. The path should correspond to your solution Work directory.
2. Download the support files by clicking the Get Dev Files.
3. You will find the problem directories containing:
o problem.h file
o problem.c file
in your project directory.
4. Code the solution in .c file inside the problem directory
5. All required files will be downloaded to your work directory. Creating additional files is strongly discouraged.
Step 1:
In your Solution File:
• Implement your logic in function int stringOccurrences(int n, char* str)
• int n :n is an integer represents n(th) for which full main string has to formed, from which occurrence of string str has to be found.
• char* str :str is a string represents sub string whose occurrence has to be found in the main string.
• You can create more functions if required, but those functions should be in the same file.

Step 2:
In your solution keep in mind the following constraints:.
1. In this problem you have to write a program that counts the number of occurrences of the string in the n-th Padovan string P(n).
2. Padovan formula is P(n) = P(n-2) + P(n-3) where n>2 and n is the integer.
3. In the above Padovan formula + sign means string concatenation.
4. For the Padovan formula value of P(0),P(1) and P(2) is given. You have to use those value only.
5. n should not be greater than 40 otherwise return -1
6. string str should be consist of only X,Y and Z in upper case otherwise return -1
The Prototype of the function is
int stringOccurrences(int n, char* str)
This function takes following arguments.
• n is the value for which full main string has to formed, from which occurrence of string str has to be found.
• str represents sub string whose occurrence has to be found in the main string.
• This function returns a number of occurrence of string str in the main string.
The constraints are:
1. n should not be greater than 40 otherwise return -1
2. string str should be consist of only X,Y and Z in upper case otherwise return -1
Example 1
Input
________________________________________
int n = 6
string str = ZY
Output
________________________________________
1
Explanation : This question is explained in problem description.
Example 2
Input
________________________________________
int n = 6
String str = ZYmm
Output
________________________________________
-1
Explanation :
String str is containing character other than X, Z and Y.
Example 3
Input
________________________________________
int n = 8
String str = XZ
Output
________________________________________
1
For C solutions
Header File : padovanstring.h
Function Name : int stringOccurrences(int n, char* str)
File Name : padovanstring.c
For C++ solutions
Header File : padovanstring.h
Class Name : PadovanString
Function Name : int stringOccurrences(int n, char* str)
File Name : padovanstring.c
General Instructions
* The file / class names, functions, method signatures, header files are to be used as mentioned in the problem statement. Do not use your own names or change the method signatures and fields. You can add any number of additional methods.
* For C solutions, change the value of "C_OR_CPP" macro in header file as 1 and for C++ solutions change the value as 2.
* In case of iostream.h specify as iostream only.
* Command line options for the main() function are not supported currently.


Related Discussions:- please help to solve a c program

Determine the total resistance of the circuit, For the circuit shown in Fig...

For the circuit shown in Figure, verify (a) the battery voltage V , (b) the total resistance of the circuit, and (c) the values of resistance of resistors R 1 , R 2 and

Binary search tree is constructed by repeatedly, Assume that a Binary Searc...

Assume that a Binary Search Tree is constructed by repeatedly inserting exact values in to the tree. Argue that the number of nodes examined in searching for a value in the tree is

Game, how to make a game

how to make a game

C#, 1. write a program named InputMethodDemo2 that eliminates the repetitiv...

1. write a program named InputMethodDemo2 that eliminates the repetitive code in the InputMethod() in the InputMethodDemo program. Rewrite the program so the InputMethod()contains

#change to palidrome program, #A palindrome is a string that reads the same...

#A palindrome is a string that reads the same from both the ends. Given a string S convert it to a palindrome by doing character replacement. Your task is to convert S to palindrom

Stack, flow chart for push operation in stack

flow chart for push operation in stack

Miss, Depreciation to a salvage value of 0. For tax purposes an item m...

Depreciation to a salvage value of 0. For tax purposes an item may be depreciated over a period of several years, n. With the straight line method of depreciati

Assignment help, #questionHi, I am looking for help with the assignment, ca...

#questionHi, I am looking for help with the assignment, can you help..

Program is to append the contents of one file to another, Program is to app...

Program is to append the contents of one file to another: void main()    {   clrscr();   fstream file1,file2;   char st1[13],st2[13];/* 13 because a filename canno

What is b-tree, B-tree: A B-tree is an also called balanced m-way tree. A ...

B-tree: A B-tree is an also called balanced m-way tree. A node of the tree may have many records or key and pointers to children. It is also called as the balanced sort tree. It s

Write Your Message!

Captcha
Free Assignment Quote

Assured A++ Grade

Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!

All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd