Java Examiner - Learn Programming

Project Description: The Movie database for the final project will have the four tables shown above. Begin with MovieRa ng, since this is the simplest table in the database. It is a lookup table of all the MPAA Ra ng Codes (plus NR for Not Rated) and it has two fields: Ra ngID and Ra ng. Once created it should be populated with the following records Some of the characteris cs you associate with movies are in the table, Movie. They represent most of the data types associated with a rela onal database. The MovieID is a unique number that iden fies a single movie, Title is a text field containing the movie tle, YearReleased is the year the movie was first released, Ra ngID is a foreign key associated with the Ra ng in the MovieRa ng table, and the remaining fields are Boolean variables (Yes/No) to iden fy movies that are in black and white, and foreign films with sub tles. Once created it should be populated with the following records An important part of any movie database is the cast. The tabl

Buy now Goal: In this assignment, we want to implement the operational semantics of rst order languages and get a feeling for their importance for databases. Problem Statement: For this goal, you write an interpreter for formulae of the rst order language. The formulae used here have a free variable and are used to query a database that is given as part of the input. The query result is comprised of those values for the free variable that make the formula true. In order to make the interpretation of the formulae easier, we represent formulae in this assignment not in the in x notation that we use otherwise but in Polish notation, which eliminates parentheses and the need for operator precedence, and also makes the processing of the expression tree easier. As Boolean operators we use only & ; _;:. To make it possible to use predicates without parentheses, we furthermore require that every predicate name is used only for a single arity, i.e. if "mail" is used for a ternar

Buy now Introduction: Once upon a time, before the dawn of the Internet, as we know it, there lived a forgotten type of computer game called interactive fiction. First written in the late '70s, these games were sort of a choose-your-own-adventure book, but for geeks. These games contain no graphics, just a 2nd person (everybody remembers English class right?) description of your character, and a box for entering commands. With the birth of the kindle and other Internet-enabled e-readers, these games are experiencing something of a rebirth, as their screens are a perfect match for these games. To play one for yourself, go to http://www.portablequest.com Your project is to create an interactive fiction. In this game, you will navigate a map (moving east, west, north, south when possible). In each “room” of the map, the game will print a description of the room to the screen. As you navigate through the map, you will be looking for a light to light up the dark rooms, a key to open a t

In this aSssignment, you will be asked to write Java code to implement cs. The input of the algorithm should be an adjacency list of a directed graph that may contain negative edges (but no negative cycles): A,1,B,-2,D,2,F ... Use the algorithm (Floyd-Warshall) outlined in the link provided on Moodle and print out the shortest paths (values suffice) from any node to any other node. Also find the shortest path starting from the first node Screenshot: 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

Project Details: In this Assignment, you are asked to modify your program from Assignment 1 (The Pizza Preferences Survey). Make this program store the collected data in a database, instead of the text file. Implement the delete data entry feature, as in StudentJDBC example. It is not required to implement the editing. Implement one or more logins for administrators using DataSourceRealm, with salted and hashed passwords. You may implement several levels of access (roles), like in HelloLogins, but it is not required. Viewing and removing data should require logging in. The administrator password should not be “sesame”, encrypt another password. Copy-paste your steps of the encryption (as in the posted “sesame.txt” file) in your own “readme.txt” file and submit it with the code. You are also required to submit your “pizza.sql” file that you used to generate the database for your program. Some thoughtful reworked copy-pastes from examples posted on SLATE are allowed, but mindless copy-pa

You have just been hired to create a new Instant Lottery program. How the game works: A player can play as many times as he/she wants in one session. Each game cost one (1) dollar. Player tells program how many games he/she wants to play. The player enters six (6) numbers from 1 to 40 at the prompt, one number at a time. The program must catch and report duplicate number entry. It must catch and report invalid entries i.e. numbers outside range of 1 – 40. The program displays the player’s numbers in sorted order. The program does an instant random drawing. i.e. creates a set of six (6) winning numbers and displays them in sorted order. The program compares the computer’s numbers to the player’s numbers and reports the payout. If the player has additions games to play, repeat steps 3 - 6. At the end of the player’s session, the program summarizes the player’s transactions. Report Amount wagered, amount won, and net gain. Net gain is the difference between amount won and amount wagered.

Following is the question which I need the best answer for (best time complexity), along with a couple of test cases for it: Given two arrays of strings a1 and a2, return a sorted array r in reverse lexical order that contains strings from a1 which are substrings of strings in a2. r should also contain unique strings without duplicates. Example 1: a1 = ["arp", "live", "strong"] a2 = ["lively", "alive", "harp", "sharp", "armstrong"] r = ["strong","live","arp"] Example 2: a1 = ["tarp", "mice", "bull"] a2 = ["lively", "alive", "harp", "sharp", "armstrong"] r = [] Program Screenshot: Program Video: 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 Towers of Hanoi Puzzle The description of this problem is taken from the book by Douglas Baldwin and Greg W Scragg (2004), Algorithms and Data Structures: The Science of Computing. Hingham MA: Charles River Media. Legend tells of an ageless temple in the city of Hanoi. Within this temple are three poles of diamond piercing 64 golden disks of varying sizes. At the moment of creation, the disks were stacked smaller-on-top-of-larger on the leftmost pole. Since then, the monks of the temple have been moving the disks from the left pole to the right pole, subject to the following rules: The monks only move one disk at a time. Every disk taken off a pole has to be put back on some pole before moving another disk. The monks never put a disk on top of a smaller one. When all the disks have been moved to the right-hand pole, the purpose of creation will have been fulfilled and the universe will end. It’s not immediately obvious how (or even if) the monks can move the disks to the right-hand

Once upon a time, there was a princess named Sky-blue. The princess’s stepmother, the Queen was very mean and vain. She was jealous because she wanted to be known as "the fairest in the land," and Sky-blue’s beauty surpassed her own. One day, Sky-blue couldn’t take it anymore and run away to a fairy garden. In the garden, she found a small cabin. In the cabin, there were num_gnomes little beds, one table of table_size size, one love seat, one recliner and a big 50” flat screen TV. However, the cabin was very dirty and failed to provide a pleasant environment to relax and watch a good movie. Sky-blue decided to start cleaning and cooking. Soon she got exhausted and fell asleep (use wait) In the evening, the gnomes arrived home from the diamond mine. They computed in different ways (sleep of random time) but they always waited for each other, so that all of them should be at the door before entering the cabin. The last gnome to arrive opened the door ((use monitors and operatio

Extend the code for your previous assignment’s employee database application. Submit your code via Blackboard, as a single .java file. Only one upload is permitted per student, so please ensure your code is correct and complete and in the proper format before uploading! The file name should be your last name, first name, and EDA2 run together: EX: LundquistDougEDA2.java.  The required functionality & components are: 1. Any deficiencies from the first assignment must be corrected, such as: Any missing or miscoded database methods (add, delete, modify, read) Non-conformance with input format requirements 2. Create a GUI interface for inputs and outputs, which should include these elements A JFrame to hold the other elements, replacing console I/O A JTextField for command inputs A JTextArea for output, when necessary JButtons for saving and loading data files 3. Component details: The JTextField will accept text input in the same single-line format as assignment 1. After a command is

Project Requirements Using pipes create communication between three threads TA and TB and TC. TA sends primitive data to TB and objects to TC. TB sends primitive data to TA. TC sends objects to TA and primitive data to TB. Check the message class of dimu.java and use a similar object. You will have two pieces of information: number and id. Don’t create more pipes than necessary. Program Video: 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

Extend the code for your previous assignment’s employee database application. Submit your code via Blackboard, as a single .java file. Only one upload is permitted per student, so please ensure your code is correct and complete and in the proper format before uploading! The file name should be your last name, first name, and EDA2 run together: EX: LundquistDougEDA2.java. The required functionality & components are: Any deficiencies from the first assignment must be corrected, such as: Any missing or miscoded database methods (add, delete, modify, read) Non-conformance with input format requirements Create a GUI interface for inputs and outputs, which should include these elements A JFrame to hold the other elements, replacing console I/O A JTextField for command inputs A JTextArea for output, when necessary JButtons for saving and loading data files Component details: The JTextField will accept text input in the same single-line format as assignment 1. After a command is entered,