We want to buy the car depending on its cost for 10 years. Here is the algorithm for deciding which car to buy depend a price of OMR 4.000 per liter of gas and usage of 15,000 kilometers per year. For each car, compute the total cost as follows: annual fuel consumed = annual miles driven / fuel efficiency annual fuel cost = price per gallon x annual fuel consumed operating cost = 10 x annual fuel cost total cost = purchase price + operating cost If total cost1 < total cost2 Choose car1. Else if total cost1 > total cost2 Choose car2. Else Choose car1 or car2

We want to buy the car depending on its cost for 10 years. Here is the algorithm for deciding which car to buy depend a price of OMR 4.000 per liter of gas and usage of 15,000 kilometers per year. For each car, compute the total cost as follows: annual fuel consumed = annual miles driven / fuel efficiency annual fuel cost = price per gallon x annual fuel consumed operating cost = 10 x annual fuel cost total cost = purchase price + operating cost If total cost1 < total cost2 Choose car1. Else if total cost1 > total cost2 Choose car2. Else Choose car1 or car2

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

Similar questions

There are two isotopes of an unknown element, X-19 and X-21. The abundance of X-19 is 14.29%. A weighted average uses the percentages of each isotope to scale their contribution to the total mass. Each isotope's contribution is the percentage (in decimal form) multiplied by the mass of the isotope. What is the contribution (in amu) to the weighted average from the X-19 isotope, which has a mass of 19.00 amu?
In a candy store, there are N different types of candies available and the prices of all the N different types of candies are provided to you. You are now provided with an attractive offer. You can buy a single candy from the store and get at most K other candies ( all are different types ) for free. Now you have to answer two questions. Firstly, you have to find what is the minimum amount of money you have to spend to buy all the N different candies. Secondly, you have to find what is the maximum amount of money you have to spend to buy all the N different candies. In both the cases you must utilize the offer i.e. you buy one candy and get K other candies for free. Example 1: Input: N = 4 K = 2 %3D candies[] = {3 2 1 4} Output: 3 7
The cost of renting a room at a hotel is, say $100.00 per night. For special occasions, such as a wedding or conference, the hotel offers a special discount as follows: If the number of rooms booked is at least 10, the discount is 10%; at least 20, the discount is 20%; and at least 30, the discount is 30%. Also if rooms are booked for at least three days, then there is an additional 5% discount. Write a program that prompts the user to enter the cost of renting one room, the number of rooms booked, the number of days the rooms are booked, and the sales tax (as a percent). The program outputs the cost of renting one room, the discount on each room as a percent, the number of rooms booked, the number of days the rooms are booked, the total cost of the rooms, the sales tax, and the total billing amount. Your program must use appropriate named constants to store special values such as various discounts.
The distance d between a point p(x, y), where x and y are the coordinates of p, and the center of a circle (a, b), where a and b are the coordinates of the center, is given by the formula: (a, b). r d = (x – a)² + (y – b)² r The point p(x, y) is considered inside the circle if d r. (x, y)' (x', y') Write a Java class called CirclePointthat: a. Reads from the user 2 integer values x and y represent the coordinates of the point p, b. Reads from the user 2 integer values a and b represent the coordinates of the center of the circle, c. Reads from the user a real value r represents the radius of the circle, d. Calculates and prints the distance d (rounded to 2 decimal places) between the point p and the center of the circle, and e. Checks and prints whether the point is inside, on or outside the circle. NOTE: if the radius value is negative, an error message should be shown. Sample Run 1: ==================== Enter the coordinates of the point: 5 7 Enter the coordinates of the center of…
The position as a function of time of a squirrel running on a grass field is given in polar coordinates by: r(t) = 20 + 30 (1 – e-0.1 t) 0(t) = 1 (1 – e-0.2 t) = TT Plot as 1* subplot the trajectory (position) of the squirrel for 0 st < 20s with a step of time 0.5s. Calculate numerically the speed of the squirrel given by v = r d8/dt. Create a 2d subplot for speed of the squirrel v (numerical) as function of time for 0 st s 20s. Report the curve as green circle without line. In the same figure (2¤d subplot), plot as black solid line the theoretical velocity given by the formula v = r de/dt as function of time for 0 st s 20s.
Interest on a credit card’s unpaid balance is calculated using the average daily balance. Suppose that netBalance is the balance shown in the bill, payment is the payment made, d1 is the number of days in the billing cycle, and d2 is the number of days payment is made before billing cycle. Then, the average daily balance is: averageDailyBalance =netBalance x d1-payment x d2d1 If the interest rate per month is, say, 0.0152, then the interest on the unpaid balance is: Interest= averageDailyBalance * 0.0152 Write a program using c++ compiler that accepts as inputnetBalance, payment, d1,d2, and interest rate per month. The program outputs the interest. Format your output to two decimal places.
There are two banks; Bank A and Bank B. Their interest rates vary. You have received offers from both banks in terms of annual rate of interest, tenure, and variations of the rate of interest over the entire tenure. You have to choose the offer which costs you least interest and reject the other. Do the computation and make a wise choice. The loan repayment happens at a monthly frequency and Equated Monthly Installment (EMI) is calculated using the formula given below : EMI = loanAmount * monthlyInterestRate / ( 1 - 1 / (1 + monthlyInterestRate)^(numberOfYears * 12)) Constraints: 1 <= P <= 1000000 1 <=T <= 50 1<= N1 <= 30 1<= N2 <= 30 Input Format: First line : P – principal (Loan Amount). Second line: T – Total Tenure (in years). Third Line: N1 is the number of slabs of interest rates for a given period by Bank A. First slab start from the first year and the second slab starts from the end of the first slab and so on. Next N1 line will…
Algorithms Question Three points P, Q, and R are said to be collinear if they are on a single line. To check whether the 3 points lie on the same line, we use the distance formula. If P, Q and R are three collinear points, then: Distance from P to Q + Distance from Q to R = Distance from P to R PQ + QR = PR The distance between two points (x1, y1) and (x2, y2) is given by Hence, we can easily find the distance between the points P, Q and R, with the help of this formula. Design an algorithm (pseudocode) to check whether three points are collinear. In your solution include the input and the output.
You are given n users, and their times that they log in and out of a website: You are interested in which users are on the site at the same time. For example, you are given the following 5 users and their times: User 1- In: 1 Out: 4 User 2- In: 2 Out: 5 User 3- In: 7 Out: 8 User 4- In: 9 Out:10 User 5- In: 6 Out:10 This gives the distinct users that are on the site at the same time as (1,2), (4,5), and (3,5). Given n elements, write pseudocode for an algorithm that would take n^2 time to compute the number of pairs of users that are on the site at the same time
Q10: Using (ode45, ode23, or ode15s), solve the below dynamic electrical system differential equation. 1. The charge Q(t) on the capacitor in the electrical circuit shown satisfies the differential equation where d²Q dQ 1 +R- + √ √e dt2 dt L = 0.5 R = 6.0 C= 0.02 and V(t) is the applied voltage. V(t) = V(t), henrys is the coil's inductance ohms is the resistor's resistance farads is the capacitor's capacitance ellee (i) Is the circuit oscillatory? (ii) If V(t) = 24 sin(10r) volts and Q(0) = 0 = Q'(0), find Q(t). (iii) Sketch the transient solution, the steady state solution, and the full solution Q(t).
You need to take a trip by car to another town that you have never visited before. Therefore, you are studying a map to determine the shortest route to your destination. Depending on which route you choose, there are five other towns (call them A, B, C, D, E) that you might pass through on the way. The map shows the mileage along each road that directly connects two towns without any intervening towns. These numbers are summarized in the following table, where a dash indicates that there is no road directly connecting these two towns without going through any other towns. Miles between Adjacent Towns Town A B C DE Destination Origin A 40 60 50 10 70 B 20 55 40 50 10 D 60 E 80 (a) Formulate this problem as a shortest-path problem by drawing a network where nodes represent towns, links represent roads, and numbers indicate the length of each link in miles. (b) Use the Dijkstra's algorithm to solve this shortest path problem.
You need to take a trip by car to another town that you have never visited before. Therefore, you are studying a map to determine the shortest route to your destination. Depending on which route you choose, there are five other towns (call them A, B, C, D, E) that you might pass through on the way. The map shows the mileage along each road that directly connects two towns without any intervening towns. These numbers are summarized in the following table, where a dash indicates that there is no road directly connecting these two towns without going through any other towns. Town Origin A B C D E A 40 Miles between Adjacent Towns C D E B 60 10 50 20 - 70 55 - 88811 40 50 10 Destination | | || 88 60 80 (a) Formulate this problem as a shortest-path problem by drawing a network where nodes represent towns, links represent roads, and numbers indicate the length of each link in miles. (b) Use the Dijkstra's algorithm to solve this shortest path problem. Illustrate your work by using a table.…