+1(316)4441378

+44-141-628-6690


Warning: Use of undefined constant woothemes - assumed 'woothemes' (this will throw an Error in a future version of PHP) in /home/admin/web/qualityessayresearch.com/public_html/wp-content/themes/cushy/archive.php on line 47
Archive for the ‘java’
Warning: Use of undefined constant woothemes - assumed 'woothemes' (this will throw an Error in a future version of PHP) in /home/admin/web/qualityessayresearch.com/public_html/wp-content/themes/cushy/archive.php on line 47
Category

ENTD380 Assignment 4

Assignment Instructions
Instructions:
* Make sure you go to this week's chapter lesson for more guidance. 

For this assignment, you will create an object class then display its assigned values from the main method of the main class.

Save the code in jGRASP, then save it in c:myjava and run it.

/*******************
  Name:

  Date:

Notes:   
*******************/

class Car
{
add content and comments
public static String accelerate()
{
  return motion;
  }
}

public class CarObject
{
  public static void main(String[] args)
  {
  add content and comments

}
}

Make sure that you include all source codes and the compiled codes into W4_firstname_lastname.zip.

You must leave me a note in the Submitted Text area on how to compile and run your code.

Assignment One

Hello I am wanting someone to change the gamble class and player class to avoid plagiarism therefore to just change the methods but still make the game run smoothly also if possible make the filepath in the cardgame class have no filepath therefore anyone can run it without changing the filepath manually.

I am in NZ and not sure where this website is from so my price is in NZ so just let me know where you guys are from and we can discuss the conversion

Final Project

Create a secret phrase guessing game similar to hangman in which the user guesses letters in a partially hidden phrase in an attempt to determine the complete phrase. The phrase to be guessed needs to be selected randomly from a list of at least 10 phrases. The clue needs to be presented to the user as a series of asterisks replacing letters to be guessed. Spaces must be in the appropriate locations. Somewhat like Wheel of Fortune be sure when a letter is guessed you fill in all matches regardless of the case.

The minimum requirements are as follows:

A GUI interface of some type is required for this project.

(1) The program must be an application that performs some function. It can be a game or a business application.

(2) The program must include at least one decision and at least one loop. Most projects of any depth will require more.

(3) You must make use of at least one array. This array can be one or two dimensional. It can be an array of objects

Student

For this project, each student may choose to work on it individually, in pairs, or in a group of 3 students. In this project, you need to implement a Student class. You may copy the code from your midterm project into this project, if necessary. The class should include the following:

First, the Student class should have the following private attributes/fields/data members:

name
student id
major
gpa
an array of String type named courses to store 10 courses, such as "CS 1400", "Math 1080".
an array of String type named courseLetterGrades to store 10 course letter grades, each grade is a String type value such as A, A+, A-, B, B+, B-, C, C+, C-, D, D+, D-, F.
an array of int type named courseCredits to store 10 course credits, each credit is an integer value between 1 and 5.
an array of double type named course4.0ScaleGrades. The mapping from a letter grade to a 4.0 scale grade is given by the following table:
LetterGrades-2-4.0ScaleGrades.png

Lines of Action

Introduction
Lines of Action is a board game invented by Claude Soucie. It is played on a checkerboard with ordinary checkers pieces. The two players take turns, each moving a piece, and possibly capturing an opposing piece. The goal of the game is to get all of ones pieces into one group of pieces that are connected. Two pieces are connected if they are adjacent horizontally, vertically, or diagonally. Initially, the pieces are arranged as shown in Figure 1. Play alternates between Black and White, with Black moving first. Each move consists of moving a piece of your color horizontally, vertically, or diagonally onto an empty square or onto a square occupied by an opposing piece, which is then removed from the board. A piece may jump over friendly pieces (without disturbing them), but may not cross enemy pieces, except one that it captures. A piece must move a number of squares that is exactly equal to the total number of pieces (black and white) on the line along which it chooses

Top Down parser

Your program will read any text file that contains (what is intended to be) a string in the category fun def list. It will then construct an explicit parse tree and display it in a linearly indented form each syntactic category name labeling a node is displayed on a separate line, prefixed with the integer i representing the node's depth and indented by i blanks. This is a basic form of syntax profiler.

War Card

War

The deck is divided evenly, with each player receiving 26 cards, dealt one at a time, face down. Anyone may deal first. Each player places their stack of cards face down, in front of them. Each player turns up a card at the same time and the player with the higher card takes both cards and puts them, face down, on the bottom of his stack. If the cards are the same rank, it is War. Each player turns up one card face down and one card face up. The player with the higher cards takes both piles (six cards). If the turned-up cards are again the same rank, each player places another card face down and turns another card face up. The player with the higher card takes all 10 cards, and so on. The game ends when one player has won all the cards. Hint: Use math.random to shuffle the deck

Neural Networks

extend the code i have already done in java which creates a back propagation network with 20 inputs, 1 neuron in hidden layer and one output neuron.
This code has to be extended to have an extra hidden layer. Then it has to be tested with 12 different activation functions to see how each of them performs on the input.

If you are able to do this i will provide the code, fully commented.

If you wish you could do it using any other program but in that case the entire network would have to be created from scratch.