new semester, new repo structure

This commit is contained in:
2023-01-10 11:59:05 -06:00
parent 0a76658f85
commit ba6de6e18e
725 changed files with 1199 additions and 103 deletions

View File

@@ -0,0 +1,25 @@
/*
* Click nbfs://nbhost/SystemFileSystem/Templates/Licenses/license-default.txt to change this license
* Click nbfs://nbhost/SystemFileSystem/Templates/Classes/Class.java to edit this template
*/
package lab15_calebfontenot;
/**
*
* @author caleb
*/
public class Array1 {
public static void main(String[] args)
{
double[] myList1 = {1.1, 2.1, 3.1, 4.0};
double[] myList2 = new double[3];
myList2[0] = -1.1;
myList2[1] = -2.1;
myList2[2] = -3.1;
myList2[3] = -4.1;
System.out.println(myList1[2]);
System.out.println(myList2[2]);
}
}

View File

@@ -0,0 +1,30 @@
/*
* Click nbfs://nbhost/SystemFileSystem/Templates/Licenses/license-default.txt to change this license
* Click nbfs://nbhost/SystemFileSystem/Templates/Classes/Class.java to edit this template
*/
package lab15_calebfontenot;
/**
*
* @author caleb
*/
public class Array2 {
public static void main(String[] args)
{
String[] names1 = {"John", "Bill", "George"};
String[] names2 = new String[3];
names2[0] = "Mary";
names2[1] = "Ann";
names2[2] = "Lola";
/*
System.out.println(names1[2]);
System.out.println(names2[2]);
*/
for (int i = 0; i < names1.length; i++) {
System.out.println(names1[i]);
System.out.println(names2[i]);
}
}
}

View File

@@ -0,0 +1,29 @@
/*
* Click nbfs://nbhost/SystemFileSystem/Templates/Licenses/license-default.txt to change this license
* Click nbfs://nbhost/SystemFileSystem/Templates/Classes/Class.java to edit this template
*/
package lab15_calebfontenot;
/**
*
* @author caleb
*/
public class Array3 {
public static void main(String[] args)
{
int[] values = new int[5];
//Init array with correct value of i plus the value of the previous array element
for (int i = 1; i < values.length; i++) {
values[i] = i + values[i - 1];
}
// put in the first array element the second plus the last array elements
values[0] = values[1] + values[values.length -1];
// print the array
for (int i = 0; i < values.length; i++) {
System.out.println(values[i]);
}
}
}

View File

@@ -0,0 +1,27 @@
/*
* Click nbfs://nbhost/SystemFileSystem/Templates/Licenses/license-default.txt to change this license
* Click nbfs://nbhost/SystemFileSystem/Templates/Classes/Class.java to edit this template
*/
package lab15_calebfontenot;
/**
*
* @author caleb
*/
public class Array4 {
public static void main(String[] args)
{
int[] integerArray = new int[33];
for (int i = 0; i < integerArray.length; i++) {
integerArray[i] = (int) ((Math.random() * 100) + 1);
}
for (int i = 0; i < integerArray.length; i++) {
System.out.print(integerArray[i] + " ");
//System.out.print(i + " ");
if (i != 0 & (i + 1) % 3 == 0) {
System.out.println();
}
}
}
}

View File

@@ -0,0 +1,38 @@
/*
* Click nbfs://nbhost/SystemFileSystem/Templates/Licenses/license-default.txt to change this license
* Click nbfs://nbhost/SystemFileSystem/Templates/Classes/Class.java to edit this template
*/
package lab15_calebfontenot;
/**
*
* @author caleb
*/
public class Array5 {
public static void main(String[] args)
{
String[] alphaBetics = new String[5];
final int NAME_SIZE = 20;
//print the array that has all nulls
for (int i = 0; i < alphaBetics.length; i++) {
System.out.println(alphaBetics[i]);
}
//init the array to character numbers
for (int i = 0; i < alphaBetics.length; i++) {
alphaBetics[i] = "index " + Integer.toString(i) + " ";
}
//append to the array 20 random alphabetic characters
for (int i = 0; i < alphaBetics.length; i++) {
for (int j = 0; j < NAME_SIZE; j++) {
alphaBetics[i] += (char) (65 + Math.random() * 26);
}
}
//print the array again
for (int i = 0; i < alphaBetics.length; i++) {
System.out.println(alphaBetics[i]);
}
}
}

View File

@@ -0,0 +1,57 @@
/*
* Click nbfs://nbhost/SystemFileSystem/Templates/Licenses/license-default.txt to change this license
* Click nbfs://nbhost/SystemFileSystem/Templates/Classes/Class.java to edit this template
*/
package lab15_calebfontenot;
/**
*
* @author caleb
*/
public class Array6 {
public static void main(String[] args)
{
String[] alphaBetics = new String[10];
final int NAME_SIZE = 3;
/*
//print the array that has all nulls
for (int i = 0; i < alphaBetics.length; i++) {
System.out.println(alphaBetics[i]);
}
*/
//init the array to character numbers
for (int i = 0; i < alphaBetics.length; i++) {
alphaBetics[i] = "";
}
//append to the array 20 random alphabetic characters
for (int i = 0; i < alphaBetics.length; i++) {
for (int j = 0; j < NAME_SIZE; j++) {
alphaBetics[i] += (char) (97 + Math.random() * 26);
}
}
//print the array
for (int i = 0; i < alphaBetics.length; i++) {
System.out.println(alphaBetics[i]);
}
System.out.println();
// Reverse each string in the array
String tmp = "";
for (int i = 0; i < alphaBetics.length; i++) {
tmp = "";
int stringLength = alphaBetics[i].length();
for (int j = 0; j < stringLength; j++) {
char currentChar = alphaBetics[i].charAt(j);
tmp = currentChar + tmp;
}
alphaBetics[i] = tmp;
}
for (int i = 0; i < alphaBetics.length; i++) {
System.out.println(alphaBetics[i]);
}
}
}

View File

@@ -0,0 +1,60 @@
/*
* Click nbfs://nbhost/SystemFileSystem/Templates/Licenses/license-default.txt to change this license
* Click nbfs://nbhost/SystemFileSystem/Templates/Classes/Class.java to edit this template
*/
package lab15_calebfontenot;
import java.util.Scanner;
/**
*
* @author caleb
*/
public class Array7 {
public static int getLargest(int[] a, int total)
{
int temp;
for (int i = 0; i < total; i++) {
for (int j = i + 1; j < total; j++) {
if (a[i] > a[j]) {
temp = a[i];
a[i] = a[j];
a[j] = temp;
}
}
}
return (total - 1);
}
public static void main(String[] args)
{
// Create array
int numArray[] = new int[5];
int i = 0;
// Scanner
Scanner input = new Scanner(System.in);
//Prompt for input
do {
System.out.print("Enter 5 numbers between the range of 10 to 20: ");
numArray[i] = input.nextInt();
i++;
} while (i < 5);
// Print the array
for (int j = 0; j < numArray.length; j++) {
System.out.println(numArray[j]);
}
// Find the maximum
System.out.println("The largest item in the array is: " + getLargest(numArray, numArray.length));
int index = 0;
for (int j = 0; j < numArray.length; j++) {
if(numArray[j] == getLargest(numArray, numArray.length)) {
index = j;
}
}
System.out.println("it is the " + (index + 1) + "th item in the array");
}
}

View File

@@ -0,0 +1,21 @@
/*
* Click nbfs://nbhost/SystemFileSystem/Templates/Licenses/license-default.txt to change this license
* Click nbfs://nbhost/SystemFileSystem/Templates/Classes/Main.java to edit this template
*/
package lab15_calebfontenot;
/**
*
* @author caleb
*/
public class Lab15_CalebFontenot {
/**
* @param args the command line arguments
*/
public static void main(String[] args)
{
// TODO code application logic here
}
}