<u>Answer:</u>
<em>Science fair always has experiments which prove science concepts.</em> Students will bring apparatus or an lab items and show experiments as a magic. There are only certain things which a Science can prove and show to other.
<em>From the given question, the following can be proved:
</em>
- <em>Does pressure have an effect on the volume of a gas?
</em>
- <em>Which brand of soap is the best for cleaning grease off dishes?
</em>
- <em>Which laboratory experiment is the most fun to perform?</em>
<em>
The below cannot be proved but can be explained
</em>
- <em>Is the information on the periodic table difficult to understand?
</em>
- <em>Which physicist was the smartest?</em>
Answer:
This will work for most languages, but this is mainly for c#. Double check what language your using before putting in this answer.
Console.WriteLine("What grade are you in?");
int grade = Convert.ToInt32(Console.ReadLine());
if (grade == 9)
{
Console.WriteLine("Freshman");
}
if (grade == 10)
{
Console.WriteLine("Sophomore");
}
if (grade == 11)
{
Console.WriteLine("Junior");
}
if (grade == 12)
{
Console.WriteLine("Senior");
}
if (grade < 8)
{
Console.WriteLine("Not in High School");
}
Explanation:
The first line asks what grade are you in, then when the user types in the grade it saves it in a variable. We then use that variable for the conditionals. The conditional states, whatever grade level your in, it prints your high school year title. If anything is lower than 8, it will print not in high school.
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 !!!
Answer:
humans,washing mashines,dish washers
Explanation:
