How to approach Julian date?

Use and complete the template provided. The entire template must be completed. If you don't, your post may be deleted!

  1. The problem statement, all variables and given/known data:
    This function is given the day, month and year and returns the Julian date. The Julian date is the ordinal day number for that day. For example, 1 Jan is day 1 of any year, 31 Dec is day 365 for any non-leap year and 1 Feb is day 32 for any year. Use your days_in_month() function from the previous problem to calculate the Julian date. Put the code for the function julian_date() in the file julian.c, and the prototype in the file julian.h Write a driver, main(), which asks the user to enter a month, day, year and prints the Julian date. Terminate with EOF. Put the driver in the file driver3.c. You will compile this program with the command:

  2. Relevant commands, code, scripts, algorithms:
    Other code that relates to it would be the days.h and leap.h

  3. The attempts at a solution (include all code and scripts):
    for julian.c

#include <stdio.h>
#include "julian.h"
#include "days.h"
#include "leap.h"

int julian_date(int day, int month, int year)
{
int days;
int yr;
int month;
 #ifdef DEBUG
 printf("debug:Enter julian_date: day = %d, month = %d, year %d\n", day, month, year);
 #endif
        while(month>0 && month<13)
        {days=days_in_month;
                if (year==leap) 
                {       
                        if(month==1)
                        {
                         days= days +1  ;
                        #ifdef DEBUG
                        printf("debug:Exit amount of days: %d January is \n", days);
                        #endif

                        return days;
                        }
                        if(month==2)
                        {
                        days=31+day;
                        }
                        if (month==3)
                        {
                        days=




        #ifdef DEBUG
        {
        printf("debug:Exit julian_date: %d\n");
        #endif
        return days;
        }
        }
}
  1. Complete Name of School (University), City (State), Country, Name of Professor, and Course Number (Link to Course):
    University of Hawaii at Manoa, Honolulu (HI), Oahu (Hawaii), Tep Dobry, EE 160
    ( i can't post any URL for i am new to this forum but type tep dobry in google and the link to the course should be titled with 2011 after the link is connected the information is in its in the homework section)
    If you need more info i'll post up more
    Thank you for your time
    Note: Without school/professor/course information, you will be banned if you post here! You must complete the entire template (not just parts of it).

First, I must say that year professor has thrown you a curve. As this page says:

The description of the algorithm given is clearly day-of-year, not a real Julian Day. This may confuse you as you research the subject.

I won't write this for you, but a few comments on your code...
year==leap That can't be right. Even if there was only one leap year, you never set the variable called leap to anything. You need to calculate whether a year is a leap year or not. A good algorithm is on the Wikipedia page for leap year. And remember that C has a % to indicate modulus. So the expression year%400 is the remainder when year is divided by 400. If this is zero then year was an exact multiple of 400.

In January,the day-of-year and the day-of-month are the same. Why do you have day=day+1 ?

I don't see any driver... What this means is a main program that calls your function and returns the result.

I also don't see your days_in_month() function mentioned in the problem. Ideally I think it should take both a year and and a month because February changes in a leap year. But it may have been defined differently.

I think there are enough clues here for you to take another crack at this routine. Good luck!

1 Like