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.
The answer is the moon, mars, etc.
The rule of thumb that predicts that the number of transistors on a CPU will double every two years is called Moore's law.<span> The father of the Moore's law is Intel co-founder Gordon </span>Moore in 1965. This law states that <span>the number of transistors per square inch on integrated circuits had doubled every year since their invention.</span>
There are 64 bytes in one cache. Since there are 256 bits for data.Thus,there are 256 sets of 2 lines in a cache memory each. total 8 bits are required to identify the number of set number.For the 64 Mbyte main memory, a 26-bit address is needed. For the 64-MB main memory which consists of 2^22 cells.Therefore, the bits for set plus tag length would be 22 bits, tag length is 14 bits and the word field length is 4.
Explanation:
1 cache = 64 bytes
16 bits for "tag" and 256 bits (32 bytes) for data.
