Answer:
1/2000
Explanation:
import java.util.Scanner;
public class InputExample {
public static void main(String [] args) {
Scanner scnr = new Scanner(System.in);
System.out.print("Enter birth month and date:");//comment this line if not needed
int birthMonth=scnr.nextInt();
int birthYear=scnr.nextInt();
String output= birthMonth+"/"+birthYear+"\n";
System.out.println(output);
}
}
if using this code the out put should be 1/2000
Answer:
Consistency
Explanation:
Bi integrating marketing communications, we can infer that the different brands working under Excel Enterprises have the same basic design, so the marketing department can sell their features easily, without having to create different campaigns or protocols for each individual product.
This homogeneous design then turns intuitive for the user, a textbook definition of consistent design, and the tone is maintained through the different brands.
Just like when you move from Microsoft's Excel to Microsoft's Word, you know the usage of each program is different, but the layout is the same, allowing you to understand the basics of the UX (user interface) of one, by understanding the other.
Answer:
yh3iuskjldnsjfhbcgfihekwfhei3wh8hfefbgp
Explanation:
Answer:
Let f be a function
a) f(n) = n²
b) f(n) = n/2
c) f(n) = 0
Explanation:
a) f(n) = n²
This function is one-to-one function because the square of two different or distinct natural numbers cannot be equal.
Let a and b are two elements both belong to N i.e. a ∈ N and b ∈ N. Then:
f(a) = f(b) ⇒ a² = b² ⇒ a = b
The function f(n)= n² is not an onto function because not every natural number is a square of a natural number. This means that there is no other natural number that can be squared to result in that natural number. For example 2 is a natural numbers but not a perfect square and also 24 is a natural number but not a perfect square.
b) f(n) = n/2
The above function example is an onto function because every natural number, let’s say n is a natural number that belongs to N, is the image of 2n. For example:
f(2n) = [2n/2] = n
The above function is not one-to-one function because there are certain different natural numbers that have the same value or image. For example:
When the value of n=1, then
n/2 = [1/2] = [0.5] = 1
When the value of n=2 then
n/2 = [2/2] = [1] = 1
c) f(n) = 0
The above function is neither one-to-one nor onto. In order to depict that a function is not one-to-one there should be two elements in N having same image and the above example is not one to one because every integer has the same image. The above function example is also not an onto function because every positive integer is not an image of any natural number.
The pseudo-code of the algorithm will be:
Start
Set n1 equal to 145 and n2 equal to 87.
Divide n1 by n2 and find the remainder.
Set n1 equal to n2 and n2 equal to the remainder.
Repeat steps 2 and 3 until the remainder is equal to 0.
The greatest common factor is n1.
End
What do you mean by pseudocode?
In computer science, pseudocode is indeed a plain language description of a steps in an algorithm or similar system. Pseudocode frequently employs structural patterns of a conventional programming language, although it is designed for human interpretation rather than machine reading. It generally omits features necessary for computation of the algorithm, including such variable declarations and language-specific code. When possible, the programming language is supplemented by natural language description details or succinct mathematical notation.
To learn more about pseudocode
brainly.com/question/24735155
#SPJ9
