Programming in C
4th Edition
ISBN: 9780321776419
Author: Stephen G. Kochan
Publisher: Addison-Wesley
expand_more
expand_more
format_list_bulleted
Concept explainers
Videos
Textbook Question
Chapter 8, Problem 4E
If you take the value of N as computed in exercise 2, subtract 621,049 from it, and then take that result modulo 7, you get a number from 0 to 6 that represents the day of the week (Sunday through Saturday, respectively) on which the particular day falls. For example, the value of N computed for August 8, 2004, is 732.239 as derived previously. 732,239 – 621,049 gives 111,190. and 111,190 % 7 gives 2, indicating that this date falls on a Tuesday.
Use the functions developed in the previous exercise to develop a
Expert Solution & Answer
Want to see the full answer?
Check out a sample textbook solution
Students have asked these similar questions
Given an integer N and a base X, the task is to find the minimum number of operations required to represent N as a sum of the distinct powers of X. In each operation, you can either increment or decrement N. You are allowed to make the given operation any number of times
Examples:
Input: N = 7, X = 3 Output: 3.
Use following series to do the given task;
135 79 11 13 15 1719 21 23 25 27 29 31 ...
Given the number N of odd numbers in a certain line, your task is to determine the sum of the last three numbers of that line.
For example N = 5 means, the third line, the last three numbers are 13, 15 and 17. The summation of these three numbers is 45.
InputThe first line tells the number of test cases. From the next line, the input is a sequence of lines, one odd number N (1 < N <1000000000) per line.
OutputFor each input line write the sum of the last three odd numbers written in that line of series with N numbers.
This must be done using CORAL language.
Primary U.S. interstate highways are numbered 1-99. Odd numbers (like the 5 or 95) go north/south, and evens (like the 10 or 90) go east/west. Auxiliary highways are numbered 100-999, and service the primary highway indicated by the rightmost two digits. Thus, the 405 services the 5, and the 290 services the 90.
Given a highway number, indicate whether it is a primary or auxiliary highway. If auxiliary, indicate what primary highway it serves. Also indicate if the (primary) highway runs north/south or east/west.
Ex: If the input is:
90
the output is:
The 90 is primary, going east/west.
Ex: If the input is:
290
the output is:
The 290 is auxiliary, serving the 90, going east/west.
Ex: If the input is:
0
or any number not between 1 and 999, the output is:
0 is not a valid interstate highway number.
Chapter 8 Solutions
Programming in C
Ch. 8 - Type in and run the seven programs presented in...Ch. 8 - In certain applications, particularly in the...Ch. 8 - Write a function e that takes as its arguments two...Ch. 8 - If you take the value of N as computed in exercise...Ch. 8 - Write a function called c that takes as its...Ch. 8 - Replace the d function from Program 8.4 with the...
Additional Engineering Textbook Solutions
Find more solutions based on key concepts
What is denormalization?
Database Concepts (8th Edition)
Land Calculation One acre of land is equivalent to 43,560 square feet. Design a program that asks the user to e...
Starting Out with Programming Logic and Design (4th Edition)
Give the declaration for two variables called feet and inches. Both variables
are of type int and both are to b...
Absolute Java (6th Edition)
(Using a Class without Importing It) Explain how a program could use class Scanner without importing it.
Java How To Program (Early Objects)
How do functions help you reuse code in a program?
Starting Out with Python (3rd Edition)
What is a symbol table?
Computer Science: An Overview (12th Edition)
Knowledge Booster
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.Similar questions
- A number is divisible by 11 if the difference of the sum of its digits at odd places and the sum ofits digits at even places is either 0 or divisible by 11.For example, for 2547039:(Sum of digits at odd places) - (Sum of digits at even places) = (9 + 0 + 4 + 2) - (3 + 7 + 5) = 0So 2547039 is divisible by 11.But for 13165648:(Sum of digits at odd places) - (Sum of digits at even places) = (8 + 6 + 6 + 3) - (4 + 5 + 1 + 1) = 1212 is not divisible by 11 so 13165648 is also not divisible by 11.Sample run:Give your number: 13165648Total is: 1213165648 is not divisible by 11.arrow_forwardA number is divisible by 11 if the difference of the sum of its digits at odd places and the sum ofits digits at even places is either 0 or divisible by 11.For example, for 2547039:(Sum of digits at odd places) - (Sum of digits at even places) = (9 + 0 + 4 + 2) - (3 + 7 + 5) = 0So 2547039 is divisible by 11.But for 13165648:(Sum of digits at odd places) - (Sum of digits at even places) = (8 + 6 + 6 + 3) - (4 + 5 + 1 + 1) = 1212 is not divisible by 11 so 13165648 is also not divisible by 11.arrow_forwardThe Problem A Zeckendorf number is defined for all positive integers as the number of Fibonacci numbers which must be added to equal a given number k. So, the positive integer 28 is the sum of three Fibonacci numbers (21, 5, and 2), so the Zeckendorf number for k = 28 is three. Wikipedia is a satisfactory reference for our purposes for more details of the Zeckendorf and Fibonacci numbers. In both cases, you do not need to read the entire Wikipedia entry. Your assignment is to write two ARM assembly language functions which calculate Zeckendorf and Fibonacci numbers. Zeck function The first function, which should be named zeck, receives an integer parameter in register zero. This will be the variable k we discussed above. Your code should return the Zeckendorf number for k in register zero when complete. If the parameter k is zero, return zero. If the parameter k is negative, return minus 1. If the parameter k is too large to calculate, return minus 1. Fib function The other function,…arrow_forward
- For each number n from 1 to 4, compute n2 mod 5. Then for each n, compute n3 mod 5 and finally n4 mod 5. Do you notice anything surprising? (You may need to go past n = 4 to see a pattern)arrow_forwardLet n be an integer. If 3n+ 4 is odd, then n is odd.arrow_forwardThe Fibonacci sequence is listed below: The first and second numbers both start at 1. After that, each number in the series is the sum of the two preceding numbers. Here is an example: 1, 1, 2, 3, 5, 8, 13, 21, ... If F(n) is the nth value in the sequence, then this definition can be expressed as F(1) = 1 F(2) = 1 F(3) = 2 F(4) = 3 F(5) = 5 F(6) = 8 F(7) = 13 F(8) = 21 F(n) = F(n - 1) + F(n - 2) for n > 2 Example: Given n with a value of 4F(4) = F(4-1) + F(4-2)F(4) = F(3) + F(2)F(4) = 2 + 1F(4) = 3 The value of F at position n is defined using the value of F at two smaller positions. Using the definition of the Fibonacci sequence, determine the value of F(10) by using the formula and the sequence. Show the terms in the Fibonacci sequence and show your work for the formula.arrow_forward
- The Fibonacci sequence is defined as follows: ϕ0=0, ϕ1=1, ϕn=ϕn−1+ϕn−2. ϕ0=0, ϕ1=1, ϕn=ϕn−1+ϕn−2. Given an integer a, determine its index among the Fibonacci numbers, that is, print the number n such that ϕn=a. If a is not a Fibonacci number, print -1 . WRITE THE CODE IN PYTHON PLEASEarrow_forwardWorking with cell addresses The address of a cell in Google sheets can be specified in two ways: either as a letter-number pair like C5, or as a pair of numbers like "row 5, column 3". Some formulas may be easier to specify on one way or the other, so it's useful to know how to convert from one form to the other and back. ROW() and COLUMN() take addresses in A1 format and return the number of the row and column respectively. ADDRESS() takes numeric row and column inputs and returns the address in A1 format. It also has an option argument to specify the relativity of the addresses: 1 (the default) returns absolute addresses; 2, 3, and 4 return row absolute, column absolute, and relative addresses respectively. In this chapter you'll be working with Indian butterfly data from Singh and Pandey. Instructions In column H, get the row numbers of the Locality column. In column I, get the column numbers of that column. In column J, convert columns H and I back to addresses in $A$1…arrow_forwardlet n = 1*3*5*....*197*199 (the product of first 100 odd numbers) find the last 2 digits of narrow_forward
- Given a positive integer, N, the ’3N+1’ sequence starting from N is defined as follows: If N is an even number, then divide N by two to get a new value for N. If N is an odd number, then multiply N by 3 and add 1 to get a new value for N. Continue to generate numbers in this way until N becomes equal to 1. For example, starting from N = 3 the complete ’3N+1’ sequence would be:3, 10, 5, 16, 8, 4, 2, 1 Do the following: Write a code in C++ to ask the user to enter a positive integer (N) in the main() function. Write a function sequence() that receives the integer value N and display the ‘3N+1’ sequence starting from the integer value that wasreceived (entered by the user). The function must also count and return the numbers that the sequence consists of. The returned value must be displayed from the main() function. Example input and output is given in the following image.arrow_forwardStarting with the first Fibonacci number, Fib(1) = 1, and the second Fibonacci number, Fib(2) = 1, what is the sum of Fib(8) and Fib(10)?arrow_forwardYou 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.arrow_forward
arrow_back_ios
SEE MORE QUESTIONS
arrow_forward_ios
Recommended textbooks for you
Database System ConceptsComputer ScienceISBN:9780078022159Author:Abraham Silberschatz Professor, Henry F. Korth, S. SudarshanPublisher:McGraw-Hill Education
Starting Out with Python (4th Edition)Computer ScienceISBN:9780134444321Author:Tony GaddisPublisher:PEARSON
Digital Fundamentals (11th Edition)Computer ScienceISBN:9780132737968Author:Thomas L. FloydPublisher:PEARSON
C How to Program (8th Edition)Computer ScienceISBN:9780133976892Author:Paul J. Deitel, Harvey DeitelPublisher:PEARSON
Database Systems: Design, Implementation, & Manag...Computer ScienceISBN:9781337627900Author:Carlos Coronel, Steven MorrisPublisher:Cengage Learning
Programmable Logic ControllersComputer ScienceISBN:9780073373843Author:Frank D. PetruzellaPublisher:McGraw-Hill Education
Database System Concepts
Computer Science
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:McGraw-Hill Education
Starting Out with Python (4th Edition)
Computer Science
ISBN:9780134444321
Author:Tony Gaddis
Publisher:PEARSON
Digital Fundamentals (11th Edition)
Computer Science
ISBN:9780132737968
Author:Thomas L. Floyd
Publisher:PEARSON
C How to Program (8th Edition)
Computer Science
ISBN:9780133976892
Author:Paul J. Deitel, Harvey Deitel
Publisher:PEARSON
Database Systems: Design, Implementation, & Manag...
Computer Science
ISBN:9781337627900
Author:Carlos Coronel, Steven Morris
Publisher:Cengage Learning
Programmable Logic Controllers
Computer Science
ISBN:9780073373843
Author:Frank D. Petruzella
Publisher:McGraw-Hill Education
Computational Software for Intelligent System Design; Author: Cadence Design Systems;https://www.youtube.com/watch?v=dLXZ6bM--j0;License: Standard Youtube License