Java Examiner - Learn Programming

Program Description Write a program that reads positive numbers (integers) and stores them into an array. Write a method to prompt for the input values. (sentinel terminated) Write a method to print the array. Write a method that returns the value of the smallest number. Write a method that returns the value of the largest number. Write a method to find the location of a number (array index + 1) Write a method to compute the average of the numbers in the array. Write a method to output the results. The input prompt example: Enter at least 10 unique positive numbers (integers) terminated with a sentinel value (-1) Expected Output Amount of numbers read: 10 Numbers read: 12, 33, 41, 1, 4, 10, 7, 21, 66, 50 Smallest number was 1 in location 4 Largest number was 66 in location 9 Average was 24.5 Output Screenshot Download solution 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-70421...

Design a database for public libraries.  John works for an IT service company as a senior database designer. His company just won a few contracts to serve several public library systems within the state of Maryland. Each library system operates independently though John is in charge to design a single database to store information needed for all libraries. Below are some of the data that need to be kept track of. For each library system, the database needs to store library name (e.g. “City of Baltimore Public Libraries” and “City of Annopolis Public Libraries”), phone, and mailing address. Need to store customer information including name, phone, and address. Each library issues it’s own library card to its customers. A customer can have multiple library cards, one for each library system. For example, a customer can have both Baltimore library card and Annopolis library card. Need to store library card number (different library systems may issue cards with the same number), PIN, i...

The table shown below lists dentist-patient appointment data.  A patient is given an appointment at a specific time and date with a dentist.  On each day of patient appointments, a dentist will perform specific surgery (such as Implant S10, Root Canal S15) for that day Evaluate if the table shown above is normalized, if not describe and illustrate the process of normalizing the table shown above to third normal form.  State any assumptions you make about the data shown in this table. StaffNo Dentist Name PatNo PatName Appointment Date & Time SurgeryNo S1011 S1011 S1024 S1024 S1032 S1032 James Bond James Bond Andrew Joe Andrew Joe Kevin King Kevin King P100 P105 P108 P108 P107 P110 Kim Su Jenny Gold Ian Chappell Ian Chappell John Spooner Frank Holey 1/9/05 10.00 1/9/05 12.00 1/9/05 10.00 2/7/05 14.00 2/7/05 16.30 2/7/05 18.00 S10 S15 S10 S10 S15 S13 Is the table in 1NF, 2NF, or 3NF? If not, describe and illustrate the process of normalizing i...

Specification  This assessed exercise is concerned with a number of text and string problems, each of which can be solved by an efficient algorithm using an application of the suffix tree data structure. The aim of the exercise is to illustrate the wide range of practical applications of this versatile data structure, and to provide experience of manipulating the suffix tree – this should aid understanding of the structure itself. The text and string problems that we will be concerned with are as follows: searching for a given string in a piece of text; 
 determining all occurrences of a given string in a piece of text; 
 finding a longest repeated substring in a piece of text; 
 finding a longest common substring of two pieces of text. 
 You are given Java code for reading a specified text file into a string s and building the suffix tree for s. (The suffix tree construction algorithm works on the principle of repeated insertion of suffixes together with node-splitting; for the pu...

Project Introduction A doctor has contacted you to develop a solution for managing the patient records of his practice. The doctor is having issues finding records of current patients and would like a solution that will make finding the patients easier, allowing for a faster turnaround time with the billing for clients. The system that will be developed is an all-encompassing solution which all of the different staff members in the doctor's practice will be using. Account Types The system should have three user account types, each of which can all login from the same login window. Depending on their account type, they will be sent to a different dashboard where they can choose the task they wish to complete. Receptionist Mainly focused on making appointments in the system and taking different messages which have been left for the doctor. Doctor The doctor can view all of the messages which have been left for him, search for different patients in the database, and take notes about t...

Transaction Processing Find a recent article in an IT or business publication (within the past 3 years) that describes a transaction processing system implemented by a company (new or updated). Provide a link to the article. Provide a description of the system being sure to address the following questions  What is the nature of the transactions being processed by this system? What are the inputs and outputs of the system? What is the volume of transactions? Discuss the role of the system in the organization How vital is the system to the company’s operations? What would happen if transactions were not processed? 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

In this assignment, you are asked to implement a simple project about geometric shapes such as a circle, rectangle, and square. All shapes must implement the following interface. While doing this project student should design classes actively with OOP concept. So the student must consider relations between classes such as, "is a" and "has a" relations and don't repeat methods that handle the same tasks. Because all shapes have common and different properties, students should consider abstract class, interface and overloading methods etc. public interface IShape { // area of a shape public double area (); // distance between (0,0) and the point used to draw a shape public double distanceToCoordinateCenter (); //rectangle is a full shape if: distanceToCoordinateCenter() > w+h //circle is a full shape if: distanceToCoordinateCenter() > r //square is a full shape if: distanceToCoordinateCenter() > w // w is width, r is radius, h is height public boo...

BST with parent node: Implement the BST with parent node. Modify the insert and delete functions. Add the following functions too. private TreeNode<E getNode(E element) private boolean<E isLeaf(E element) public ArrayList<E getPath(E element) Get 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

Buy now Rolodex Sort: A Rolodex is a rotating file, usually used to record business contact information. Cards are inserted in alphabetic order by name. You operate the Rolodex by rolling it forwards or backwards until you find the information you need (or find the place where a new card should be added). Task Your task is to create a class that simulates a Rolodex, then use it to implement a word-sorting program. The program starts with an empty Rolodex, then reads words from standard input and adds a card for each word in the appropriate position to maintain overall sorted order. To find the correct position, the Rolodex is rolled either backwards or forwards from the current card. When all input has been processed, the program moves the Rolodex to the beginning and then outputs each word in order, one per line.  Source Code Requirements: Download the file rolosort_0.zip, which contains a basic version of the program and a skeleton version of the Rolodex class. The class has meth...

Description: Program that convert regular expression(RE) into Deterministic Finite Automaton(DFA) Explanation:  Input :  Regular expression . Output : DFA as Set of states . Initial state . Accepting state . Transition table. Input alphabet . The output should be represented DFA as a transition. And the input should be free for the user as the binary alphabet of a regular expression or alphabet of a,b,c both alphabets . Documentation: Also, prepare the documentation for the project. Note the document should contain theoretical background and the design and implementation of the project. Also, should contain all the details about the project such as main data structures, main components of the algorithm, design interface, the input, the output, etc . 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 Description Continuing the theme of project 3, adjust the program so that the left text area displays the words using a Hashmap (the order of the words will be unpredictable), and the right text area displays the words using a TreeMap (the words should be in sorted order). If you did not get project 3 to work entirely, you are not responsible for the menus and menu items for the project, or for adding additional words, or for displaying only nouns or verbs. For project 4 you are only responsible for displaying the original input file in the two text areas as described above. 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

Domain Description Radix sorting entails grouping number elements in a data structure by each digit. First one groups by 1s; then 10s; then 100s (or the other way around; think little or big endian); and so on. Build a method that effectively models this behavior. You may use the code provided in Lafore, provided you are writing pseudocode, making comments, testing and capturing output and crafting UML. A part of this implementation entails determining the greatest number of digits, to effectively pad smaller elements with zeroes. You may use either an array or a linked structure comprised of nodes. What Will I Submit for Grading? Pseudocode, UML, code, test I/O – copied to one single file – and submitted as pdf and electronically submitted in Canvas 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 now Task Your task is to write a program, words, that reports information about the number of words read from its standard input. For example, if the file qbf.txt contains the text the quick brown fox jumps over the lazy dog then running the program with is input redirected to come from that file will report 9 words $ words < qbf.txt Total: 9 Automatic Testing This task is available for automatic testing using the name words. You can run the demo using demo words and you can test your work using try words <<filename>>. Background Use the following skeleton for the program: int main (int argc,         char         ** argv                   ) {  enum  {                 total, unique             }             mode = total;             for (int c; (c ...

Automatic Testing  This task is available for automatic testing using the name hp-35. You can run the demo using demo hp-35 and you can test your work using try hp-35 <filename. Background The HP-35 was the first scientific hand-held calculator, released in 1972 and an immediate success with engineers and scientists. Amongst other features, it used an unusual way of entering numbers, called RPN. RPN (reverse Polish notation, named for Polish mathematician Jan Lukasiewicz) allows complex calculations to be entered without the use of parentheses. The key difference is that operators are entered after the operands, rather than between them The HP-35 implemented RPN using a stack of 4 registers, referred to as X, Y , Z, and T. The value in the X register is the one shown on the calculator's LED display; the other registers are used for temporary values during calculations. New values are entered into the X register, with existing values "pushed" up the register stack: the ...

Requirements Task is to define a class to represent and manipulate rational numbers (fractions), so that by simply changing the type of n1 and n2 to Rational the program will compute fractional arithmetic expressions such as these: 1/2 + 1/3 // answer: 5/6 1/3 - 1/4 // answer: 1/12 2/3 * 4/5 // answer: 8/15 3/7 / 2/3 // answer: 9/14 Download the file fractions_0.zip, which contains the calculator code and a skeleton version of the Rational class. The class defines (but doesn't fully implement) appropriate constructors to initialise instances of Rational, extract and insert operators for input and output of Rational values, and of course arithmetic operators to compute the results. 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

Requirements Pick any np-complete problem and solve it in Map-Reduce and Fan. Approximate an NP-Complete solver using Map-Reduce and Fan In algorithms. 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

Explain how the application works  List the modules involved and briefly describe each of the module. [2 marks] Clearly describe the data organisation or storage patterns that influence the selection of specific data structure in that application. Use animations or illustrations in your explanation to improve understanding. [7 marks] Pick any one operation in (2) and present the algorithm Find the running time and estimate the efficiency of the algorithm. Explain the steps that drive you to the final answer. [3 marks] Conclusion on the findings (final answer in (3)) [2 marks] Output 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

Requirements: In one place there is a treasure with diamonds. To get someone to treasure should avoid an area with mines. We want to find, from the starting point, the shortest path to reach the treasure and does not pass through the minefield. However, it may go scratch the minefield, practically on the mines around the minefield. The input will be a file in the following form (without the comments): Integer coordinates exept the third line that is a single integer representing the number of diamonds. 8 23 //starting point 130 28//coordinates of the treasure 156 // the number of the diamonds 23 108 // the 1st mine 50 99 // 2nd mine 108 107 // 3rd mine 52 54 115 107 … Write a code such that: Finding the shortest path from the initial point and print the following message. The shortest distance is 122.16872656315464 The shortest path is:(8.0,23.0) -->(56.0,23.0) --> (130.0,28.0) Among the diamonds there is one fake that weighs less than the others (all the other diamonds have exac...

Requirements: operators supported: ( ) * / + - ^ trigonometric functions: sine, cosine, tangent, cotangent, secant, cosecant variables from set of a - z, A - Z, 0 - 9, and _ of arbitrary length must parse "code-like input" and create tokens from it must build a syntax tree using PEMDAS (http://www.purplemath.com/modules/orderops.htm) order of operations. Feel free to use code from http://castingrays.blogspot.com/2014/10/mathematical-expression-parsing-and.html for reference Ability to store variables, and variables must be usable in equations Numeric values supported is the set of ints and doubles Ability to support user-defined and evaluation of functionsExample: the user inputs “defn square(x) = x * x”square(5) returns 25 Support for basic graphing: e.g. graph( 3 * X ^ 2 + 7)  Support for trigonometric functions (implemented in the code – do not reference trig functions of the standard library). e.g. sin(30) outputs 0.5 Please include meaningful/informative comments Additio...

Heap Sort Algorithm to find the kth Maximum Creates an array of random integers of size 1,000,000. Develop the first algorithm to find the Kth largest number from the array (1 <= K <= 1,000,000). The algorithm must be based upon using a heap of size of K. Measure and average the running times of your program. having a base-case such as if (start == end) return A[]; center = (start+ end / 2) use either minHeap or maxHeap for finding the Kth largest number use divide to cut the array and conqueror for example: {2,3,4,8} = quickslecet )A[], start, center) {1,4,6,7} = quickslecet (A[], center+1, end) use conqueror for the for loop for example int i= start, j=center, i<= center && J<=end) Quick Select Algorithm to find the kth Maximum Develop the second algorithm to find the Kth largest number. You need to follow the quickselect algorithm to implement the solution. Measure and average the running times of your program. Deliverables: Source code. Performance analysis docu...