#### All Pages

Assignment Help:

program 1 :

public int stringOccurrences(int n, String str){

if(n >= 40)
return -1;
if(str.replaceAll("X|Y|Z","").length()>0)
return -1;
return(res.length() - res.replaceAll(str,"").length())/(str.length());
}
if(n == 0) return "X";
if(n == 1) return "Y";
if(n == 2) return "Z";

}
public static void main(String []args)
{
System.out.println(p.stringOccurrences(21,"YZ"));
}
}

Program set 2 :
import java.util.Scanner;
import java.util.ArrayList;

{
public static void main(String[] arg)
{
System.out.println("Enter starting no. : ");
System.out.println("Enter ending no. : ");
int[] ans = getSeries(start, end);
for (int a : ans)
System.out.print(a + " ");
}

public static int[] getSeries(int s, int e)
{
ArrayList list = new ArrayList();
int i, j = 0;
for (i = s; i <= e; i++, j++)
int[] ans = new int[j];
for (i = 0; i < j; i++)
ans[i] = list.get(i);
return ans;
}

{
if (p == 0 || p == 1 || p == 2)
return 1;
}
}

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:

Specify the work directory path in the 'Work Directory Path' field. The path should correspond to your solution project directory.
You will find the following three folders:
bin
src
lib
Code the solution in  . java file inside the src folder

Step 1:

Implement your logic in public int stringOccurrences(int n, String str) in class PadovanString.
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.
String    str : str is a string represents sub string whose occurrence has to be found in the main string.

You can create more methods but, do it in the same class.

Step 2:
In your solution keep in mind the following constraints:.

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).
Padovan formula is P(n) = P(n-2) + P(n-3) where n>2 and n is the integer.
In the above Padovan formula + sign means string concatenation.
For the Padovan formula value of P(0),P(1) and P(2) is given. You have to use those value only.
n should not be greater than 40 otherwise return -1
string str should be consist of only X,Y and Z in upper case otherwise return -1

The Prototype of the method is:
public int stringOccurrences(int n, String str).
This method 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 find in the main string.

This method returns a number of occurrence of string str in the main string.

The constraints are:

n should not be greater than 40 otherwise return -1
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 :

#### Decodethecode, how to decode the numerals to string..

how to decode the numerals to string..

#### Demo assignment, Please send me demo assignment,I want work

Please send me demo assignment,I want work

#### Write a program to calculate the average of ten numbers, Write a program to...

Write a program to calculate the average of ten numbers       #include stdio.h     /* Only this header is needed since only IO are used */     void main()     {          char

#### Variables within c, Within software languages we have the ability to store ...

Within software languages we have the ability to store information in mail boxes i.e. memory slots which are given names to represent the box. The naming rules are governed by the

#### .program for superposition of waves, .program for superposition of sin wave...

.program for superposition of sin waves

#### Intro to C++ Lab Help, I have a very confusing assignment and I''m struggli...

I have a very confusing assignment and I''m struggling to find the right place to begin or how to break the problem down.

#### Calculation of mortgage interest rates, 1. When developing this project in ...

1. When developing this project in a Win32 Console Applications that includes the precompiled headers, enter in the Name: box, PRJ2[Your Full Last Name][Your First Initial] with no

#### Write a program that illustrate Macros with Arguments, Write a program tha...

Write a program that illustrate  Macros with Arguments? Macros is able to also have arguments, just as functions can. #define AREA(x)(3.14*x*x) Then at any time the prepr

#### Nested if else, input marks of c and c++ if c grater than equal to 50 grate...

input marks of c and c++ if c grater than equal to 50 grater than 50 you are pass if c greater than equal to 50 c++ less than 50 than supplementry c++ if c less then 50 and c++ gra

#### Pointer, solution of problem based on poiter

solution of problem based on poiter

#### diana

9/4/2012 4:14:57 AM

program 1 :

public int stringOccurrences(int n, String str){

if(n >= 40)
return -1;
if(str.replaceAll("X|Y|Z","").length()>0)
return -1;
return(res.length() - res.replaceAll(str,"").length())/(str.length());
}
if(n == 0) return "X";
if(n == 1) return "Y";
if(n == 2) return "Z";

}
public static void main(String []args)
{
System.out.println(p.stringOccurrences(21,"YZ"));
}
}

Program set 2 :
import java.util.Scanner;
import java.util.ArrayList;

{
public static void main(String[] arg)
{
System.out.println("Enter starting no. : ");
System.out.println("Enter ending no. : ");
int[] ans = getSeries(start, end);
for (int a : ans)
System.out.print(a + " ");
}

public static int[] getSeries(int s, int e)
{
ArrayList list = new ArrayList();
int i, j = 0;
for (i = s; i <= e; i++, j++)
int[] ans = new int[j];
for (i = 0; i < j; i++)
ans[i] = list.get(i);
return ans;
}

{
if (p == 0 || p == 1 || p == 2)
return 1;
}
}

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:

Specify the work directory path in the ''Work Directory Path'' field. The path should correspond to your solution project directory.
You will find the following three folders:
bin
src
lib
Code the solution in . java file inside the src folder

Step 1:

Implement your logic in public int stringOccurrences(int n, String str) in class PadovanString.
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.
String str : str is a string represents sub string whose occurrence has to be found in the main string.

You can create more methods but, do it in the same class.

Step 2:
In your solution keep in mind the following constraints:.

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).
Padovan formula is P(n) = P(n-2) + P(n-3) where n>2 and n is the integer.
In the above Padovan formula + sign means string concatenation.
For the Padovan formula value of P(0),P(1) and P(2) is given. You have to use those value only.
n should not be greater than 40 otherwise return -1
string str should be consist of only X,Y and Z in upper case otherwise return -1

The Prototype of the method is:
public int stringOccurrences(int n, String str).
This method 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 find in the main string.

This method returns a number of occurrence of string str in the main string.

The constraints are:

n should not be greater than 40 otherwise return -1
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 :