Posts

Showing posts with the label only $5

Extra Credit Assignment 3: Loan Calculator Java Implementation Source Code

Image
Buy now Problem Description The monthly payments for a given loan are divided into amounts that apply to the principal and to the interest. For example, if you make a monthly payment of $500, only a portion of the $500 goes to the principal and the remainder is the interest payment. The monthly interest is computed by multiplying the monthly interest rate by the unpaid balance. The monthly payment minus the monthly interest is the amount applied to the principal. The following table is the sample loan payment schedule for a one-year loan of $5,000 with a 12 percent annual interest rate. The monthly payment would be $444.24. Write an application that accepts a loan amount, annual interest rate, and loan period (in number of years) and displays a table with five columns: payment number, the interest and principal paid for that month, the remaining balance after the payment, and the total interest paid to date. Note: The last payment is generally different from the monthly payment, and yo...

Extra Credit Assignment 2: Slot Machine in Java with full source code

Image
Buy now Problem Introduction: Write an application that simulates a slot machine. The player starts out with M coins. The value of M is an input to the program, and you charge 25 cents per coin. For each play, the player can bet 1 to 4 coins. If the player enters 0 as the number of coins to bet, then the program stops playing. At the end of the game, the program displays the number of coins left and how much the player won or lost in the dollar amount. There are three slots on the machine, and each slot will display one of the three possible pieces: BELL, GRAPE, and CHERRY. When certain combinations appear on the slots, the machine will pay the player. The payoff combinations are these: The symbol --------- means any piece. If the player bets 4 coins and gets combination 5, for example, the machine pays the player 12 coins. Code Screenshot: Order Now: Buy now CONTACT DETAILS For any other questions or other tasks please feel free to contact me via email: mhassnainjamil@gmail.com via Wh...

Extra Credit Assignment 1: Rock – Paper – Scissors Java Implementation

Image
Buy now Problem: Design and implement an application that plays the Rock-Paper-Scissors game against the computer. When played between two people, each person picks one of three options (usually shown by a hand gesture) at the same time, and a winner is determined. In the game, Rock beats Scissors, Scissors beats Paper, and Paper beats Rock. The program should randomly choose one of the three options (without revealing it) then prompt for the user’s selection. At that point, the program reveals both choices and indicates if the user won, the computer won, or if there was a tie. Continue playing until the user chooses to stop, and then show the number of user wins, losses, and ties. Objective: Understand the concept of object-oriented programming. Understand the use of standard Java classes. Familiarize with code documentation, compilation, and execution. Expose to Java syntax, programming styles, and Java classes. Code Screenshots: Order Now: Buy now CONTACT DETAILS For any other quest...

HTML, PHP URL registration and lising program Internet Programming Spring 2016 Assignment #5

Image
Buy now Introduction Create and run a SQL script with a database named URL and a table named Urltable. The first field of the table should contain an actual URL, and the second, which is named Description, should contain a description of the URL. Write a PHP script that obtains a URL and its description from a user and stores the information into a database using MySQL. After each new URL is submitted, print the contents of the database in a table. Requirements: Store the structure of the tables in a txt file for submission. Output Screenshots: Order now! Buy now CONTACT DETAILS For any other questions or other tasks please feel free to contact me via email: mhassnainjamil@gmail.com via WhatsApp: +92-324-7042178 via skype: hassnainjamil1

JavaFX Homework with JPanes, JButtons and JComponents in Java GUI

Image
Create the program with the following functionalities: Must contain at least one button that changes something on the GUI  Must contain at least 2 panes  Must contain at least 6 components (Nodes)  Must be PG-13 Actually I'm not working on games. Currently. Output: Get your work now! Buy now CONTACT DETAILS For any other questions or other tasks please feel free to contact me via email: mhassnainjamil@gmail.com via WhatsApp: +92-324-7042178 via skype: hassnainjamil1

Circle Class - Area, Diameter, Circumference, Radius Implementation in C++ - HJ Soft

Image
Project Specifications  Write a C++ program that will use a class called Circle that has the following member variables: radius: a float pi: a float initialized with the value 3.14159. The class should have the following member functions: constructor - sets the radius value = 0.0. setRadius - a mutator function for the radius variable. getRadius - an accessor function for the radius variable. getArea - returns the area of a circle, which is calculated as: area = pi * radius * radius getDiameter - returns the diameter of a circle, which is calculated as: diameter = radius * 2 getCircumference - returns the circumference of the circle, which is calculated as circumference = 2 * pi * radius Write a program that demonstrates the Circle class by asking the user for the circle's radius, creating a Circle object, and then reporting the circle's area, diameter, and circumference with 2 decimal places each. Output Screenshot Buy now CONTACT DETAILS For any other questions or other tasks...

Assignment 4 – Priority Queue Implementation in C++ with full source code

Description: Implement a priority queue capable of determining what order a list of people should be served given a numeric value. The highest priority should be given to persons with larger values (ordered largest to smallest). The priority queue should be written using a C++ class, named PQueue, and the queue itself should be implemented as a linked list similar to how we implemented queues/stacks in lecture. The following classes should be defined by your program: class Person : Used to store information about each person class PQueue : Priority queue used to serve people The following public functions need to be implemented: Person::Person( int, string ) : Initialize the person PQueue::PQueue( void ) : Initialize the priority queue bool PQueue::empty( void ) : Test whether queue is empty int PQueue::size( void ) : Return size Person* PQueue::front( void ) : Access next node Person* PQueue::back( void ) : Access last node void PQueue::enqueue( Person* ) : Insert node void PQueue::de...

Bank Line Implementation in Java using Multi threading - ITEC 3150, Spring, 2016

Image
Implement a bank line of credit account.  The account will have two primary attributes, the credit limit and current credit balance.  The line of credit class should also contain a lock and a sufficient credit limit condition.  When initialized the current credit balance will be zero.  The credit limit should be determined at construction time.  The owner of the credit line can get money up to the credit limit and make payments until the balance is zero.   If a request is made for money than is available, the credit limit will return up to the limit, but not beyond it.  So the getMoney method should have a return value of how much money is returned. The credit line program should have two threads:  one to get more money from credit line and a second to make payments.  The thread to get more money increases the credit balance up to, but not beyond the credit limit.  The make payment thread decreases the current credit balance.  The ...

C++ Project - Binary Search Tree Problems, finding height, number of nodes and BST cloning

Binary Search Tree Implementation + Full Documentation This programming assignment simulates the use and functionality of binary search trees (BST) by comparing statistics over several simulations. Start the random number generator at the current time stamp -- similar or the same as srand(time(0)). Initialize variables to be used in the program’s final report. Define a struct node with four fields: node * left, * right; int data; and int frequency. Frequency means the number of times the specific data value was placed into the tree. So, instead of having a BST with the same data values, count the number of times (more than zero) that the data value was placed into the tree. Run the following 1000 times: Start with an empty binary search tree. Load 5000 integers with values between 0 and 1023 into the BST. Without changing that tree (Call it T1, here), create another empty BST, say T2 and load all the data from T1 into T2 in such a way that T2 is “balanced.”  Gather the following th...