Showing posts with label Programming in C. Show all posts

C Program to implement Circular Queue.

Problems: Write a C program to implement a circular queue that contains a list of names.

Data Structure Definition:

Node: A node is a basic building block of a linked list. A node may contain different segments, but basically it contains two parts which are as followed,

Data or information part : It stores the data in the node

Link part : It points to the next node or holds the address to the next node.

Source Code:

#include<stdlib.h>
#include<stdio.h>
#include<string.h>
#define MAX 10

//defining the basic element of the queue
typedef struct Q
{
	int R,F;
	char *data[MAX];
}Q;

//declaration of functions
void initialise(Q *P);
int empty(Q *P);
int full(Q *P);
void enqueue(Q *P,char *x);
char * dequeue(Q *P);
void print(Q *P);

//main function
int main()
{	
	//intializing a node named queue
	Q q;
	
	//declaration and initialization fof variables
    int op;
    char x[40],*y;
    
    //initializ the queue
    initialise(&q);
        
	do{
			//displaying the menu
			printf("\n\n 1) Enqueue\n 2) Dequeue\n 3) Print\n 4) Quit");
			
			//inputting the input choice 
			printf("\n Enter Your Choice : ");
			scanf("%d",&op);
		
			//calling functions and passing arguments through the functions as per th choice of the user
			switch(op)
	 		{ 
			 	case 1: 
				 	printf("\n Enter string : ");
				    fflush(stdin);
		    		scanf("%s",x);
		    		if(!full(&q))
					{
						y=(char*)malloc(strlen(x)+1);
						strcpy(y,x);
						enqueue(&q,y);
					}
		    		else
						printf("\n Queue is full !!!!");
		        				break;
	   			case 2:	
				    if(!empty(&q))
		    		{
						y=dequeue(&q);
						printf("\n Deleted Data = %s",y);
		    		}
		   			else
						printf("\n Queue is empty !!!!");
		   				break;
	   			case 3: 
				   		print(&q);a
						break;
	}
      }while(op!=4);
}

//function to initialize a circular queue
void initialise(Q *P)
{
	//declaration of variable
	int i;
	//initializing the queue
	for(i=0;i<MAX;i++)
		P->data[i]=NULL;
	P->R=-1;
	P->F=-1;
}

//function to check if the queue is empty
int empty(Q *P)
{
	//if the queue is empty, return 1 else, return 0
	if(P->R==-1)
		return(1);
	return(0);
}

//function to check if the queue is full
int full(Q *P)
{
	//return 1 if the queue is full, else return 0
	if((P->R+1)%MAX==P->F)
		return(1);
	return(0);
}

//function to enqueue and element in the queue
void enqueue(Q *P,char *x)
{
	//enqueueing the element
	if(P->R==-1)
	{
		P->R=P->F=0;
		if(P->data[P->R]!=NULL)
			free(P->data[P->R]);
		P->data[P->R]=x;
	}
	else
	{
		P->R=(P->R+1)%MAX;
		if(P->data[P->R]!=NULL)
			free(P->data[P->R]);
		P->data[P->R]=x;
	}
}

//function to dequeue 
char * dequeue(Q *P)
{
	//declaring a character type pointer
	char *x;
	
	//dequeing the element from the queue
	x=P->data[P->F];
	if(P->R==P->F)
	{
		P->R=-1;
		P->F=-1;
	}
	else
		P->F=(P->F+1)%MAX;
	return(x);
}

//function to display the elements of the queue
void print(Q *P)
{
	int i;
	if(!empty(P))
	{
		printf("\n");
		for(i=P->F;i!=P->R;i=(i+1)%MAX)
			printf("%s\t",P->data[i]);
	}
       printf("%s\t",P->data[i]);
}

Output:

1) Enqueue

2) Dequeue

3) Print

4) Quit

Enter Your Choice : 1

Enter string : computer

1) Enqueue

2) Dequeue

3) Print

4) Quit

Enter Your Choice : 1

Enter string : science

1) Enqueue

2) Dequeue

3) Print

4) Quit

Enter Your Choice : 1

Enter string : honours

1) Enqueue

2) Dequeue

3) Print

4) Quit

Enter Your Choice : 3

computer science honours

1) Enqueue

2) Dequeue

3) Print

4) Quit

Enter Your Choice : 2

Deleted Data = computer

1) Enqueue

2) Dequeue

3) Print

4) Quit

Enter Your Choice : 2

Deleted Data = science

1) Enqueue

2) Dequeue

3) Print

4) Quit

Enter Your Choice : 2

Deleted Data = honours

1) Enqueue

2) Dequeue

3) Print

4) Quit

Enter Your Choice : 2

Queue is empty !!!!

Armstrong Number in C

What is Armstrong Number?

Armstrong number is a number that is equal of sum of cubed of its digits.

as a example - 153= 1³ + 5³ + 3³ =1+125+27=153

C Program to Print Pattern with star | Pyapiras

This a pattern... Print this using C language.

***

****

*****

****

***

Source Code:

#include<stdio.h>
int main(){
	int row,col,n;
	printf("~~~~~Thanks for visit browncodeit.blogspot.com~~~~~~~~~\n");
	printf("Enter the numebr: ");
	scanf("%d",&n);
	
	for(row=1;row<=n;row++){
		for(col=1;col<=row;col++){
			printf("*");
		}
		printf("\n");
	}
	for(row=n;row>=1;row--){
		for(col=1;col<row;col++){
			printf("*");
		}
		printf("\n");
	}
	return 0;
}

Output:

C Program to Print Pattern Solid Half Diamond

C program to print pattern like this in a different way just check out with Alphabet. First with row and second with column.

CCC

DDDD

EEEEE

ABCD

ABC

Source Code:

#include<stdio.h>
int main(){
int row,col,n;
printf("~~~~~Thanks for visit browncodeit.blogspot.com~~~~~~~~~\n");
printf("Enter the numebr: ");
scanf("%d",&n);
for(row=1;row<=n;row++){
for(col=1;col<=row;col++){
printf("%c",row+64);
}
printf("\n");
}
for(row=n;row>=1;row--){
for(col=1;col<row;col++){
printf("%c",col+64);
}
printf("\n");
}
return 0;
}

Output:

C Program to Print Pattern

This a pattern...

123

1234

12345

1234

123

Source Code:

#include<stdio.h>
int main(){
int row,col,n;
printf("~~~~~Thanks for visit browncodeit.blogspot.com~~~~~~~~~\n");
printf("Enter the numebr: ");
scanf("%d",&n);
for(row=1;row<=n;row++){
for(col=1;col<=row;col++){
printf("%d",col);
}
printf("\n");
}
for(row=n;row>=1;row--){
for(col=1;col<row;col++){
printf("%d",col);
}
printf("\n");
}
return 0;
}

Output:

C program to print love pattern | Heart pattern | Leave pattern | Pyapiras

This is a C program to print love pattern or Heart pattern or Leave pattern.

***** *****

******* *******

********* *********

*******************

*****************

***************

*************

***********

*********

*******

*****

***

Source Code:

#include <stdio.h>
int main()
{
int i, j, n;
//take input from user.
printf("Enter Row number : ");
scanf("%d", &n);
// up two side print
for(i=n/2;i<=n;i+=2)
{
for(j=1; j<n-i; j+=2)
{
printf(" ");
}
for(j=1; j<=i; j++)
{
printf("*");
}
for(j=1; j<=n-i; j++)
{
printf(" ");
}
for(j=1; j<=i; j++)
{
printf("*");
}
printf("\n");
}
// down portion print
for(i=n; i>=1; i--)
{
for(j=i; j<n; j++)
{
printf(" ");
}
for(j=1; j<=(i*2)-1; j++)
{
printf("*");
}
printf("\n");
}
return 0;
}

Output:

C Program to print Pyramid | Pyapiras

Problem: Write a c program to print Pyramid Patterns.

* * *

* * * * *

* * * * * * *

* * * * * * * * *

Source Code:

/*
* C Program to print full pyramid pattern using *
*/
#include<stdio.h>
#include<conio.h>
int main()
{
int row, space, rows, star=0;
printf("Enter the number of rows in pyramid\n");
scanf("%d",&rows);
for(row = 1;row <= rows; row++)
{
/* Printing spaces */
for(space = 1; space <= rows-row; space++)
{
printf(" ");
}
/* Printing stars */
while(star != (2*row - 1))
{
printf("* ");
star++;;
}
star=0;
printf("\n");
}
getch();
return 0;
}

Outputs:

C program to print Patterns

Problems: Write a C program to print Patterns Inverted Pyramid

*****

****

***

Source Code:

#include <stdio.h>
int main()
{
int i, j, n;
printf("Enter N: ");
scanf("%d", &n);
for (i=n;i>=1;i--)
{
for(j=1;j<=i;j++)
{
printf("*");
}
printf("\n");
}
return 0;
}

Output:

Pattern in C | Print half Pyramid

This is half pyramid different design.

Source Code:

#include <stdio.h>

int main()

{

int i, j, n;

printf("Enter N: ");

scanf("%d", &n);

for (i=1;i<=n;i++)

{

for(j=1;j<=(n-i);j++)

{

printf(" ");

}

for(j=1;j<=i;j++)

{

printf("*");

}

printf("\n");

}

Outputs:

Hello World Program in C | First Program in C

This is Hello World program using C.

Source Code:

#include<stdio.h>
int main()
{
printf("Hello BrownCodeIt!");
return 0;
}

Outputs:

Hello BrownCodeIt!

C program to print pattern | Half Pyramid

Write a C program to print number pattern. | Number increasing order | Half Pyramid with Number.

Source Code :

/**
* C program to print number pattern
*/
#include <stdio.h>
int main()
{
int i, j, N;
printf("Enter N: ");
scanf("%d", &N);
for(i=1; i<=N; i++)
{
// Logic to print numbers
for(j=1; j<=i; j++)
{
printf("%d", j);
}
printf("\n");
}
return 0;
}

Outputs:

Enter N: 10

123

1234

12345

123456

1234567

12345678

123456789

12345678910

Output 2:

C Program to print inverted half pyramid.

Write a C program to implement queue using linked list | Brown Cote It

This is a C program which implements queue using linklist.

Source Code:

#include<stdio.h>
#include<conio.h>
#include<malloc.h>
//A structure is created for the node in
queue

struct queu
{
int info;
struct queu *next;//Next node address
};
typedef struct queu *NODE;
//This function will push an element into
the queue

NODE push(NODE rear)
{
NODE NewNode;
//New node is created to push the data
NewNode=(NODE)malloc(sizeof(struct queu));
printf ("\nEnter the no to be pushed =
");

scanf ("%d",&NewNode->info);
NewNode->next=NULL;
//setting the rear pointer
if (rear != NULL)
rear->next=NewNode;
rear=NewNode;
return(rear);
}
//This function will pop the element from
the queue

NODE pop(NODE f,NODE r)
{
//The Queue is empty when the front pointer
is NULL

if(f==NULL)
printf ("\nThe Queue is empty");
else
{
printf ("\nThe poped element is =
%d",f->info);

if(f != r)
f=f->next;
else
f=NULL;
}
return(f);
}
//Function to display the element of the
queue

void traverse(NODE fr,NODE re)
{
//The queue is empty when the front pointer
is NULL

if (fr==NULL)
printf ("\nThe Queue is empty");
else
{
printf ("\nThe element(s) is/are =
");

while(fr != re)
{
printf("%d ",fr->info);
fr=fr->next;
};
printf ("%d",fr->info);
}
}
int main()
{
int choice;
char option;
//declaring the front and rear pointer
NODE front, rear;
//Initializing the front and rear pointer to
NULL

front = rear = NULL;
do
{
//clrscr();
printf ("1. Push\n");
printf ("2. Pop\n");
printf ("3. Traverse\n");
printf ("\n\nEnter your choice =
");

scanf ("%d",&choice);
switch(choice)
{
case 1:
//calling the push function
rear = push(rear);
if (front==NULL)
{
front=rear;
}
break;
case 2:
//calling the pop function by passing
//front and rear pointers
front = pop(front,rear);
if (front == NULL)
rear = NULL;
break;
case 3:
traverse(front,rear);
break;
}
printf ("\n\nPress (Y/y) to continue =
");

fflush(stdin);
scanf ("%c",&option);
}while(option == 'Y' || option == 'y');
}

Output:

1. Push

2. Pop

3. Traverse

Enter your choice = 1

Enter the no to be pushed = 14

Press (Y/y) to continue = Y

1. Push

2. Pop

3. Traverse

Enter your choice = 1

Enter the no to be pushed = 25

Press (Y/y) to continue = Y

1. Push

2. Pop

3. Traverse

Enter your choice = 1

Enter the no to be pushed = 36

Press (Y/y) to continue = Y

1. Push

2. Pop

3. Traverse

Enter your choice = 2

The poped element is = 14

Press (Y/y) to continue = Y

1. Push

2. Pop

3. Traverse

Enter your choice = 3

The element(s) is/are = 25 36

Press (Y/y) to continue = N

Write a program to implement “QUEUE” using array. || BrownCodeIt

Data structure definition:-

The data structure Node represents a single node in the linked list]

Structure Node

( data to hold the relevant data value in a Node,

next that holds the address of the next Node

)

Source Code:

#include<conio.h>
#include<stdio.h>
#define max 5
int queue[max],front=0,rear=0;
int menu();
void enqueue();
void dequeue();
void display();
void main()
{
int ch;
clrscr();
printf("\nQueues using Arrays\n");
do
{
    ch=menu();
    switch(ch)
    {
    case 1: enqueue();
    break;
    case 2: dequeue();
    break;
    case 3: display();
    break;
    case 4: exit();
    break;
    default:printf("\n Please enter a valid choice!!");
    }
}while(1);
}

int menu()
    {
    int ch;
    printf("\n1.ENQUEUE \n2.DEQUEUE \n3.DISPLAY \n4.EXIT");
    printf("\nEnter your Choice:");
    scanf("%d",&ch);
    return ch;
    }

void enqueue()
{
    int element;
    if(rear==max)
    {
        printf("\nOverflow!!");
    }
    else
    {
        printf("\nEnter Element:");
        scanf("%d",&element);
        queue[rear++]=element;
        printf("\n %d Enqueued at %d",element,rear);
    }

}

void dequeue()
{
    if(rear==front)
    {
        printf("\nUnderflow!!");
    }
    else
    {
        front++;
        printf("\nElement is Dequeued from %d",front);
   }
}
void display()
{
    int i;
    if(front==rear)
    {
        printf("\nQueue is Empty!!!");
    }
    else
    {
        printf(" \n");
        for(i=front;i<max;i++)
        {
            printf(" | %d ",queue[i]);
        }
            printf("|");
    }
}

Output:

Queues using Arrays

1.ENQUEUE
2.DEQUEUE
3.DISPLAY
4.EXIT
Enter your Choice:1

Enter Element:12

12 Enqueued at 1
1.ENQUEUE
2.DEQUEUE
3.DISPLAY
4.EXIT
Enter your Choice:1

Enter Element:23

23 Enqueued at 2
1.ENQUEUE
2.DEQUEUE
3.DISPLAY
4.EXIT
Enter your Choice:
23 Enqueued at 2
1.ENQUEUE
2.DEQUEUE
3.DISPLAY
4.EXIT
Enter your Choice:1

Enter Element:34

34 Enqueued at 3
1.ENQUEUE
2.DEQUEUE
3.DISPLAY
4.EXIT
Enter your Choice:1

Enter Element:45

45 Enqueued at 4
1.ENQUEUE
2.DEQUEUE
3.DISPLAY
4.EXIT
Enter your Choice:1

Enter Element:56

56 Enqueued at 5
1.ENQUEUE
2.DEQUEUE
3.DISPLAY
4.EXIT
Enter your Choice:2

Element is Dequeued from 1
1.ENQUEUE
2.DEQUEUE
3.DISPLAY
4.EXIT
Enter your Choice:2

Element is Dequeued from 2
1.ENQUEUE
2.DEQUEUE
3.DISPLAY
4.EXIT
Enter your Choice:3

| 34 | 45 | 56 |
1.ENQUEUE
2.DEQUEUE
3.DISPLAY
4.EXIT
Enter your Choice: 4

Write a C program to implement stack using linked list

DATA STRUCTURE DEFINITION

_____________________________________________________________________

NODE: Data {To store data in the Node}

Next {To store link of the next Node}

_____________________________________________________________________

Source Code:

#include <stdio.h>
#include <stdlib.h>
struct stack
{
int data;
struct node *next;
};
typedef struct stack stack;
void push(int data);
int pop();
void display();
int top=0,size;
stack *head=NULL;
void main()
{
int no,ch,e,r;
printf("\nEnter the size of stack ");
scanf("%d", &size);
printf("\n 1 - Push");
printf("\n 2 - Pop");
printf("\n 3 - Dipslay");
printf("\n 0 - Exit");
do
{
printf("\n Enter choice : ");
scanf("%d", &ch);
switch (ch)
{
case 0:
break;
case 1:
printf("\nEnter data : ");
scanf("%d", &no);
push(no);
break;
case 2:
r=pop();
printf("\n%d popped",r);
break;
case 3:
display();
break;
default :
printf(" Wrong choice, Please enter correct choice ");
break;
}
}while(ch!=0);
}
void push(int v)
{
if(top<size){
stack *new_node;
new_node=(stack*)malloc(sizeof(stack));
new_node->data=v;
new_node->next=NULL;
if(head==NULL)
head=new_node;
else
{
new_node->next=head;
head=new_node;
}
top++;
}
else
printf("\nStack is full!");
}
int pop()
{
stack *tmp;
int v;
if(top>=1)
{
tmp=head;
head=head->next;
v=tmp->data;
free(tmp);
top--;
}
else
v=-999;
return v;
}
void display()
{
stack *p;
p=head;
if(p!=NULL)
{
printf("\nLinked List\n");
while(p!=NULL)
{
printf("%d ",p->data);
p=p->next;
}
}
}

Output:

Enter the size of stack 8

1 - Push

2 - Pop

3 - Dipslay

4 - Exit

Enter choice : 1

Enter data : 33

Enter choice : 1

Enter data : 65

Enter choice : 1

Enter data : 22

Enter choice : 1

Enter data : 77

Enter choice : 2

77 popped

Enter choice : 3

Linked List

22 65 33

Enter choice : 4

Problems: Write a C program to implement a circular queue that contains a list of names.

Source Code:

Output:

Source Code:

Output:

Source Code:

Output:

Source Code:

Output:

Source Code:

Output:

Source Code:

Outputs:

Source Code:

Outputs:

Source Code :

Outputs:

C Program to print inverted half pyramid.

Source Code:

Output:

Source Code:

Popular Posts

Topics