Answer:
Option (B) Nominal is the correct option.
Explanation:
Nominal data set is the set of the heights of data measurement for the particular tax filing status. It also used for the labeling of the variables without allowing them to the quantitative data type. So, that's why the following option is correct.
Other options are wrong because the following statement is related to the Nominal data set.
Something like the following. Also you need to give what language you are using. Anyways, you should be able to convert this to your language of choice.
<script type="text/javascript">
function checkGeneration() {
var gen = ["Baby Boomer ","Generation X","Xennials","Generation Y"];
var reversestr = "";
var getyear = window.prompt("Enter a 3 digit number: ");
if (parseInt(getyear) <= 1964) {
alert(gen[0]);
} else if(parseInt(getyear) <= 1979) {
alert(gen[1]);
} else if(parseInt(getyear) <= 1985) {
alert(gen[2]);
} else if(parseInt(getyear) <= 1995) {
alert(gen[3]);
}
}
checkGeneration();
</script>
Answer:
In Java:
import java.util.*;
public class Main{
public static void main(String[] args) {
Scanner input = new Scanner(System.in);
String name;
System.out.print("First name: ");
name = input.next();
name= name.substring(0, 1).toUpperCase() + name.substring(1).toLowerCase();
System.out.print(name);
}
}
Explanation:
This declares name as string
String name;
This prompts the user for first name
System.out.print("First name: ");
This gets the name from the user
name = input.next();
This capitalizes the first letter of name and makes the other letters to be in lowercase
name= name.substring(0, 1).toUpperCase() + name.substring(1).toLowerCase();
This prints the formatted name
System.out.print(name);
Usually they hold 15-20 as the minimum of the portfolios
So I would say True
Answer:
The time complexity of the code is O(log₇n).
Explanation:
The i is updated by 7*i.On each iteration i is multiplied by 7.So on finding the time complexity of the code given above it will come out to be log base 7.
When we divide the input by 2 the time complexity is log base 2.
So on dividing it by 7 we get the time complexity of log base 7.
