Please answer the question in C++ only Given an integer N, let us consider a triangle of numbers of N lines in which a number a11 appears in the first line, two numbers a21 and a22 appear in the second line, three numbers a31, a32 and 33 appear in the third line, etc. In general, i numbers ai, ai... ai appear in the th line for all 1 ≤ i ≤ N. Develop a program that will compute the largest of the sums of numbers that appear on the paths starting from the top towards the base, so that: • on each path the next number is located on the row below, more precisely either directly below or below and one place to the right. Warning: large Input/Output data, be careful with certain languages Input 1 3 1 21 123 Output 5

Please answer the question in C++ only Given an integer N, let us consider a triangle of numbers of N lines in which a number a11 appears in the first line, two numbers a21 and a22 appear in the second line, three numbers a31, a32 and 33 appear in the third line, etc. In general, i numbers ai, ai... ai appear in the th line for all 1 ≤ i ≤ N. Develop a program that will compute the largest of the sums of numbers that appear on the paths starting from the top towards the base, so that: • on each path the next number is located on the row below, more precisely either directly below or below and one place to the right. Warning: large Input/Output data, be careful with certain languages Input 1 3 1 21 123 Output 5

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

Q1.What is the smallest 32-bit floating point number f such that 128 + f > 128 ? What is the smallest 32-bit floating point number g such that 1 + g > 1 ? What is the relationship between f and g? Where f and g are differentiable functions. We have found that the given functions have the same derivative. In general, if two differentiable functions differs by a constant at x, its derivatives slopes at this point are the same. Write a short C++ or Python program to support your answer (for example, show that you checked whether there is no smaller number than your f by trying 128+f/2 == 128. Q2. Explain what changes are needed to change the 4x3 memory presented on Slide 62 of Chapter 3 to a 16x6 memory.
In C++ Just answer the questions in simple code please. Each new term in the Fibonacci sequence is generated by adding the previous two terms. By starting with 1 and 2, the first 10 terms will be:1, 2, 3, 5, 8, 13, 21, 34, 55, 89, ...By considering the terms in the Fibonacci sequence whose values do not exceed four million, find the sum of the even-valued terms. Do this in a function called Sierra.
program in python the following problem We ask that you assist the ITPC by indicating the maximum total number of letters that can be printed on a set of N shirts that are valid to be worn by both teams. For example, if “PÉREZ”, “GONZÁLEZ” and “LÓPEZ” play in the U-18 team, while “GARCIA”, “PERALTA” and “RODRÍGUEZ” play in the U-21 team, the best thing is that a jersey has the prefix "G" with 1 letter (for "GONZALEZ" and "GARCIA" to use), another has the prefix "PER" with 3 letters (for "PÉREZ" and "PERALTA" to use), and another has a 0-letter prefix (to be used by “LOPEZ” and “RODRIGUEZ”). Thus, the answer in this case is 1 + 3 + 0 = 4. Entry Each test case is described using three lines. The first line contains an integer N that indicates the number of players in each of the two teams (1≤N≤104). The second line contains the surnames of the N players of the U-18 team. The third line contains the surnames of the N players of the U21 team. Each last name is a non-empty string of at…
Answer in C++, show example output please There are three buckets size X, Y, M (1<=X<=Y<=M). All three buckets are initiallyempty. Using these three buckets, we can perform any number of the following twotypes of operations. We can fill the smallest bucket (of size X) completely to the top with X units of water andpour it into the size-M bucket, as long as this will not cause the size-M bucket tooverflow. We can fill the medium bucket (of size Y) completely to the top with Y units of water andpour it into the size-M bucket, as long as this will not cause the size-M bucket tooverflow. Although we may not be able to completely fill the size-M bucket, but we can stilldetermine the maximum amount of milk we can possibly add to largest bucket. Sample input:17 25 77 Sample output:76 In this example, we fill the bucket of size 17 three times and then bucket of size 25once, accumulating a total of 76 units of water. You could use additional test case to test your program:Input: 52 791…
I need help in coding the following practice problem using the fundamentals of C Programming Language without using arrays. The New Telephone Company has the following rate structure for long-distance calls:a) Any call started after 6:00 P.M. gets a 50% discount.b) Any call started after 8:00 A.M. is charged full price.c) All calls are subject to a 4% tax.d) The regular rate for a call is /P5.00 per minute.e) Any call longer than 60 minutes receives a 15% discount on its cost(after anyother discount is taken but before tax is added).Write a program that processes several calls by reading the start time for each call andthe length of each call. The gross cost (before any discounts or tax) should be printedfollowed by the net cost (after discounts are deducted and tax is added).
I need help writing this code in C without using the <limits.h> library. Problem: Given a list of noises generated by all pairs of animals, determine the least sum of noise that can be generated. Input will begin with a line containing 1 integer, n (1 ≤ n ≤ 11), representing the number ofanimal exhibits. The following n lines will each contain n space separated non-negativeintegers, representing the noises generated by animal pairs. The i-th value on the j-th linerepresents the noise level generated by animal j when antagonized by animal i. Each of thegiven individual noise levels generated will be at most 1,000,000. The i-th value of the i-th line will always be 0. Animals don’t generate noise from themselves. Output should contain 1 line of output, containing a single integer representing the leastpossible noise level sum.
Please solve in python code! Thanks! A plane flying horizontally with a speed of 300 km/hr passes over a ground radar station at an altitude of 10 km. At time t = 0, the plane is 100 km away (and moving toward the radar station-see figure below). Let θ be the angle of elevation from the radar station to the plane. (a) If t is time in minutes, find an expression for θ1(t) (valid on the domain t ∈ [0, 20]) and θ2(t) (valid on the domain t ∈ (20, ∞)). Print both functions and their derivatives. (b) Convert into degrees and plot θ1 in the domain t ∈ [0, 20] and θ2 in the domain t ∈ [20, 60] (on the same graph) (c) Plot both derivatives in a separate graph using the corresponding domains from part (b) and a range of θ ∈ [0, 10].
# Solve it with C programing On a bus, there are N number of passengers sitting on their seats ranging from 0 to N-1. Karim is looking for passengers whose ages are multiplicand of 4 and seats are within a specific range (X to Y), where both X and Y are inclusive. Now can you help Karim to solve his problem? Input: In the first line you have to take an integer (N) which indicates total number of passengers. Next line you will take two space-separated integers (X Y) which indicates the seat range.Third line of input will take N space-separated integers indicating the ages of the passengers. N.B: Seat number will count from 0 to N-1.Sample input:104 722 36 37 21 16 24 32 27 21 75 Sample output :16 24 32
Please write a C++ coding with modularity using functions. 15. (Numerical) a. Euclid’s method for finding the greatest common divisor (GCD) of two positive integers consists of the following steps:Step 1: Divide the larger number by the smaller and retain the remainder.Step 2: Divide the smaller number by the remainder, again retaining the remainder.Step 3: Continue dividing the previous remainder by the current remainder until the remainder is zero, at which point the last non-zero remainder is the GCD. For example, if the two positive integers are 84 and 49, you have the following: Step 1: 84/49 yields a remainder of 35.Step 2: 49/35 yields a remainder of 14.Step 3: 35/14 yields a remainder of 7.Step 3: 14/7 yields a remainder of 0. Therefore, the last non-zero remainder, which is 7, is the GCD of 84 and 49.Using Euclid’s algorithm, replace the stub function written for Exercise 14 with an actual function that determines and returns the GCD of its two integer arguments. thank you…
This question deals with processing the monthly transactions of the clients of a bank. For eachclient, your C program should read in the account number of the client (integer), followed by thestarting balance. For each transaction for this client, your program should read in the type oftransaction (W or D), followed by the amount of money involved in the transaction. If thetransaction is a withdrawal (W), then the amount should be subtracted from the current balanceand a new current balance should be obtained. Similarly, if the transaction is a deposit (D), thenthe amount should be added to the running balance.After processing one transaction for a client, your program should prompt the user for moretransactions, for example, the prompt might be: Any more transactions – Y/N? If the response is Y, then your program should repeat the process of asking for the type oftransaction and amount, and continue processing as stated above. If the response is N, then yourprogram should output the…
You are asked to write a simple C program that will accept an integer value in the range of 5-95 and in increments of 5 at a time, representing the number of cents to give to a customer in their change. The program should calculate how many coins of each denomination and display this to the user. Valid coin values are 50, 20, 10 and 5. Your solution (program and algorithm) should be modular in nature. This requires the submission of a high-level algorithm and suitable decompositions of each step.
// Description: Write a program that outputs a root of a given function f(x) by using a bi-section method. // f(x) = x3 + 5x2 +7x +2 // IN C++ Please!