Zeller's congruence is an algorithm developed by Christian Zeller to calculate the day of the week. The formula is 26 (m +1) h= q+ 10 k j +k+ + 4 ● +5j % 7 where • h is the day of the week (0: Saturday, 1: Sunday, 2: Monday, 3: Tuesday, 4: Wednesday, 5: Thursday, 6: Friday). is the day of the month. m is the month (3: March, 4: April, ..., 12: December). January and February are counted as months 13 and 14 of the previous year. jis the century (i.e. year/100) • kis the year of the century (i.e., year % 100). Note that all divisions in this exercise perform an integer division. Write a program that prompts the user to enter a year, month, and day of the month, and displays the name of the Month and the name of the day of the week using a switch.

Zeller's congruence is an algorithm developed by Christian Zeller to calculate the day of the week. The formula is 26 (m +1) h= q+ 10 k j +k+ + 4 ● +5j % 7 where • h is the day of the week (0: Saturday, 1: Sunday, 2: Monday, 3: Tuesday, 4: Wednesday, 5: Thursday, 6: Friday). is the day of the month. m is the month (3: March, 4: April, ..., 12: December). January and February are counted as months 13 and 14 of the previous year. jis the century (i.e. year/100) • kis the year of the century (i.e., year % 100). Note that all divisions in this exercise perform an integer division. Write a program that prompts the user to enter a year, month, and day of the month, and displays the name of the Month and the name of the day of the week using a switch.

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

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.
Algorithm to An iterative solution to Towers of Hanoi.in: triplet S = s0, s1, s2 representing the current game stateout: triplet R = r0, r1, r2 representing the new game statelocal: pole indices a, b, z ∈ {0, 1, 2}; disc numbers g, h ∈ [2, n]; last(Q) = Q|Q|−1, if1 ≤ |Q|, otherwise, last(Q) = +∞
Given f(x)=x2+6x and g(x)=1−x2, find f+g, f−g, fg, and fg. Enclose numerators and denominators in parentheses. For example, (a−b)/(1+n).
Suppose that you want to calculate 1434661 · 3785648743 − 100020304 · 54300201. You are told thatthe answer is a positive integer less than 90. Compute the answer mod 10 and mod 9, then combineto get the answer. Show all the necessary work to obtain your answers. Note: This technique hasoften been employed to do calculations with large integers because most of the computations use smallintegers, with only the Chinese Remainder Theorem step requiring large integers. For example, if theanswer is known to be less than 1036, the calculations can be done mod p for each prime less than100. Since the product of the primes less than 100 is approximately 2.3 × 1036, the Chinese RemainderTheorem gives the answer exactly
Prove that the following shows LHS = RHS : (+ 2 1 ) = 3 Given: 1=λf.λy.f y 2=λf.λy.f(f y) 3=λf.λy.f(f(f y)) M+N=λx.λy.(M x)((N x)y)
Find the first three examples of an odd number x>0 and an even number y>0 such that x − y = 7.
Computer Science solve the following recurrence equation by substitution. assume n is the power of 2. show your work. T(n) = 2, if n=1 T(n) = 4T(n/2)+2n, if n>1
SOLVE FOR THE REAL ROOTS USING INCREMENTAL SEARCH METHOD x3+4x2-10=0 (1-2) limitations real roots: 1.365230013 follow this format Iteration Δx x f(x) x+Δx f(x+Δx) f(x)*f(x+Δx) Increments: 1 = Δx 0.1 0.01 0.001 0.0001 0.00001 and so on
Implement the Euclidean algorithm to find the greatest common denominator a) give an example of how to obtain the greatest common denominator of (12345, 54321).
John while finding the mean of 30 two digit positive integers mistakenly exchanged the digits of one number, i.e., qp for pq. Due to which the mean was decreased by 2.7. Find the difference between p and q.
Computer Science Use the non-restoring division algorithm to compute the division of a dividend X = 14 = (1110) and a divisor D = 6 = (0110).
An evil king has n bottles of wine, and a spy has just poisoned one of them. Unfortunately, they do not know which one it is. The poison is very deadly; just one drop diluted even a billion to one will still kill. Even so, it takes a full month for the poison to take effect. Design a scheme for determining exactly which one of the wine bottles was poisoned in just one month’s time while expending O(log n) taste testers.