Answer:
When printing a single contact, go to File and then Print; the only style available is Memo style .
When printing multiple contacts, there are several styles to choose from
Explanation:
<em>The question has been answered (by you). I will help you with the explanation. The texts in bold in the answer section represent the answer.</em>
<em />
The question is an illustration of Microsoft outlook.
In Microsoft outlook, the default style of printing is the memo style of printing. This is the only form of printing allowed when printing single contacts. In other words, other forms of printing cannot be selected.
However, there are several options available when multiple contacts are to be printied. Some of the printing styles are: phone directory style, card style, medium booklet style, etc.
<span>Create new ad groups with related keywords grouped together</span>
Answer:
An array.
Explanation:
An array can be defined as a structure that organizes data in a list that is commonly 1-dimensional or 2-dimensional.
Simply stated, an array refers to a set of memory locations (data structure) that comprises of a group of elements with each memory location sharing the same name. Therefore, the elements contained in array are all of the same data type e.g strings or integers.
Basically, in computer programming, arrays are typically used by software developers to organize data, in order to search or sort them.
Binary search is an efficient algorithm used to find an item from a sorted list of items by using the run-time complexity of Ο(log n), where n is total number of elements. Binary search applies the principles of divide and conquer.
In order to do a binary search on an array, the array must first be sorted in an ascending order.
Hence, array elements are mainly stored in contiguous memory locations on computer.
Answer:
// here is code in c++.
#include <bits/stdc++.h>
using namespace std;
// main function
int main() {
// variables to read birth month and year
int birthMonth,birthYear;
cout<<"Enter the birth month:";
// read the birth month
cin>>birthMonth;
cout<<"Enter the birth Year:";
// read the birth year
cin>>birthYear;
// print the output
cout<<birthMonth<<"-"<<birthYear<<endl;
return 0;
}
Explanation:
Declare two variables "birthMonth" and "birthYear". Read the value of birthMonth and birthYear from user. Then print the birth month and birth year and a dash(-) in between them.
Output:
Enter the birth month:1
Enter the birth Year:2000
1-2000
Enter the birth month:5
Enter the birth Year:1950
5-1950
The recursive function would work like this: the n-th odd number is 2n-1. With each iteration, we return the sum of 2n-1 and the sum of the first n-1 odd numbers. The break case is when we have the sum of the first odd number, which is 1, and we return 1.
int recursiveOddSum(int n) {
if(2n-1==1) return 1;
return (2n-1) + recursiveOddSum(n-1);
}
To prove the correctness of this algorithm by induction, we start from the base case as usual:
by definition of the break case, and 1 is indeed the sum of the first odd number (it is a degenerate sum of only one term).
Now we can assume that 
returns indeed the sum of the first n-1 odd numbers, and we have to proof that 
returns the sum of the first n odd numbers. By the recursive logic, we have
and by induction, is the sum of the first n-1 odd numbers, and 2n-1 is the n-th odd number. So, is the sum of the first n odd numbers, as required:
