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...

Database Technology Repeat CA ERD (Entity Relationship Diagram) i. Identify each of the entities ii. Identify2-3 attributes for each entity with a key attribute iii. Name the relationships for each of the binary pairs iv. Identify the degree of relationship for each of the binary pairs v. Decompose any many to many  relationships vi. Draw the completed Entity Relationship Model A restaurant manager wishes to set up a database to record the details of its customers, reservations for tables in the restaurant and the employees assigned to tables. Screenshot For each customer the database will record -- a customer number (unique), name, address and phone number. The details to be recorded for each table include - table number (unique), capacity. Customers make reservations for tables. The requested time and date of the reservation is recorded along with a unique reservation number. Each reservation is made by one customer and books one table. A customer will make a number of rese...

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 ternary predicat...

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

Background The arithmetic expressions considered in this project consist of non-negative integers, operators "+", "-", and "*", and parentheses "(" and ")". Arithmetic expressions are usually written using the infix notation, in which operators appear between the two operands on which they act (e.g., "2 + 2"). The evaluation of expressions in infix notation is done according to the standard order of operations: multiplications must be done first, from left to right, then all additions and subtractions, again from left to right. Parentheses can be used to change the order in which operations must be performed, e.g., the expression inside the innermost parentheses must be evaluated first, etc. Since each of the considered operators takes exactly two operands, such an arithmetic expression can be represented as a proper binary tree whose internal nodes are associated with the expression's operators and whose leaves are associ...