Answer:
Algorithm for the above problem:
- Take a string from the user input.
- store the input string on any variable.
- Reverse the string and store it on the other variable.
- Compare both strings (character by character) using any loop.
- If all the character of the string matched then print that the "Input string is a palindrome".
- Otherwise, print "The inputted string is not a palindrome."
Output:
- If the user inputs "ababa", then it prints that the "Input string is palindrome"
- If the user inputs "ababaff", then it prints that the "Input string is not palindrome"
Explanation:
- The above-defined line is a set of an algorithm to check the number is palindrome or not.
- It is defined in English because the algorithm is a finite set of instructions written in any language used to solve the problem.
- The above algorithm takes input from the user, compare that string with its reverse and print palindrome, if the match is found.
The central processing unit (CPU<span>) </span>works in conjunction<span> with </span><span>______ to perform processing</span>
Answer:
25% chance.
Explanation:
There is 25% chance it'll be h*m*zygous red, 50% chance it'll be h*t*rozygous red, and 25% chance it'll be h*m*zygous wh*te.
(Censored because it wouldn't let me post it for some reason. Honestly hope this doesn't work.)
Answer:
True but it might be false but i think is true
