<span>C) Always better to give your information and end on time.</span>
Answer:
one sec
what is that called?
if you have more than one try
then you should just take an "EDUCATIONAL GUESS"
it's a 50/50 chance
just take it
Explanation:
<h2><u><em>
YOU GOT THIS MAN! :3</em></u></h2>
Basic blocks are identified because they are known to be a straight line that is known also as a code sequence that tends to have no branches in regards to its in and out branches and its exception is only to the entry and at the end.
Note that Basic Block is said to be a composition of statements that is known to be one that often always executes one after other, and this is often done in a sequence.
<h3>How do you create a flow graph from the basic blocks?</h3>
Flow graph is gotten by:
- Lets Block B1 be the initial node and also Block B2 will tend to follows B1, so from B2 to B1 there is seen a kind of an edge.
Note that the first task is for a person to partition a sequence of three-address code and this is done into basic blocks.
Hence, Basic blocks are identified because they are known to be a straight line that is known also as a code sequence that tends to have no branches in regards to its in and out branches and its exception is only to the entry and at the end.
Learn more about basic blocks from
brainly.com/question/132319
#SPJ1
I would say none of the above as A, B, and C do not seem like sensible answers.
Answer:
#include <bits/stdc++.h>
using namespace std;
bool isPalindrome(string str)
{
char a,b;
int length = str.length();
for (int i = 0; i < length / 2; i++)
{
a=tolower(str[i]);//Converting both first characters to lowercase..
b=tolower(str[length-1-i]);
if (b != a )
return false;
}
return true;
}
int main() {
string t1;
cin>>t1;
if(isPalindrome(t1))
cout<<"The string is Palindrome"<<endl;
else
cout<<"The string is not Palindrome"<<endl;
return 0;
}
Output:-
Enter the string
madam
The string is Palindrome
Enter the string
abba
The string is Palindrome
Enter the string
22
The string is Palindrome
Enter the string
67876
The string is Palindrome
Enter the string
444244
The string is not Palindrome
Explanation:
To ignore the cases of uppercase and lower case i have converted every character to lowercase then checking each character.You can convert to uppercase also that will also work.