Algorithm writingInstructions:Algorithms are a generic way of describing asolution to a computational problem withoutuse of any specific programming languagesyntax. It cannot be executed on a realcomputer, but it can model and resemble realprogramming code. Natural language is usedwhenever details are unimportant ordistracting.Your algorithm:Must be unambiguous (exact)..are the stepsnumbered? .do we always know where to go nextor are we left hanging?Must be correct (solves the problem)...are the'requirements' being met?Must come to an end (terminate)...how do weknow when to end this?Must be general (for all cases).. .can we inputany data & still solve the problem?Must be at the right level of detail... . will acomputer (in general) understand what we areasking it to do?Requirements --> You have a store that sellslemons and oranges. Oranges are $.30 each andlemons are $.15 each. Your solution to thisproblem should get from the user the numbersof oranges and lemons he/she wants andoutputs the total amount of money they oweyou.

Below is the algorithm for the given question:

Requirements --> You have a store that sells lemons and oranges. Oranges are $.30 each and lemons are $.15 each. Your solution to this problem should get from the user the numbers of oranges and lemons he/she wants and outputs the total amount of money they owe you.

Requirements --> You have a store that sells lemons and oranges. Oranges are $.30 each and lemons are $.15 each. Your solution to this problem should get from the user the numbers of oranges and lemons he/she wants and outputs the total amount of money they owe you.

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

Recursive filtering techniques are often used to reduce the computational complexity of a repeated operation such as filtering. If an image filter is applied to each location in an image, a (horizontally) recursive formulation of the filtering operation expresses the result at location (x +1, y) in terms of the previously computed result at location (x, y). A box convolution filter, B, which has coefficients equal to one inside a rectangular win- dow, and zero elsewhere is given by: w-1h-1 B(r, y,w, h) = ΣΣΤ+ i,y + ) i=0 j=0 where I(r, y) is the pixel intensity of image I at (x, y). We can speed up the computation of arbitrary sized box filters using recursion as described above. In this problem, you will derive the procedure to do this. (a) The function J at location (x,y) is defined to be the sum of the pixel values above and to the left of (x,y), inclusive: J(r, y) = - ΣΣ14.0 i=0 j=0 Formulate a recursion to compute J(r, y). Assume that I(r, y) = 0 if r <0 or y < 0. Hint: It may be…
1. The entrance room (or the starting of the maze) is considered as level 1. Now, answer these following questions: (a). Write an algorithm to figure out how many maximum levels the maze can go up to. (b). Figure out the complexity of your algorithm. To create a maze some rooms of a building is connected. Starting room is called Entrance room. From the entrance room other rooms are there connected from it. However, some rooms of that maze- building have connected room from it, and some rooms do not have any connected room. Each of the room can have at most or up to two rooms connected from it. The starting room is the entrance room of the maze or building. Fore example: It can be any one like the followings: Exemple -: Room1 Roono Room Entrance Room Raom Room2 Room? Roo Roomo Here, maxinum level =7 Example -2; Entrace Room D- Room5 Room 2 Room 4 Maxximum level=3
Select the correct answer for the question below: Dynamic programming is an algorithm pattern ... 1.Is not applicable to algorithms which use recursion. 2.That is applicable to almost every set of circumstances and can be widely implemented. 3.That is applicable to only a narrow range of circumstances. 4.Offers poor efficiency gains, when applicable.
Implement a sorting algorithm of your choice in Java and What are some factors to consider when determining which sorting algorithm would be best to utilize? In your answer, specifically think of and give a real-life scenario where: A given sorting algorithm is used One algorithm outperforms the other Please and Thank you
A graph is a collection of vertices and edges G(V, E). A weighted graph has weights (numbers, etc.) on every edge. A multigraph can have more than one edges between any vertices. Explain why a person should use a weighted graph instead of a multigraph. Give examples. An adjacency matrix might be a better choice for speeding up a program, however, it consumes huge memory for large graphs. How this situation can be improved? What programming constructs better suit graph representation? Explain with example
QuestionIn a square maze, we can have multiple steps from ‘s’ to reach ‘e’ with one place that can only be visited once. Example:Input 3s....#.e# Output4These are the unique steps:*..*..**. *..**..*. **..*..*. **.**.**. Input 4.s...#.##e.#.... Output2These are the unique steps:.**...*..**..**. .**...*..**..... The problem:➢ Input: an integer followed by the maze.➢ Output: total number of unique steps. (no need to print the unique steps)➢ Task: Design an algorithm in both (pseudocode and code) to print the total number of unique steps using a backtracking algorithm.
1. A certain computer algorithm executes four times as many operations when it is run with an input of size n as when it is run with an input of size n – 1. Here, n > 1 is an integer. When the algorithm is run with an input of size 1, it executes 12 operations. How many operations does the algorithm execute when it is run with an input of size 5? How many operations does the algorithm execute when it is run with an input of size n?
The puzzle called the Towers of Hanoi consists of three pegs, one of which contains several rings stacked in order of descending diameter from bottom to top. The problem is to move the stack of rings to another peg. You are allowed to move only one ring at a time, and at no time is a ring to be placed on top of a smaller one. Observe that if the puzzle involved only one ring, it would be extremely easy. Moreover, when faced with the problem of moving several rings, if you could move all but the largest ring to another peg, the largest ring could then be placed on the third peg, and then the problem would be to move the remaining rings on top of it. Using this observation, develop a recursive algorithm for solving the Towers of Hanoi puzzle for an arbitrary number of rings.
1. A runner targets herself to improve her time on a certain course by 3 seconds a day. If onday 0 she runs the course in 3 minutes, how fast must she run it on day 14 to stay ontarget?2. A certain computer algorithm executes twice as many operations when it is run with aninput of size k as when it is run with an input of size k − 1 (where k is an integer that isgreater than 1). When the algorithm is run with an input of size 1, it executes sevenoperations. How many operations does it execute when it is run with an input of size 25?
Personal project Q5. This question is concerned with the design and analysis of recursive algorithms. You are given a problem statement as shown below. This problem is concerned with performing calculations on a sequence A of real numbers. Whilst this could be done using a conventional loop-based approach, your answer must be developed using a recursive algorithm. No marks will be given if your answer uses loops. FindAverageAndProduct(a1, ...., an) such that n > 1 Input: A sequence of real values A = (a1, ...., an) Output:, A 2-tuple (average, product) containing the average (average) of all the values and the product (product) of all the values of the elements in A. Your recursive algorithm should use a single recursive structure to find the average and product values, and should not use two separate instances of a recursive design. You should not employ any global variables. (a) Produce a pseudo code design for a recursive algorithm to solve this problem. (b) Draw a call-stack…
2. Name the algorithms for the searching problem that you already know. Givea good succinct description of each algorithm in English. If you know no suchalgorithms, use this opportunity to design one.
Artificial Intelligence (Part - 2) ==================== The Towers of Hanoi is a famous problem for studying recursion incomputer science and searching in artificial intelligence. We start with N discs of varying sizes on a peg (stacked in order according to size), and two empty pegs. We are allowed to move a disc from one peg to another, but we are never allowed to move a larger disc on top of a smaller disc. The goal is to move all the discs to the rightmost peg (see figure). To solve the problem by using search methods, we need first formulate the problem. Supposing there are K pegs and N disk. (2) What is the size of the state space?