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

Screenshots from Windows 1.01

Windows 1.0 is a graphical personal computer operating environment developed by Microsoft, released on November 20, 1985, as the first version of the Microsoft Windows line. Version 1.01 , also released in 1985, was the first point-release after Windows 1.00.   Screenshots from Windows 1.01: ⇰ Desktop  First Run Empty Desktop Desktop With Applications ⇰  Office Applications Notepad Text Editor Calculator Calendar Clock Address Book ⇰  Multimedia Applications Media player, CD player, Volume level, and Sound: This GUI doesn’t have these features. ⇰  Networking Applications Terminal Phone Dialer: This GUI doesn’t have this feature. ⇰  Internet Applications Browser, and Mail: This GUI doesn’t have these features. ⇰  Accessibility Applications Keyboard Map:  This GUI doesn’t have this feature. ⇰  Settings Desktop themes,  Display,  S...
Read more

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 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

Java: The Complete Reference, 9th Edition

This is Herb's most popular book on Java, fully updated and expanded to cover Java SE 8 (JDK 8).    Whether you're an experienced pro or just starting out, this one-stop guide will help you master this important language.  Inside you'll find comprehensive coverage of the Java language, its keywords, syntax, and fundamental programming principles.  Of course, descriptions of Java's newest features, such as lambda expressions, default interface methods, and the stream API are included. This lasting resource also describes key elements of the Java API library, such as the Collections Framework, concurrency, applets, servlets, Beans, event handling,  AWT,  Swing, and more. Coverage of JavaFX, Java's newest GUI framework, is also included. *** TO REVIEW BOOK ***  (click below) *** TO REVIEW SOURCE CODE PROBLEM  SOLUTIONS, VISIT   THIS   LINK ***
Read more