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
5 bit unsigned binary number is from 0 to (25-1) which is equal from minimum value 0 (i.e., 00000) to maximum value 31 (i.e., 11111).
Answer:
The answer is option A.
Explanation:
Negative numbers can be found by binary search, this makes option B incorrect.
Unsorted and randomized lists are also not things that support a binary search, options C and D are incorrect.
Binary search uses a technique where the middle element of the list is located and used to determine whether the search should be done within the lower indexed part of the list or the higher. So for a list to be binary search-able, it should be sorted and not randomized.
The answer is A.
I hope this helps.
Https://wordribbon.tips.net/T010192_Drop_Shadows_for_Tables.html
