Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- 2a.int n = 1;
- while (n <= max) {
- System.out.println(n);
- n++;
- }
- int total = 25;
- 2b.int number = 1;
- while (number <= (total / 2)) {
- total = total - number;
- System.out.println(total + " " + number);
- number++;
- }
- 2c.int i = 1;
- while (i <= 2) {
- int j = 1;
- while (j <= 3) {
- int k = 1;
- while (k <= 4) {
- System.out.print("*");
- k++;
- }
- System.out.print("!");
- j++;
- }
- System.out.println();
- i++;
- }
- 2d.int number = 4;
- int count = 1;
- while (count <= number) {
- System.out.println(number);
- number = number / 2;
- count++;
- }
- 4.
- 19 , 0
- 21, 1
- 3 , 4
- 5 , 3
- 1 , 6
- 6.
- Random rand = new Random();
- int num = rand.nextInt(11);
- 8.
- 1 11 21 31 41 51 61 71 81 91
- 10.
- public static int zeroD(int number) {
- int count = 0;
- do {
- if (number % 10 == 0) {
- count++;
- }
- number = number / 10;
- } while (number > 0);
- return count;
- }
- 12.
- public static void printL(String text) {
- if (text.length() > 0) {
- System.out.print(text.charAt(0));
- for (int i = 1; i < text.length(); i++) {
- System.out.print("-" + text.charAt(i));
- }
- }
- 14.
- true
- true
- false
- true
- true
- false
- false
- true
- true
- true
- true
- false
- 16.
- After it it goes finds a factor once it will go to prime is flase however when it runs it again prime will be reset to true.
- public static boolean isPrime(int n) {
- boolean prime = true;
- for (int i = 2; i < n; i++) {
- if (n % i == 0) {
- prime = false;
- }
- }
- return prime;
- }
- 18.
- public static boolean startEndSame(String str) {
- return str.charAt(0) == str.charAt(str.length() - 1);
- }
- 20.
- 3,1,2,6,15
- 22.
- !b
- (x <= y) || (y <= z)
- (x != y) && (x > z)
- (x % 2 == 0) || !b
- (x / 2 != 13) && !b && (z * 3 != 96)
- (z >= x) || (z <= y && x < y)
Advertisement
Add Comment
Please, Sign In to add comment