Assignment-3

Name: Yogesh Mourya

Reg. No.: 22BCE10462

1. Program to count positive, negative, and zeros

import java.util.Scanner;

public class CountNumbers {

public static void main(String[] args) {
Scanner scanner = new Scanner(System.in);
int positiveCount = 0, negativeCount = 0, zeroCount = 0;
char choice;

do {
System.out.print("Enter a number: ");
int num = scanner.nextInt();

if (num > 0) {
positiveCount++;
} else if (num < 0) {
negativeCount++;
} else {
zeroCount++;
}

System.out.print("Do you want to continue? (y/n): ");

choice = scanner.next().charAt(0);
} while (choice == 'y' || choice == 'Y');

System.out.println("Positive numbers: " + positiveCount);

System.out.println("Negative numbers: " + negativeCount);
System.out.println("Zeros: " + zeroCount);
scanner.close();
}
}
2. Program to print Fibonacci Series

import java.util.Scanner;

public class FibonacciSeries {

public static void main(String[] args) {
Scanner scanner = new Scanner(System.in);
System.out.print("Enter the number of terms: ");
int n = scanner.nextInt();
int a = 0, b = 1, next;

System.out.print("Fibonacci Series: " + a + " " + b);

for (int i = 2; i < n; i++) {

next = a + b;
System.out.print(" " + next);
a = b;
b = next;
}
scanner.close();
}
}

3. Program to print all Armstrong numbers between 1 to 1000

public class ArmstrongNumbers {

public static void main(String[] args) {
System.out.println("Armstrong numbers between 1 and 1000:");

for (int num = 1; num <= 1000; num++) {

int number = num, originalNumber, remainder, result = 0;
originalNumber = number;

while (originalNumber != 0) {
remainder = originalNumber % 10;
result += Math.pow(remainder, 3);
originalNumber /= 10;
}

if (result == number) {
System.out.print(number + " ");
}
 }
}
}

4. Program to print the multiplication table of a given number

import java.util.Scanner;

public class MultiplicationTable {

public static void main(String[] args) {
Scanner scanner = new Scanner(System.in);
System.out.print("Enter a positive integer: ");
int num = scanner.nextInt();

System.out.println("Multiplication table of " + num + ":");

for (int i = 1; i <= 10; i++) {

System.out.println(num + " x " + i + " = " + (num * i));
}
scanner.close();
}
}

5. Pattern solutions

Pattern1: Right Half Pyramid Pattern

// Java Program to print

// Pyramid pattern

import java.util.*;

public class GeeksForGeeks {

// Function to demonstrate pattern

public static void printPattern(int n)

int i, j;

// outer loop to handle rows

 for (i = 1; i <= n; i++) {

// inner loop to handle columns

for (j = 1; j <= i; j++) {

System.out.print("*");

// printing new line for each row

System.out.println();

// Driver Function

public static void main(String args[])

int n = 6;

printPattern(n);

Pattern2: Left Half Pyramid Pattern

// Java Program to print pattern

// Left Half Pyramid pattern

import java.util.*;

public class GeeksForGeeks {

// Function to demonstrate pattern

public static void printPattern(int n)

{

int i, j;

// outer loop to handle rows

for (i = n; i >= 1; i--) {

// inner loop to print spaces.

for (j = 1; j < i; j++) {

System.out.print(" ");

// inner loop to print stars.

for (j = 0; j <= n - i; j++) {

System.out.print("*");

// printing new line for each row

System.out.println();

// Driver Function

public static void main(String args[])

int n = 6;

printPattern(n);
 }

Pattern3: Full Pyramid Pattern

// Java Program to print

// Triangular Pattern

import java.util.*;

public class GeeksForGeeks {

// Function to demonstrate pattern

public static void printPattern(int n)

int i, j;

// outer loop to handle rows

for (i = 0; i < n; i++) {

// inner loop to print spaces.

for (j = n - i; j > 1; j--) {

System.out.print(" ");

// inner loop to print stars.

for (j = 0; j <= i; j++) {

System.out.print("* ");

}
 // printing new line for each row

System.out.println();

// Driver Function

public static void main(String args[])

int n = 6;

printPattern(n);