3
thank me later :))))))))
Answer: provided in the explanation section
Explanation:
Given that:
Assume D(k) =║ true it is [1 : : : k] is valid sequence words or false otherwise
now the sub problem s[1 : : : k] is a valid sequence of words IFF s[1 : : : 1] is a valid sequence of words and s[ 1 + 1 : : : k] is valid word.
So, from here we have that D(k) is given by the following recorance relation:
D(k) = ║ false maximum (d[l]∧DICT(s[1 + 1 : : : k]) otherwise
Algorithm:
Valid sentence (s,k)
D [1 : : : k] ∦ array of boolean variable.
for a ← 1 to m
do ;
d(0) ← false
for b ← 0 to a - j
for b ← 0 to a - j
do;
if D[b] ∧ DICT s([b + 1 : : : a])
d (a) ← True
(b). Algorithm Output
if D[k] = = True
stack = temp stack ∦stack is used to print the strings in order
c = k
while C > 0
stack push (s [w(c)] : : : C] // w(p) is the position in s[1 : : : k] of the valid world at // position c
P = W (p) - 1
output stack
= 0 =
cheers i hope this helps !!!
Y’all just asking for people do your work, literally not even a question
Answer:
int state[] = new int[8];
Please Help! Unit 6: Lesson 1 - Coding Activity 2
Instructions: Hemachandra numbers (more commonly known as Fibonacci numbers) are found by starting with two numbers then finding the next number by adding the previous two numbers together. The most common starting numbers are 0 and 1 giving the numbers 0, 1, 1, 2, 3, 5...
The main method from this class contains code which is intended to fill an array of length 10 with these Hemachandra numbers, then print the value of the number in the array at the index entered by the user. For example if the user inputs 3 then the program should output 2, while if the user inputs 6 then the program should output 8. Debug this code so it works as intended.
The Code Given:
import java.util.Scanner;
public class U6_L1_Activity_Two{
public static void main(String[] args){
int[h] = new int[10];
0 = h[0];
1 = h[1];
h[2] = h[0] + h[1];
h[3] = h[1] + h[2];
h[4] = h[2] + h[3];
h[5] = h[3] + h[4];
h[6] = h[4] + h[5];
h[7] = h[5] + h[6];
h[8] = h[6] + h[7]
h[9] = h[7] + h[8];
h[10] = h[8] + h[9];
Scanner scan = new Scanner(System.in);
int i = scan.nextInt();
if (i >= 0 && i < 10)
System.out.println(h(i));
}
}
