A program where the user can determine the dimension of a 2D array. Randomly fill up the array with numbers from 1 to 100; Sort through the array and find the highest, lowest and average number. Find the most occurrences of the randomly generated numbers.
A program where the user can input an integer and it will calc. the following: 1.Write a program that sums numbers from 1 to n. It outputs the numbers and their sum 2.Write a progam that sums odd numbers from 1 to n. It outputs the numbers and their sum 3.Write a program that calculates n! Program does calculations in a 3 seperate methods, and has a seperate class for the calculations Use radio buttons to determine which calculation is to be made
A program that does the following: The user will determine how many test scores to input into a program. Create two arrays: one for numerical test scores – the other for letter grade equivalents. Steps: 1. Fill up array with an input box 2. Send each test score over to your calculations class and return letter grade. 3. Store each letter grade in the letter grade array 4. Output the original test numerical score and its letter grade equivalent. 5. Output the letter grade array backwards 6. Output the average of the test scores 7. Output the highest and lowest grade
A program that does the following: Make an array filled with random integers of the numbers from 1 to 5000. Make the array the length of 5000. Do a sequential search and keep track of how many times it took to find a random number from 1 to 5000. Run this search 5000 times and find the average number of times it took to find the random number. Re-do the above with a binary search and keep track of the average number of times it took to find the random number.
a program that takes a person's height and weight in pounds and returns the body mass index(BMI). prompts the user to input their height and weight in text boxes and displays their BMI. also keeps track of average BMI and total number of people calculated. Output information to a text are.
an applet for a local car rental agency that calculates rental charges. The agency charges $15 per day plus $0.12 per mile. Use text fields for the customer name, address, city, state, zip code, beginning odometer reading. ending odometer reading, and the number of days the car was used. Uses a texarea to display the miles driven,total charge and customer information. also creates a summary of the total amount received for the day and the number of cars returned. You must show the average amount spent by the customers.
car rental program but includes radio buttons Include 3 radio buttons for 3 different types of cars. Each car has a different rate. When you select the radio button, it should tell which car and its rates. Also include 2 checkboxes. One for leather and one for Bose sound system.
a program that will do the following: The user will decide the width and height of a checkerboard. Use two different colors squares to output the graphics on the board.
a program that will do the following: a program that simulates craps the casino game. It outputs the rolls of the dice. outputs each roll and whether the player has won or lost. The point is identified also. Uses variable GameStatus to keep track of whether a person wins, loses, or continues.
Updated craps game. Let the user decide how many games to play. Have an auto-roll button that will run the game the user-determined number of times. Output the experimental probability of winning Craps.
a program that simulates rolling two dice. also shows the sum of the dice and keep track of how many times you have rolled each sum 2-12. It also figures out the probability of getting each sum.
a program that does the following: The user will decide how many names of fruit that they will input into an array. They may enter the fruit in any order. Also the user will enter names of vegetables into a similar array. Allows the user to enter the names using an input box. each array is then sorted in alphabetical order using a selection sort. The two arrays are then merged together. Output the sorted arrays prior to merging than output merged array. After the arrays are merged, user can search for a particular fruit or vegetable. User can enter in a text box any name of lower case, upper case or mixed. Program then does a binary search to find if the requested name is there.
a program to determine if the Knight can travel an entire empty chess board and touch every square on the board only once. Put a one in the square of your first move and a two in the second move and etc. Randomly move the knight to any of his 8 possible directions.
first java applet. Creates a madlib story. Contains 10 textboxes, a button, and an output text area.
a program where the user can enter in text and the program can determine whether the text is a palindrome. (includes sentences!)
This Program has three methods that each use recursion: a method that takes a positive number as input and keeps dividing the number by 3 until the result is less than 1. Output the answers as it calculates it. a method that takes a positive number and outputs that many odd numbers. a method that determines if one number is the greatest common factor of another.
This Program was to practice with arrays and moving object positions: Classic Space Invaders
This Program was used to practice nested for-loops
I worked with the concept of Interfaces, Abstract Classes, and how to properly handle Java exceptions. In the first part, given an interface QueueADT, I implemented it by using a circular array and use it to solve a real life problem. In the second part, given an abstract class Account, I created a checking and savings accounts and used them to simulate a bank with a variety of intricacies.
implement a Doubly-Linked List. Firts, I created a Doubly-Linked List, and then see how to this data structure to the problem of gene-splicing. Throughout the assignment, we will be verifying correctness through the use of JUnit tests.
I implemented a binary search and Insertion sort, Merge Sort, and Quick sort. Then I performed runtime experiments in each of the algorithms.
I implemented a binary search Tree Abstract Data Type. Afterwards I compared the performance of the binary search tree to a binary search array. For the last part, we were assigned to use the BST to implement a basic search engine. I built the binary search tree based on the input files provided. It then returns all related documents that contains a given query string.
I implemented d-ary heaps to represent a priority queue. Using the queue I developed a course scheduling system that used timer and amount of coins given by students.
I implemented a classic lossless compression algorithm Huffman Encoding.
I implemented a Hash Table and kept track of its statistics (its load factor, longest chain, and collisions) I also used the hashing to build a memory efficient data structure Bloom Filter.
Built a navigation system using Depth first search, Breadth first search, Dijkstra, and A*.
Also implemented a data structure Disjoint Set to help me implement Kruskal's algorithm and find a Minimum Spanning Tree for a given Graph.