Java Examiner - Learn Programming

Shopping Cart Application: Using the techniques you learned in Section 29.8.2, create a simple shopping cart application. Display a list of books as an h:selectOneRadio element. When the user submits the form, store the user’s selection in a @SessionScoped managed bean. Allow the user to return to the list of books and make additional selections. Provide a link to view the shopping cart. On the shopping cart page, display the list of selections the user made, the price of each book and the total of all books in the cart. Code Snapshots: Output Screenshots: Home Page: Shopping Cart Page: 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

Cash Register program in Java 1. The driver class should initially fill the register with 0x$100, 0x$50, 10x$20, 20x$10, 20x$5, 0x$2, 50x$1, 80x$0.25, 50x$0.10, 20x$0.05, 100x$0.01 2. The program should ask the user the following: Make a sale make change print balances exit 3. For a sale: the program class should prompt for the cost and how much of each type of currency were given 4. If the register can not make the correct change, print an appropriate message 5. For making change: the program should ask which currency is being provided and how much of that currency, then it should output what currency is being given - example, make change, provide 4 quarters, register gives 1x$1 - example, make change, provide 50 dimes, register gives 1x$5 OR 5x$1 OR 4x$1, 4x$0.25 6. For print balances, just show what is currently in the register of every currency 7. Calculate Big-Oh for all 3 processes 8. Calculate actual operations for making a sale and print out (don't forget to include the cos

AVL Tree Balance Tree Checker Algorithm: Design an algorithm which tests if an input binary tree is also balanced tree (AVL type). Prove algorithm's correctness and estimate its complexity. We're using appropriate format for the report according to the requirements 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 Buy directly from Sellfy products

Object Oriented Concepts: (Inheritance, Polymorphism, Abstract classes, Interfaces, Exceptions and some other concepts)Answer the following questions as briefly (but completely) as possible: 1- What is the printout of running the class C (via the command “java C”) in the code below (saved in C.java)? (And, is that what you expected?) class A { public     A()     {         System.out.println("A's no-arg constructor is invoked");     } } class B extends A { } public class C { public     static void main(String[] args)     {         B b = new B();     } } 2- What problem do you expect to see if compiling the program below? What was the error(s), if any, actually produced? class A { public     A(int x)     {     } } class B extends A { public     B()     {     } } public class C { public     static void main(String[] args)     {         B b = new B();     } } 3- Which of the follow statements are true? Which are false? Explain why. A subclass is a subset of a superclass. When

A class is a programmer-defined data type that describes what an object of the class will look like when it is created. It consists of a set of variables and a set of functions. A class is repository of functions that any main program may use. In this project you will create two classes and two main drivers to test the classes. Part I Part I will produce 2 files. Geometry.h file is the Geometry class with its members and functions. main cpp file tests all the code in the Geometry class. The textbook examples place the class code in the same file as the main function, but your code will be more re-usable if the class is defined in a separate file – Geometry.h . The header file will need to be included in the program as you did in the Airline Problem and the array.h file. The final version of the Geometry class (Geometry.h) will include: Three constructors:  Constructor 1 – receives 2 integer values for length and width. (rectangle) Calls checkNum to validate each value. Assigns values

Introduction In the popular game Mastermind, one player creates a secret code of four pegs, each of which can be chosen from one of six colors. (The number of pegs and colors may be different than this in different versions, but your implementation will use these values, but be extendible to other values. Also, a color can be reused, thus there really are six choices for each of the four pegs.) The other player then has to guess the color of each peg, with the order mattering.The player who made the secret code then has to give feed back to the player guessing. This feedback is in the form of white and black pegs. A black peg means that the guesser has chosen the correct color in the correct slot. These are first “calculated” and awarded. Once these are counted, these pegs are ignored. Then the white pegs are awarded. These are for pegs that are the correct color but are in the incorrect slot. There is no “double dipping” of pegs in the response, so the sum total of white and black peg

(Body Mass Index Calculator App) The formulas for calculating the BMI are BMI = (weightInPounds × 703)/(heightInInches × heightInInches) or BMI = (weight In Kilograms)/(height In Meters × height In Meters) Create a BMI calculator app that allows users to enter their weight and height and whether they are entering these values in English or metric units, then calculates and displays the user’s body mass index. The app should also display the following information from the Department of Health and Human Services/National Institutes of Health so that users can evaluate their BMIs: BMI VALUES Underweight: less than 18.5 Normal: between 18.5 and 24.9 Overweight: between 25 and 29.9 Obese: 30 or greater 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

Database Systems Some friends of yours are hoping to set up a data driven website to support their home business selling second-hand children clothes, and have asked for your advice on the database design side. They need a database to list all the available items for customers to purchase, and also want to have a user comments system so that visitors can give feedback on purchased items as well as buy them. They are not database experts, and they have asked you to devise a database model they could use. Their ISP has said they can mount and operate a database on their account if given a set of relational tables, which describe it, so this is ultimately what they want you to produce. As a minimum, they would like to store the following information about each item of clothing: the kind of garment, colour, size, material, gender (where appropriate), condition, age, and how much it costs, plus feedback once sold, if available. For customers they would want to record name, postal address, e

System Background - The online shopping site with the member system and real store stock checking system - When user buy online will earn the points - User will go to the shop to take the product so no need to store address in “Order” Database Requirement - Catalog - Type - Product - Shops (With Address and Location - Order - Stock - User Login (Email / ID card + Password) …And more 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

Learning outcomes to be assessed: • Analyse, specify, design and implement a data management system • Theory and practice of relational database systems • Assessing organisational needs in relation to database development Submission requirements Your submission should contain the following: 1. An accurate and properly notated E-R-A diagram of your model. A hand-drawn diagram is entirely adequate, but should be drawn neatly and scanned for electronic submission. You may break your model down onto several sheets for clarity if you so wish. 2. A set of design notes of no more than 1000 words detailing any assumptions you have made and commenting on your design decisions and the design development process (e.g. what issues did you have to resolve, how did you resolve them and why, what happened in the normalisation process, what might you have done differently if given the option, etc). Buy now CONTACT DETAILS For any other questions or other tasks please feel free to contact me via email:

#1. Write Create Table statements for the following tables: Project Activity Activity Resource Resource Resource Consume #2 Write Insert statements to populate the tables using the data from the attached spreadsheets: Project Activity Activity Resource Resource Resource Consume #3. Write a query to display the following information: Project Name Activity Name Estimated Cost (total of Cost Per Unit multiplied by Plan Quantity for each activity) Planned Start Date (Start) Planned Finish Date (Start plus Plan Duration) You can write the Create Table and Insert statements in the Schema Panel and then run your query to accomplish the last part of the problem in the other panel. 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

The 8-puzzle problem In this project you will implement a solution to the 8-puzzle by state-space search, using the search engine described in the lectures, and experiment with search strategies. What you must do Implementing 8-puzzle search In the search2 folder in the Java download on the COM1005/2007 MOLE site is the code for the simple search engine and for Jugs problems. Note that you may have to recompile the code for your version of Java. • Following the instructions in section 2.9 of the lecture notes, write classes to implement a state-space search for 8-puzzle problems. • You should not need to change the code for the search engine except perhaps to control how much it prints as a search proceeds, and to stop the search after a given number of iterations (in an 8-puzzle the search tree can become large). • Test your implementation with breadth-first searches for the following initial con- figurations and the same goal state as above: Experimenting with Search Strategies The s

Buy now The purpose of this coursework is to create a database ER schema and relational schema based on specific domain based on the provided requirements. This coursework also involves implementing your relational schema in SQL and writing some queries in SQL’s Data Manipulation Language. This coursework is comprised of 2 Parts, each with separate deadlines. Be aware any late submissions will have the grade for that part capped at 40%. This is Part 1 of the Coursework. The entire coursework is formally assessed and is worth 10% of your final grade. Each Part of the Coursework is worth 5%. You will receive some feedback as part of the marking of the coursework. Part 1: Design (1.1) Identification and representation of entities, relationships and attributes. (1.2) Identification and representation of relationship cardinalities based on the coursework requirements, or by making proper use assumptions if the coursework requirements are vague. Any assumptions need to be reasonable and real

Introduction Firstly, this worksheet is one of the worksheets from which your laboratory worksheets portfolio of work will be assessed. This worksheet is about empirically evaluating how scalable a number of single population heuristic search methods are at solving the Travelling Salesman Problem (TSP) when applied to a number of different sized problems. The aim is to evaluate and demonstrate how well each of the methods performs as the size of the problem increases. The overall objective of this worksheet is to produce; present and report on, a Java program that is capable of solutions the TSP on a number of different sized problems using a number of different heuristic search algorithms (see below). Solving the TSP Problem The Travelling Salesman problem (TSP) has been described fully in the lectures. The purpose of this worksheet is to: 1) Implement a number of the algorithms (listed below) to solve the TSP 2) Compare the algorithms on a number of different sized datasets 3) Report

Introduction: For this lab, you will do some work on a GUI program. Most of the work is related to actions, buttons, menus, and toolbars.When you turn in your work for this lab, you should also turn in an executable jar file of your program, in addition to all the files from your Eclipse project. See the last section on this page for information about how to create executable jar files. To begin the lab, create a new project in Eclipse and copy-and-paste both directories – guidemo and resources -- from the code directory into your Eclipse project. The guidemo directory is a package that contains the Java code of the program. The resources directory has several sub-directories that contain image and sound resources used by the program. You will be working only on the code in the guidemo package. The code directory also contains an executable jar file of the completed program, GuiDemoComplete.jar. You can run this jar file to see how the program should look when it's done. In the inc

viagogo Intern/Graduate Developer Test Requirements - Code in any language you like but please provide clear instructions on how we should build & run your code - Please use any source control system you like, and send us a link (or if you prefer just a zip of your project) - The first requirement is your code meets the requirements - Secondary requirements are whether your code is idiomatic for the language being coded in, easy to read, and clearly laid out Scenario - Your program should randomly generate seed data - Your program should operate in a world that ranges from -10 to +10 (Y axis), and -10 to +10 (X axis) - Your program should assume that each co-ordinate can hold a maximum of one event - Each event has a unique numeric identifier (e.g. 1, 2, 3) - Each event has zero or more tickets - Each ticket has a non-zero price, expressed in US Dollars - The distance between two points should be computed as the Manhattan distance Instructions - You are required to write a program

Cline Server Chat program in java: Java program that enables two users to chat. Using GUIs implement one user as the server and the other as the client. The server has two text areas: one for entering text and the other (noneditable) for displaying text received from the client. The client has two text areas: one for receiving a text from the server and the other for entering text. When the user presses the enter key, the current line is sent to the server or client. 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