Skip to main content

Java Tutorial For Beginners: Part 8.

Java Program To Swap Two Numbers Without Temporary Variable
import java.util.Scanner;
class SwapNumbers {
public static void main(String args[]) {
int x, y;

System.out.println("Enter x and y:");
Scanner n = new Scanner(System.in);
x = n.nextInt();
y = n.nextInt();

System.out.println("Before Swapping:\nx = "+x+"\ny = "+y);
x = x + y;
y = x - y;
x = x - y;

System.out.println("After Swapping:\nx = "+x+"\ny = "+y);
n.close();
}}

Java Program To Swap Two Numbers Using Temporary Variable
import java.util.Scanner;
class SwapNumbers2 {

public static void main(String args[]) {
int x, y, temp;

System.out.println("Enter x and y:");
Scanner n = new Scanner(System.in);

x = n.nextInt();
y = n.nextInt();
System.out.println("Before Swapping:\nx = "+x+"\ny = "+y);

temp = x;
x = y;
y = temp;

System.out.println("After Swapping:\nx = "+x+"\ny = "+y);
n.close();
}}

Java Program To Find The Largest And Smallest Among N Numbers
import java.util.*;
public class MaxMinElement {

private static Scanner s;
public static void main(String args[]) {

int count, i;
double max, min;
double[] inputArray = new double[500];

s = new Scanner(System.in);

System.out.print("How Many Elements You Want To Compare: ");
count = s.nextInt(); 
System.out.println("Enter " + count + " Elements: ");

for(i=0; i < count; i++) {
inputArray[i] = s.nextDouble();  
}
max = min = inputArray[0];
for(i = 1; i < count; i++) {
if(inputArray[i] > max)
max = inputArray[i];

else if (inputArray[i] < min)
min = inputArray[i];
}

System.out.println("\nLargest Number: " + max);
System.out.println("Smallest Number : " + min);
}}

Java Program To Multiply Two Matrices
import java.util.Scanner;
public class MatrixMultiplication {
private static Scanner s;

public static void main(String[] args) {
s = new Scanner(System.in);

System.out.print("Enter Number Of Rows In A: ");
int rowsInA = s.nextInt();

System.out.print("Enter Number Of Columns In A / Rows In B: ");
int columnsInA = s.nextInt();

System.out.print("Enter Number Of Columns In B: ");
int columnsInB = s.nextInt();
int[][] a = new int[rowsInA][columnsInA];
int[][] b = new int[columnsInA][columnsInB];

System.out.println("\nEnter Matrix A: ");
for (int i = 0; i < a.length; i++) {
for (int j = 0; j < a[0].length; j++) {
a[i][j] = s.nextInt();
}}

System.out.println("\nEnter Matrix B: ");
for (int i = 0; i < b.length; i++) {
for (int j = 0; j < b[0].length; j++) {
b[i][j] = s.nextInt();
}}

int[][] c = multiply(a, b);
System.out.println("\nNow Multiplying A and B Matrices: ");

for (int i = 0; i < c.length; i++) {
for (int j = 0; j < c[0].length; j++) {
System.out.print(c[i][j] + " ");
}
System.out.println();
}}

public static int[][] multiply(int[][] a, int[][] b) {
int rowsInA = a.length;
int columnsInA = a[0].length; // same as rows in B
int columnsInB = b[0].length;

int[][] c = new int[rowsInA][columnsInB];
for (int i = 0; i < rowsInA; i++) {
for (int j = 0; j < columnsInB; j++) {
for (int k = 0; k < columnsInA; k++) {
c[i][j] = c[i][j] + a[i][k] * b[k][j];
}}}
return c;
}}
Labels:

Popular posts from this blog

Introduction To Algorithms, 3rd Edition

Before there were computers, there were algorithms. But now that there are computers, there are even more algorithms, and algorithms lie at the heart of computing. This book provides a comprehensive introduction to the modern study of computer algorithms. It presents many algorithms and covers them in considerable depth, yet makes their design and analysis accessible to all levels of readers. In this book, the authors tried to keep explanations elementary without sacrificing depth of coverage or mathematical rigor. Each chapter presents an algorithm, a design technique, an application area, or a related topic. Algorithms are described in English and in a pseudocode designed to be readable by anyone who has done a little programming. The book contains 244 figures — many with multiple parts — illustrating how the algorithms work. It also includes careful analysis of the running times of all algorithms. In this third edition, the entire book once again updated including changes cove...
Read more

C Program To Check Whether A Number Is Palindrome Or Not.

This program takes an integer from user and the integer is reversed. If the reversed integer is equal to the integer entered by user then that number is a palindrome. If not that number is not a palindrome.   #include <stdio.h> int main()  { int num, temp, remainder, reverse = 0; printf("Enter an integer: "); scanf("%d", &num); /*  original number is stored at temp */ temp = num; while (num > 0)  { remainder = num % 10; reverse = reverse * 10 + remainder; num /= 10;   }
Read more

C++ Program To Implement Casino Number Guessing Game.

#include <iostream> #include <string> #include <cstdlib> #include <ctime> using namespace std; void drawLine(int n, char symbol); void rules(); int main() { string playerName; int amount; int bettingAmount; int guess; int dice; char choice; srand(time(0)); drawLine(70,'_'); cout << "\n\n\n\t\tCASINO GAME\n\n\n\n"; drawLine(70,'_'); cout << "\n\nEnter Your Name : "; getline(cin, playerName); cout << "\n\nEnter Deposit Amount To Play Game : $"; cin >> amount;
Read more

C Program To Convert Natural Numbers To Roman Numerals.

Roman Number System of representing numbers devised by the ancient Romans. The numbers are formed by combinations of the symbols I, V, X, L, C, D, and M, standing, respectively, for 1, 5, 10, 50, 100, 500, and 1,000 in the Hindu-Arabic numeral system. Natural numbers mean no negative numbers and no fractions, i.e. the whole numbers from 1 upwards: 1, 2, 3, and so on. Here is source code of the C program to convert natural numbers to Roman Numerals. It compiles and runs on any operating system. #include <stdio.h> void predigit(char num1, char num2); void postdigit(char c, int n); char romanval[1000]; int i = 0; int main() { int j; long number; printf("Enter any natural number: "); scanf("%d", &number);
Read more