EBK ENHANCED DISCOVERING COMPUTERS & MI
1st Edition
ISBN: 8220100606922
Author: Vermaat
Publisher: YUZU
expand_more
expand_more
format_list_bulleted
Question
Chapter 4, Problem 15CT
Program Plan Intro
Personal finance software:
- It is an accounting application that aids the users at home and offices to balance their chequebooks, bills, and also it helps to track income, expenses, and investments in order to estimate financial plans.
- This software helps the users to find out the purpose they are spending money so that they can manage their finances.
Expert Solution & Answer
Trending nowThis is a popular solution!
Students have asked these similar questions
Please provide the Mathematica code
Explian this C program code.
#include <stdio.h>
void binary(unsigned int n) {
if (n /2!=0) {
binary(n /2);
}
printf("%d", n %2);
}
int main() {
unsignedint number =33777;
unsignedchar character ='X';
printf("Number: %u\n", number);
printf("Binary: ");
binary(number);
printf("\nDecimal: %u\nHexadecimal: 0x%X\n\n", number, number);
printf("Character: %c\n", character);
printf("ASCII Binary: ");
binary(character);
printf("\nASCII Decimal: %u\nASCII Hexadecimal: 0x%X\n", character, character);
return0;
}
Design a dynamic programming algorithm for the Longest Alternating Subsequence problem
described below:
Input: A sequence of n integers
Output: The length of the longest subsequence where the numbers alternate between being larger and
smaller than their predecessor
The algorithm must take O(n²) time. You must also write and explain the recurrence.
Example 1:
Input: [3, 5, 4, 1, 3, 6, 5, 7, 3, 4]
Output: 8 ([3, 5, 4, 6, 5, 7, 3, 4])
Example 2:
Input: [4,7,2,5,8, 3, 8, 0, 4, 7, 8]
Output: 8 ([4, 7, 2, 5, 3, 8, 0,4])
(Take your time with this for the subproblem for this one)
Chapter 4 Solutions
EBK ENHANCED DISCOVERING COMPUTERS & MI
Ch. 4 - Prob. 1SGCh. 4 - Prob. 2SGCh. 4 - Prob. 3SGCh. 4 - Prob. 4SGCh. 4 - _____ software performs functions specific to a...Ch. 4 - Prob. 6SGCh. 4 - List any restrictions for shareware, freeware,...Ch. 4 - Prob. 8SGCh. 4 - Prob. 9SGCh. 4 - Prob. 10SG
Ch. 4 - Prob. 11SGCh. 4 - Prob. 12SGCh. 4 - Prob. 13SGCh. 4 - Prob. 14SGCh. 4 - Prob. 15SGCh. 4 - Prob. 16SGCh. 4 - Prob. 17SGCh. 4 - Prob. 18SGCh. 4 - Prob. 19SGCh. 4 - Prob. 20SGCh. 4 - Prob. 21SGCh. 4 - Prob. 22SGCh. 4 - Prob. 23SGCh. 4 - Prob. 24SGCh. 4 - Prob. 25SGCh. 4 - Prob. 26SGCh. 4 - Prob. 27SGCh. 4 - Prob. 28SGCh. 4 - Prob. 29SGCh. 4 - Prob. 30SGCh. 4 - Prob. 31SGCh. 4 - Prob. 32SGCh. 4 - Prob. 34SGCh. 4 - Prob. 35SGCh. 4 - Prob. 36SGCh. 4 - Prob. 37SGCh. 4 - Prob. 38SGCh. 4 - Prob. 39SGCh. 4 - Prob. 40SGCh. 4 - Prob. 41SGCh. 4 - Prob. 42SGCh. 4 - Prob. 43SGCh. 4 - Prob. 44SGCh. 4 - Prob. 45SGCh. 4 - Prob. 46SGCh. 4 - Prob. 47SGCh. 4 - Prob. 48SGCh. 4 - Prob. 49SGCh. 4 - Prob. 1TFCh. 4 - Prob. 2TFCh. 4 - Prob. 3TFCh. 4 - Prob. 4TFCh. 4 - Prob. 5TFCh. 4 - Prob. 6TFCh. 4 - Prob. 7TFCh. 4 - Prob. 8TFCh. 4 - Prob. 9TFCh. 4 - Prob. 10TFCh. 4 - Prob. 11TFCh. 4 - Prob. 12TFCh. 4 - Prob. 1MCCh. 4 - Prob. 2MCCh. 4 - Prob. 3MCCh. 4 - Prob. 4MCCh. 4 - Prob. 5MCCh. 4 - Prob. 6MCCh. 4 - Prob. 7MCCh. 4 - Prob. 8MCCh. 4 - Prob. 1MCh. 4 - Prob. 2MCh. 4 - Prob. 3MCh. 4 - Prob. 4MCh. 4 - Prob. 5MCh. 4 - Prob. 6MCh. 4 - Prob. 7MCh. 4 - Prob. 8MCh. 4 - Prob. 9MCh. 4 - Prob. 10MCh. 4 - Prob. 2CTCh. 4 - Prob. 3CTCh. 4 - Prob. 4CTCh. 4 - Prob. 5CTCh. 4 - Prob. 6CTCh. 4 - Prob. 7CTCh. 4 - Prob. 8CTCh. 4 - Prob. 9CTCh. 4 - Prob. 10CTCh. 4 - Prob. 11CTCh. 4 - Prob. 12CTCh. 4 - Prob. 13CTCh. 4 - Prob. 14CTCh. 4 - Prob. 15CTCh. 4 - Prob. 16CTCh. 4 - Prob. 17CTCh. 4 - Prob. 18CTCh. 4 - Prob. 19CTCh. 4 - Prob. 20CTCh. 4 - Prob. 21CTCh. 4 - Prob. 22CTCh. 4 - Prob. 23CTCh. 4 - Prob. 24CTCh. 4 - Prob. 25CTCh. 4 - Prob. 26CTCh. 4 - Prob. 27CTCh. 4 - Prob. 28CTCh. 4 - Prob. 29CTCh. 4 - Prob. 30CTCh. 4 - Prob. 1PSCh. 4 - Prob. 2PSCh. 4 - Prob. 3PSCh. 4 - Prob. 4PSCh. 4 - Prob. 5PSCh. 4 - Prob. 6PSCh. 4 - Prob. 7PSCh. 4 - Prob. 8PSCh. 4 - Prob. 9PSCh. 4 - Prob. 10PSCh. 4 - Prob. 1.1ECh. 4 - Prob. 1.2ECh. 4 - Prob. 1.3ECh. 4 - Prob. 2.1ECh. 4 - Prob. 2.2ECh. 4 - Prob. 2.3ECh. 4 - Prob. 3.1ECh. 4 - Prob. 3.2ECh. 4 - Prob. 3.3ECh. 4 - Prob. 4.1ECh. 4 - Prob. 4.2ECh. 4 - Prob. 4.3ECh. 4 - Prob. 5.1ECh. 4 - Prob. 5.2ECh. 4 - Prob. 5.3ECh. 4 - Prob. 1IRCh. 4 - Prob. 2IRCh. 4 - Prob. 4IRCh. 4 - Prob. 2CTQ
Knowledge Booster
Similar questions
- Design a dynamic programming algorithm for the Coin-change problem described below: Input: An amount of money C and a set of n possible coin values with an unlimited supply of each kind of coin. Output: The smallest number of coins that add up to C exactly, or output that no such set exists. The algorithm must take O(n C) time. You must also write and explain the recurrence. Example 1: Input: C24, Coin values = = [1, 5, 10, 25, 50] Output: 6 (since 24 = 10+ 10+1+1 +1 + 1) Example 2: Input: C = 86, Coin values = [1, 5, 6, 23, 35, 46, 50] Output: 2 (since 86 = 46+35+5)arrow_forwardDesign a dynamic programming algorithm for the Longest Common Subsequence problem de- scribed below Input: Two strings x = x1x2 xm and y = Y1Y2... Yn Output: The length of the longest subsequence that is common to both x and y. . The algorithm must take O(m n) time. You must also write and explain the recurrence. (I want the largest k such that there are 1 ≤ i₁ < ... < ik ≤ m and 1 ≤ j₁ < ... < jk ≤ n such that Xi₁ Xi2 Xik = Yj1Yj2 ··· Yjk) Example 1: Input: x = 'abcdefghijklmnopqrst' and y = 'ygrhnodsh ftw' Output: 6 ('ghnost' is the longest common subsequence to both strings) Example 2: Input: x = 'ahshku' and y = ‘asu' Output: 3 ('asu' is the longest common subsequence to both strings)arrow_forwardDesign a dynamic programming algorithm for the problem described below Input: A list of numbers A = = [a1,..., an]. Output: A contiguous subsequence of numbers with the maximum sum. The algorithm must take O(n) time. You must also write and explain the recurrence. (I am looking for an i ≥ 1 and k ≥ 0 such that a + ai+1 + ···ai+k has the largest possible sum among all possible values for i and k.) Example 1: Input: A[5, 15, -30, 10, -5, 40, 10]. Output: [10, 5, 40, 10] Example 2: Input: A = [7, 5, 7, 4, -20, 6, 9, 3, -4, -8, 4] Output: [6,9,3]arrow_forward
- Design a dynamic programming algorithm for the Longest Increasing Subsequence problem described below: Input: A sequence of n integers Output: The length of the longest increasing subsequence among these integers. The algorithm must take O(n²) time. You must also write and explain the recurrence. Example 1: Input: [5, 3, 6, 8, 4, 6, 2, 7, 9, 5] Output: 5 ([3, 4, 6, 7, 9]) Example 2: Input: [12, 42, 66, 73, 234, 7, 543, 16] Output: 6 ([42, 66, 73, 234, 543])arrow_forwardDesign a dynamic programming algorithm for the Subset Sum problem described below: Input: A set of n integers A and an integer s Output: A subset of A whose numbers add up to s, or that no such set exists. The algorithm must take O(n·s) time. You must also write and explain the recurrence. Example 1: Input: A = {4, 7, 5, 2, 3}, s = 12 Output: {7,2,3} Example 2: Input: A{4, 7, 5,3}, s = 6 Output: 'no such subset'arrow_forwardTECNOLOGIE DEL WEB 2023/2023 (VER 1.1) Prof. Alfonso Pierantonio 1. Project Requirements The project consists in designing and implementing a Web application according to the methodology and the technologies illustrated and developed during the course. This document describe cross-cutting requirements the application must satisfy. The application must be realized with a combination of the following technologies: PHP MySQL HTML/CSS JavaScript, jQuery, etc templating The requirements are 2. Project size The application must have at least 18 SQL tables The number of SQL tables refers to the overall number of tables (including relation normalizations). 3. Methodology The application must be realized by adopting separation of logics, session management, and generic user management (authentication/permissions). Missing one of the above might correspond to a non sufficient score for the project. More in details: 3.1 Separation of Logics The separation of logics has to be realizse by using…arrow_forward
- Write a C program to calculate the function sin(x) or cos(x) using a Taylor series expansion around the point 0. In other words, you will program the sine or cosine function yourself, without using any existing solution. You can enter the angles in degrees or radians. The program must work for any input, e.g. -4500° or +8649°. The function will have two arguments: float sinus(float radians, float epsilon); For your own implementation, use one of the following relations (you only need to program either sine or cosine, you don't need both): Tip 1: Of course, you cannot calculate the sum of an infinite series indefinitely. You can see (if not, look in the program) that the terms keep getting smaller, so there will definitely be a situation where adding another term will not change the result in any way (see problem 1.3 – machine epsilon). However, you can end the calculation even earlier – when the result changes by less than epsilon (a pre-specified, sufficiently small number, e.g.…arrow_forwardWrite a C program that counts the number of ones (set bits) in the binary representation of a given number. Example:Input: 13 (binary 1101)Output: 3 unitsarrow_forwardI need help to resolve or draw the diagrams. thank youarrow_forward
- You were requested to design IP addresses for the following network using the addressblock 166.118.10.0/8, connected to Internet with interface 168.118.40.17 served by the serviceprovider with router 168.118.40.1/20.a) Specify an address and net mask for each network and router interface in the table provided. b) Give the routing table at Router 1.c) How will Router 1 route the packets with destinationi) 168.118.10.5ii) 168.118.10.103iii) 168.119.10.31iii) 168.118.10.153arrow_forwardI would like to get help to draw an object relationship diagram for a typical library system.arrow_forwardGiven the network of bridges in figure, and assuming that LAN ports on A, B, C, D, E, J are 10 Mbs (cost 100 for ports) except for ports on F, G, I, H, K which are 100Mbps LANs (cost 19 for ports) Draw the obtained spanning tree, cross the blocking state ports, and circle the designated ports and write the best cost broadcasted by each router next to its root port. list in logic level detail the expected last STP messages that will define the final status at each router.arrow_forward
arrow_back_ios
SEE MORE QUESTIONS
arrow_forward_ios
Recommended textbooks for you
Enhanced Discovering Computers 2017 (Shelly Cashm...Computer ScienceISBN:9781305657458Author:Misty E. Vermaat, Susan L. Sebok, Steven M. Freund, Mark Frydenberg, Jennifer T. CampbellPublisher:Cengage Learning
- Microsoft Windows 10 Comprehensive 2019Computer ScienceISBN:9780357392607Author:FREUNDPublisher:Cengage
Enhanced Discovering Computers 2017 (Shelly Cashm...
Computer Science
ISBN:9781305657458
Author:Misty E. Vermaat, Susan L. Sebok, Steven M. Freund, Mark Frydenberg, Jennifer T. Campbell
Publisher:Cengage Learning
Microsoft Windows 10 Comprehensive 2019
Computer Science
ISBN:9780357392607
Author:FREUND
Publisher:Cengage