Answer:
A) Array of buttons for<u> quick access </u>to commonly used <u>commands and tools</u>: Tool bar
That's what most people will use most of the time, to quickly perform the most common tasks.
B) <u>List of commands</u> to create, format and edit presentations: Menu Bar.
When the features listed in the tool bar aren't enough, we go to the Menu system, which lists all the features of the program.
C) <u>Provides info</u> about current slide<u> at the bottom</u> of the slide: Status Bar.
The status bar is always located at the <u>bottom of the screen</u>.
D) <u>Provides navigation</u> through the slides: Scroll bar.
Where you can scroll down and up your slides.
Answer:
Candidates resume shows his way of presenting and organizing.
Explanation:
- Resume formatting is an important part of a candidate's ability to work. In any professional environment, it's necessary to have a properly formatted resume.
- The resume formatting should be up to date with the latest information and data. The formatting involves the borders, headings, grammar, and spelling or typo errors, etc.
- But these mistakes can be easily avoided such as proofreading and removing unnecessary details and sloppy fronts.
to review the most important supporting points from the original information
Answer:
#include <iostream>
#include <cstring>
using namespace std;
bool isAPalindrome(char* palindrome);
int main()
{
char palindrome[30];
bool palindrome_check;
cout << "Please enter an word or phrase.\n";
cin.getline(palindrome, 30);
palindrome_check = isAPalindrome(palindrome);
if (palindrome_check = true)
{
cout << "Input is a palindrome\n";
}
else
{
cout << "Inputis not a palindrome\n;";
}
system("pause");
return 0;
}
bool isAPalindrome(char* palindrome)
{
char* front;
char* rear;
front = palindrome;// starts at the left side of the c string
rear = (palindrome + strlen(palindrome)) - 1;//starts at the right side of the c-string. adds the c string plus the incriment value of s
while (front <= rear)
{
if (front = rear)
{
front++;
rear--;
}
else
{
return false;
}
}
return true;
}
This is calculated by raising 2 to the power of the number of bits.
2^12 = 4096
