C program to merge two arrays.

Posted on May 11, 2012 by Sandeepa Nadahalli

Arrays in C.
Write a C program to merge two arrays.
In this program we check the elements of arrays A, B and put that elements in the resulted array C in sorted manner.
Read more about C Programming Language . and read the C Programming Language (2nd Edition). by K and R.

/***********************************************************
* You can use all the programs on  www.c-program-example.com
* for personal and learning purposes. For permissions to use the
* programs for commercial purposes,
* contact [email protected]
* To find more C programs, do visit www.c-program-example.com
* and browse!
* 
*                      Happy Coding
***********************************************************/

#include<stdio.h>
#include<conio.h>
void main( )
{
    int n,m,i,j,k,c[40],a[20],b[20];
    clrscr ();
    printf("Enter how many elements for array A?:n");
    scanf("%d",&n);
    printf  ("Enter how many elements for array B?:n");
   scanf("%d",&m);
    printf("Enter elements for A:-n");
    for(i=0;i<n;i++)
    scanf("%d",&a[i]);
    printf("Enter elements for B:-n");
    for(j=0;j<m;j++)
    scanf("%d",&b[j]);
    i=j=k=0;
    while(i<n&&j<m)
    {
        if(a[i]<b[j])
        c[k++]=a[i++];
        else
        if(a[i]>b[j])
        c[k++]=b[j++];
        else
        
        {
            c[k++]=b[j++];
            i++;
            j++;
        }
    }
    
    if(i<n)
    {
        int t;
        for(t=0;t<n;t++)
        
        c[k++]=a[i++];
    }
    if(j<m)
    {
        int t;
        for(t=0;t<m;t++)
        {
            c[k++]=b[j++];
        }
    }
    printf("nn Merged Array C:nn")
    for(k=0;k<(m+n);k++)
    printf("t n %d ",c[k]);
    getch();
}

Read more Similar C Programs
Data Structures

Learn C Programming

You can easily select the code by double clicking on the code area above.

To get regular updates on new C programs, you can Follow @c_program

You can discuss these programs on our Facebook Page. Start a discussion right now,

our page!

Share this program with your Facebook friends now! by liking it

(you can send this program to your friend using this button)

Like to get updates right inside your feed reader? Grab our feed!

To browse more C Programs visit this link

K & R C Chapter 6 Exercise Solutions.

Posted on May 10, 2012 by Sandeepa Nadahalli

We have already provided solutions to all the exercises in the book “C Programming Language (2nd Edition)“ popularly known as K & R C book.

In this blog post I will give links to all the exercises from Chapter 6 of the book for easy reference.

Chapter 6: Structures

Exercise 6-1. Our version of getword does not properly handle underscores, string constants, comments, or preprocessor control lines. Write a better version.
Solution to Exercise 6-1.

Exercise 6-2.Write a program that reads a C program and prints in alphabetical order each group of variable names that are identical in the first 6 characters but different somewhere thereafter. Don’t count words within strings and comments. Make 6 a parameter that can be set from the command line.
Solution to Exercise 6-2.

Exercise 6-3.Write a cross-referencer that prints a list of all words in a document, and, for each word, a list of the line numbers on which it occurs. Remove noise words like “the,” “and,” and so on.
Solution to Exercise 6-3.

Exercise 6-4. Write a program that prints the distinct words in its input sorted into decreasing order of frequency of occurrence. Precede each word by its count.
Solution to Exercise 6-4.

Exercise 6-5. Write a function undef that will remove a name and definition from the table maintained by lookup and install .
Solution to Exercise 6-5.

Exercise 6-6. Implement a simple version of the #define processor (i.e., no arguments) suitable for use with C programs, based on the routines of this section. You may also find getch and ungetch helpful.
Solution to Exercise 6-6.

You can purchase the book from here or here.

To get regular updates on new C programs, you can Follow @c_program

You can discuss these programs on our Facebook Page. Start a discussion right now,

our page!

Like to get updates right inside your feed reader? Grab our feed!

To browse more C Programs visit this link

C Program to search the linked list.

Posted on May 8, 2012 by Sandeepa Nadahalli

Data structures using C,
Write c program to search the linked list.
Linked list is a data structure in which the objects are arranged in a linear order. In this program, we sort the list elements in ascending order. Read more about C Programming Language . and read the C Programming Language (2nd Edition). by K and R.

/***********************************************************
* You can use all the programs on  www.c-program-example.com
* for personal and learning purposes. For permissions to use the
* programs for commercial purposes,
* contact [email protected]
* To find more C programs, do visit www.c-program-example.com
* and browse!
* 
*                      Happy Coding
***********************************************************/

#include<stdio.h>
#include<conio.h>
#include<malloc.h>
struct l_list
{
    int info;
    struct link *next;
}
start, *node;

int search(int);
void main()
{
    int no,i,item,pos;
    clrscr();
    start.next=NULL;
    node=&start;
    printf("How many nodes, you want in linked list? ");
    scanf("%d",&no);
    printf("");
    for(i=0;i<no;i++)
    {
        node->next=(struct l_list *)malloc(sizeof(struct l_list));
        printf("Enter element in node %d: ",i+1);
        scanf("%d",&node->info);
        node=node->next;
    }
    node->next=NULL;
    printf("Linked list(only with info field) is:");
    
    node=&start;
    while(node->next!=NULL)
    {
        printf("%d    ",node->info);
        node=node->next;
    }
    printf("
    
    Enter item to be searched : ");
    scanf("%d",&item);
    pos=search(item);
    if(pos<=no)
    printf("Your item is at node %d",pos);
    else
    printf("Sorry! item is no in linked list.a");
    getch();
}

int search(int item)
{
    int n=1;
    node=&start;
    while(node->next!=NULL)
    {
        if(node->info==item)
        break;
        else
        n++;
        node=node->next;
    }
    return n;
}

Read more Similar C Programs
Data Structures

Learn C Programming

You can easily select the code by double clicking on the code area above.

To get regular updates on new C programs, you can Follow @c_program

You can discuss these programs on our Facebook Page. Start a discussion right now,

our page!

Share this program with your Facebook friends now! by liking it

(you can send this program to your friend using this button)

Like to get updates right inside your feed reader? Grab our feed!

To browse more C Programs visit this link

C Program to find day of birth from DOB

Posted on May 8, 2012September 8, 2017 by Sandeepa Nadahalli

Problem Statement

Write a C Program to find the day of birth when date of birth is given. For example, if we give 02/04/2107 (02nd April 2017) as input, the program should output that it was a Sunday.

Solution

Pick a year as base year where January 1st falls on a Monday. We are using 1900 as base year in our program.
Then we find the number of years after base year. Day of the week in the beginning of the year shifts by 1 in every non leap year. 365 days -> 52 * 7 + 1.
Once we know on what day a given year started, we can calculate each month’s starting day.
From there it’s as simple as counting the days and finding which day it is.

In this program we find the day of birth like Monday, Sunday.. when date of birth is given. For a more detailed explanation of the method can be found here Converting a Month-Date-Year to the Day of the Week

The Program

	#include<stdio.h>
	#include<stdlib.h>

	int main() {
	int d, m, y, year, month, day, i;

	printf("Enter date of birth (DD MM YYYY) :");
	scanf("%d %d %d", &d, &m, &y);
	if( (d > 31) \|\| (m > 12) \|\| (y < 1900 \|\| y >= 2100) )
	{
	printf("INVALID INPUT. Please enter a valid date between 1900 and 2100");
	exit(0);
	}

	year = y-1900;
	year = year/4;
	year = year+y-1900;

	switch(m)
	{
	case 1:
	case 10:
	month = 1;
	break;
	case 2:
	case 3:
	case 11:
	month = 4;
	break;
	case 7:
	case 4:
	month = 0;
	break;
	case 5:
	month = 2;
	break;
	case 6:
	month = 5;
	break;
	case 8:
	month = 3;
	break;
	case 9:
	case 12:
	month = 6;
	break;
	}

	year = year + month;
	year = year + d;
	/* Need to make sure extra day is not needed in leap year for dates before March */
	if(( y > 1900 ) && ( y % 4 == 0 ) && ( m < 2 ) )
	year--;
	day = year % 7;

	switch(day)
	{
	case 0:
	printf("Day is SATURDAY\n");
	break;
	case 1:
	printf("Day is SUNDAY\n");
	break;
	case 2:
	printf("Day is MONDAY\n");
	break;
	case 3:
	printf("Day is TUESDAY\n");
	break;
	case 4:
	printf("Day is WEDNESDAY\n");
	break;
	case 5:
	printf("Day is THURSDAY\n");
	break;
	case 6:
	printf("Day is FRIDAY\n");
	break;
	}

	return 0;
	}

view raw day_of_birth.c hosted with ❤ by GitHub

Sample Output

Date of birth to day of birth — Finding day of birth from DOB

Like to get updates right inside your feed reader? Grab our feed!

To browse more C Programs visit this List of C Programs

C program to print all the possible permutations of given digits

Posted on May 8, 2012 by Sandeepa Nadahalli

Write a C program to print all the possible permutations of given digits.
Permutations means possible way of rearranging in the group or set in the particular order.
Example:
Input:1, 2, 3
Output:1 2 3, 1 3 2, 2 1 3, 3 1 2, 2 3 1, 3 2 1
Read more about C Programming Language . and read the C Programming Language (2nd Edition). by K and R.

/***********************************************************
* You can use all the programs on  www.c-program-example.com
* for personal and learning purposes. For permissions to use the
* programs for commercial purposes,
* contact [email protected]
* To find more C programs, do visit www.c-program-example.com
* and browse!
* 
*                      Happy Coding
***********************************************************/

#include<stdio.h>
#include<stdlib.h>
#include<conio.h>
int lev=-1,n,val[50],a[50];
void main()
{
    int i,j;
    clrscr();
    printf("Enter how many numbers?n");
    scanf("%d",&n);
    printf("nEnter %d numbers:nn",n);
    for(i=0;i<n;i++)
    {
        val[i]=0;
        j=i+1;
        scanf("%dnn",&a[j]);
    }
    visit(0);
    getch();
}
visit(int k)
{
    int i;
    val[k]=++lev;
    if(lev==n)
    {
        for(i=0;i<n;i++)
        printf("%2d",a[val[i]]);
        printf("        ");
    }
    for(i=0;i<n;i++)
    if(val[i]==0)
    visit(i);
    lev--;
    val[k]=0;
    
}

Read more Similar C Programs
Learn C Programming
Recursion
Number System

You can easily select the code by double clicking on the code area above.

To get regular updates on new C programs, you can Follow @c_program

You can discuss these programs on our Facebook Page. Start a discussion right now,

our page!

Share this program with your Facebook friends now! by liking it

(you can send this program to your friend using this button)

Like to get updates right inside your feed reader? Grab our feed!

To browse more C Programs visit this link

C Program to toss a coin using random function.

Posted on May 7, 2012 by Sandeepa Nadahalli

Write a c program to toss a coin using random function.
In this Program,We use the rand()%2 function that will compute random integers 0 or 1.
Read more about C Programming Language . and read the C Programming Language (2nd Edition). by K and R.

/***********************************************************
* You can use all the programs on  www.c-program-example.com
* for personal and learning purposes. For permissions to use the
* programs for commercial purposes,
* contact [email protected]
* To find more C programs, do visit www.c-program-example.com
* and browse!
* 
*                      Happy Coding
***********************************************************/

#include <stdio.h>
#include <time.h>
#include <stdlib.h>

int main(void) {
    int toss = 0;
    int call = 0;
    srand(time(NULL));
    
    toss = rand() % 2;
    
    printf("Say head or tail! press 0 for head and 1 for tail:nn");
    scanf("%d", &call);
    if(call==0 || call==1)
    {
        if(toss == call)
        {
            if(toss==1)
            printf("You called it correctly ... it is tailn");
            else
            printf("You called it correctly ... it is headn");
        }
        else
        {
            if(toss==1)
            printf("No way ...it is head !n");
            else
            printf("No way ... it is tail!n");
        }
    }
    else
    printf("Invalid call!!!!!nn");
    return 0;
}

Read more Similar C Programs
Learn C Programming
Recursion
Number System

You can easily select the code by double clicking on the code area above.

To get regular updates on new C programs, you can Follow @c_program

You can discuss these programs on our Facebook Page. Start a discussion right now,

our page!

Share this program with your Facebook friends now! by liking it

(you can send this program to your friend using this button)

Like to get updates right inside your feed reader? Grab our feed!

To browse more C Programs visit this link

C program to demonstrate assert macro.

Posted on May 7, 2012 by Sandeepa Nadahalli

Write a C program to demonstrate assert macro.
assert macro defined in assert.h library. assert is mainly used for debugging. assert function checks the conditions at run time, and program executes only if the assert is true otherwise program aborts and shows the error message.
Read more about C Programming Language . and read the C Programming Language (2nd Edition). by K and R.

/***********************************************************
* You can use all the programs on  www.c-program-example.com
* for personal and learning purposes. For permissions to use the
* programs for commercial purposes,
* contact [email protected]
* To find more C programs, do visit www.c-program-example.com
* and browse!
* 
*                      Happy Coding
***********************************************************/

#include <stdio.h>
#include <assert.h>
#include<conio.h>
int main()
{
    int num1, num2;
    clrscr();
    printf("Enter two numbers:nn");
    scanf("%d %d", &num1, &num2);
    assert(num2 != 0);
    printf("%d/%d = %.2fn", num1, num2, num1/(float)num2);
    return 0;
}

Read more Similar C Programs
Learn C Programming
Recursion
Number System

You can easily select the code by double clicking on the code area above.

To get regular updates on new C programs, you can Follow @c_program

You can discuss these programs on our Facebook Page. Start a discussion right now,

our page!

Share this program with your Facebook friends now! by liking it

(you can send this program to your friend using this button)

Like to get updates right inside your feed reader? Grab our feed!

To browse more C Programs visit this link

C program to implement SJF algorithm.

Posted on May 5, 2012 by Sandeepa Nadahalli

Write a C program to implement SJF algorithm.
Shortest Job First(SJF) is the CPU scheduling algorithm. In SJF, if the CPU is available it allocates the process which has smallest burst time, if the two process are same burst time it uses FCFS algorithm.Read more about C Programming Language . and read the C Programming Language (2nd Edition) by K and R.

/***********************************************************
* You can use all the programs on  www.c-program-example.com
* for personal and learning purposes. For permissions to use the
* programs for commercial purposes,
* contact [email protected]
* To find more C programs, do visit www.c-program-example.com
* and browse!
* 
*                      Happy Coding
***********************************************************/

#include<stdio.h>
#include<conio.h>

void main()
{
    int i,j,n,brust_time[10],start_time[10],end_time[10],wait_time[10],temp,tot;
    float avg;
    clrscr();
    printf("Enter the No. of jobs:nn");
    scanf("%d",&n);
    for(i=1;i<=n;i++)
    {
        printf("n n Enter %d process burst time:n",i);
        scanf("%d",&brust_time[i]);
    }
    
    for(i=1;i<=n;i++)
    {
        for(j=i+1;j<=n;j++)
        {
            if(brust_time[i]>brust_time[j])
            {
                temp=brust_time[i];
                brust_time[i]=brust_time[j];
                brust_time[j]=temp;
            }
        }
        
        if(i==1)
        {
            start_time[1]=0;
            end_time[1]=brust_time[1];
            wait_time[1]=0;
        }
        
        else
        {
            start_time[i]=end_time[i-1];
            end_time[i]=start_time[i]+brust_time[i];
            wait_time[i]=start_time[i];
        }
    }
    printf("nn BURST TIME t STARTING TIME t END TIME t   WAIT TIMEn");
    printf("n ********************************************************n");
    for(i=1;i<=n;i++)
    {
        printf("n %5d %15d %15d %15d",brust_time[i],start_time[i],end_time[i],wait_time[i]);
    }
    printf("n ********************************************************n");
    for(i=1,tot=0;i<=n;i++)
    tot+=wait_time[i];
    avg=(float)tot/n;
    printf("nnn AVERAGE WAITING TIME=%f",avg);
    for(i=1,tot=0;i<=n;i++)
    tot+=end_time[i];
    avg=(float)tot/n;
    printf("nn AVERAGE TURNAROUND TIME=%f",avg);
    for(i=1,tot=0;i<=n;i++)
    tot+=start_time[i];
    avg=(float)tot/n;
    printf("nn AVERAGE RESPONSE TIME=%fnn",avg);
    getch();
}

Read more Similar C Programs
C Basic

Search Algorithms.

You can easily select the code by double clicking on the code area above.

To get regular updates on new C programs, you can Follow @c_program

You can discuss these programs on our Facebook Page. Start a discussion right now,

our page!

Share this program with your Facebook friends now! by liking it

(you can send this program to your friend using this button)

Like to get updates right inside your feed reader? Grab our feed!

To browse more C Programs visit this link

K & R C Chapter 5 Exercise Solutions.

Posted on May 4, 2012 by Sandeepa Nadahalli

We have already provided solutions to all the exercises in the book “C Programming Language (2nd Edition)“ popularly known as K & R C book.

In this blog post I will give links to all the exercises from Chapter 5 of the book for easy reference.

Chapter 5: Pointers and Arrays

Exercise 5-1. As written, getint treats a + or – not followed by a digit as a valid representation of zero. Fix it to push such a character back on the input.
Solution to Exercise 5-1.

Exercise 5-2.Write getfloat , the floating-point analog of getint . What type does getfloat return as its function value?
Solution to Exercise 5-2.

Exercise 5-3.GWrite a pointer version of the function strcat that we showed in Chapter 2: strcat(s,t) copies the string t to the end of s .
Solution to Exercise 5-3.

Exercise 5-4. Write the function strend(s,t) , which returns 1 if the string t occurs at the end of the string s , and zero otherwise.
Solution to Exercise 5-4.

Exercise 5-5. Write versions of the library functions strncpy , strncat , and strncmp , which operate on at most the first n characters of their argument strings. For example, strncpy(s,t,n) copies at most n characters of t to s . Full descriptions are in Appendix B.
Solution to Exercise 5-5.

Exercise 5-6. Rewrite appropriate programs from earlier chapters and exercises with pointers instead of array indexing. Good possibilities include getline (Chapters 1 and 4), atoi , itoa , and their variants (Chapters 2, 3, and 4), reverse (Chapter 3), and strindex and getop (Chapter 4).
Solution to Exercise 5-6.
Exercise 5-7. Rewrite readlines to store lines in an array supplied by main , rather than calling alloc to maintain storage. How much faster is the program?
Solution to Exercise 5-7.

Exercise 5-8.There is no error-checking in day_of_year or month_day. Remedy this defect.
Solution to Exercise 5-8.

Exercise 5-9.Rewrite the routines day_of_year and month_day with pointers instead of indexing.
Solution to Exercise 5-9.

Exercise 5-10. Write the program expr , which evaluates a reverse Polish expression from the command line, where each operator or operand is a separate argument. For example, expr 2 3 4 + * evaluates 2 X (3+4).
Solution to Exercise 5-10.

Exercise 5-11. Modify the programs entab and detab (written as exercises in Chapter 1) to accept a list of tab stops as arguments. Use the default tab settings if there are no arguments.
Solution to Exercise 5-11.

Exercise 5-12. Extend entab and detab to accept the shorthand entab -m +n to mean tab stops every n columns, starting at column m . Choose convenient (for the user) default behavior.
Solution to Exercise 5-12.

Exercise 5-13. Write the program tail, which prints the last n lines of its input. By default, n is 10, say, but it can be changed by an optional argument, so that tail -n prints the last n lines. The program should behave rationally no matter how unreasonable the input or the value of n. Write the program so it makes the best use of available storage; lines should be stored as in the sorting program of Section 5.6, not in a two-dimensional array of fixed size.
Solution to Exercise 5-13.

Exercise 5-14. Modify the sort program to handle a -r flag, which indicates sorting in reverse (decreasing) order. Be sure that -r works with -n.
Solution to Exercise 5-14.
Exercise 5-15.Add the option -f to fold upper and lower case together, so that case distinctions are not made during sorting; for example, a and A compare equal.
Solution to Exercise 5-15.

Exercise 5-16.Add the -d (“directory order”) option, which makes comparisons only on letters, numbers and blanks. Make sure it works in conjunction with -f .
Solution to Exercise 5-16.

Exercise 5-17. Add a field-handling capability, so sorting may be done on fields within lines, each field sorted according to an independent set of options. (The index for this book was sorted with -df for the index category and -n for the page numbers.)
Solution to Exercise 5-10.

Exercise 5-18. Make dcl recover from input errors.
Solution to Exercise 5-18.

Exercise 5-19. Modify undcl so that it does not add redundant parentheses to declarations.
Solution to Exercise 5-19.

Exercise 5-20. Expand dcl to handle declarations with function argument types, qualifiers like const , and so on.
Solution to Exercise 5-20.

You can purchase the book from here or here.

To get regular updates on new C programs, you can Follow @c_program

You can discuss these programs on our Facebook Page. Start a discussion right now,

our page!

Like to get updates right inside your feed reader? Grab our feed!

To browse more C Programs visit this link

C Program to implement FCFS algorithm.

Posted on May 4, 2012 by Sandeepa Nadahalli

Write a C Program to implement FCFS algorithm.
First Come First Served(FCFS) algorithm is the CPU scheduling algorithm. In FCFS process is served when they are arrived in order, i.e First In First Out(FIFO). FCFS is the simple scheduling algorithm, but it takes typically long/varying waiting time.
Read more about C Programming Language . and read the C Programming Language (2nd Edition) by K and R.

/***********************************************************
* You can use all the programs on  www.c-program-example.com
* for personal and learning purposes. For permissions to use the
* programs for commercial purposes,
* contact [email protected]
* To find more C programs, do visit www.c-program-example.com
* and browse!
* 
*                      Happy Coding
***********************************************************/
#include<stdio.h>
#include<conio.h>
main()
{
    int n,i,j,sum=0;
    int arrv[10],ser[10],start[10];
    int finish[10],wait[10],turn[10];
    float avgturn=0.0,avgwait=0.0;
    start[0]=0;
    clrscr();
    printf("Enter the number of processes:");
    scanf("%d",&n);
    for(i=0;i<n;i++)
    {
        printf("Enter the arriwal and service time of %d process:",i+1);
        scanf("%d%d",&arrv[i],&ser[i]);
    }
    for(i=0;i<n;i++)
    {
        sum=0;
        for(j=0;j<i;j++)
        sum=sum+ser[j];
        start[i]=sum;
    }
    for(i=0;i<n;i++)
    {
        finish[i]=ser[i]+start[i];
        wait[i]=start[i];
        turn[i]=ser[i]+wait[i];
    }
    for(i=0;i<n;i++)
    {
        avgwait+=wait[i];
        avgturn+=turn[i];
    }
    avgwait/=n;
    avgturn/=n;
    printf("narraival service Start Finish Wait Turnn");
    for(i=0;i<n;i++)
    printf("%dt%dt%dt%dt%dt%dn",arrv[i],ser[i],start[i],
    finish[i],wait[i],turn[i]);
    printf("nAverage waiting time=%f",avgwait);
    printf("nAverage turn around time=%f",avgturn);
    getch();
}

Read more Similar C Programs
C Basic

Search Algorithms.

You can easily select the code by double clicking on the code area above.

To get regular updates on new C programs, you can Follow @c_program

You can discuss these programs on our Facebook Page. Start a discussion right now,

our page!

Share this program with your Facebook friends now! by liking it

(you can send this program to your friend using this button)

Like to get updates right inside your feed reader? Grab our feed!

To browse more C Programs visit this link

C Program Examples

Year: 2012

C program to merge two arrays.

K & R C Chapter 6 Exercise Solutions.

C Program to search the linked list.

C Program to find day of birth from DOB

Problem Statement

Solution

The Program

Sample Output

C program to print all the possible permutations of given digits

C Program to toss a coin using random function.

C program to demonstrate assert macro.

C program to implement SJF algorithm.

K & R C Chapter 5 Exercise Solutions.

C Program to implement FCFS algorithm.