EX.

NO: 1 Sum of individual digits

DATE:

#include<stdio.h>

int main() {

long int num;

int sum = 0, rem;

printf("Enter a number: ");

scanf("%ld", &num);

while(num / 10 != 0)

sum = 0;

while(num != 0)

rem = num % 10; // get the last digit of num

sum += rem; // add rem to sum

num = num / 10; // remove the last digit

num = sum;

printf("%d", sum);

return 0;
}
Expected Output:

1st run:

Enter a number: 12345

2nd run:

Enter a number: 749

EX.NO: 2 Student marks details

DATE:

#include<stdio.
h>
#include<conio.h>
main()
{
int s1,s2,s3;
printf("Enter marks of
sub1,sub2,sub3");
scanf("%d%d%d",&s1,&s2,&s3);
if(s1>40 && s2>40 && s3>40)
{
printf("Pass");
}
else
{
printf("Fail");
}
}
OUTPUT:

EX.NO :3
Generating n prime numbers
DATE:

#include<stdio.h>

void main()

int i,j,n;

printf("Enter the number till which you want prime

scanf("%d",&n);

printf("Prime numbers are:-\n");

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

int c=0;

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

{
 if(i%j==0)

c++;

if(c==2)

printf("%d ",i);

Output
EX.NO:4 Stack using array implementation

DATE:

#include <limits.h>

#include <stdio.h>

#include <stdlib.h>

#define MAX_SIZE 100

// A structure to represent a stack

struct Stack {

int top;

int capacity;

int* array;

};

// Function to create a stack of given capacity. It

// initializes size of stack as 0

struct Stack* createStack(unsigned capacity)

struct Stack* stack

= (struct Stack*)malloc(sizeof(struct Stack));

stack->capacity = capacity;

stack->top = -1;

stack->array
 = (int*)malloc(stack->capacity * sizeof(int));

return stack;

int isFull(struct Stack* stack)

return stack->top == stack->capacity - 1;

// Stack is empty when top is equal to -1

int isEmpty(struct Stack* stack)

return stack->top == -1;

void push(struct Stack* stack, int item)

if (isFull(stack)) {

printf("Overflow\n");

return;

stack->array[++stack->top] = item;

printf("%d pushed to stack\n", item);

int pop(struct Stack* stack)

{
 if (isEmpty(stack)) {

printf("Underflow\n");

return INT_MIN;

return stack->array[stack->top--];

int peek(struct Stack* stack)

if (isEmpty(stack)) {

printf("Stack is empty\n");

return INT_MIN;

return stack->array[stack->top];

void display(struct Stack* stack)

if (isEmpty(stack)) {

printf("Stack is empty\n");

else {

for (int i = stack->top; i >= 0; i--) {

printf("%d\n", stack->array[i]);

}
 }

int main()

struct Stack* stack = createStack(100);

push(stack, 1);

push(stack, 2);

push(stack, 3);

printf("%d popped from stack\n", pop(stack));

printf("Top element is %d\n", peek(stack));

printf("Elements present in stack:\n");

display(stack);

return 0;

Output
1 pushed to stack
2 pushed to stack
3 pushed to stack
3 popped from stack
Top element is 2
Elements present in stack:
2
1
EX.NO: Menu-driven option for queue OPERATIONS

DATE:

#include<stdio.h>

#include<stdlib.h>

#define MAX 10

int queue_arr[MAX];

int rear=-1;

int front=-1;

void insert(int item);

int del();

int peek();

void display();

int isFull();

int isEmpty();

int main()

int choice,item;

while(1)

{
 printf("\n1.Insert\n");

printf("2.Delete\n");

printf("3.Display element at the front\

printf("4.Display all elements of the

printf("5.Quit\n");

printf("\nEnter your choice : ");

scanf("%d",&choice);

switch(choice)

case 1:

printf("\nInput the element for

scanf("%d",&item);

insert(item);

break;

case 2:

item=del();

printf("\nDeleted element is %d\

break;
 case 3:

printf("\nElement at the front is

break;

case 4:

display();

break;

case 5:

exit(1);

default:

printf("\nWrong choice\n");

}/*End of switch*/

}/*End of while*/

return 0;

}/*End of main()*/

void insert(int item)

if( isFull() )

{
 printf("\nQueue Overflow\n");

return;

if( front == -1 )

front=0;

rear=rear+1;

queue_arr[rear]=item ;

}/*End of insert()*/

int del()

int item;

if( isEmpty() )

printf("\nQueue Underflow\n");

exit(1);

item=queue_arr[front];

front=front+1;

return item;

}/*End of del()*/
int peek()

if( isEmpty() )

printf("\nQueue Underflow\n");

exit(1);

return queue_arr[front];

}/*End of peek()*/

int isEmpty()

if( front==-1 || front==rear+1 )

return 1;

else

return 0;

}/*End of isEmpty()*/

int isFull()

{
 if( rear==MAX-1 )

return 1;

else

return 0;

}/*End of isFull()*/

void display()

int i;

if ( isEmpty() )

printf("\nQueue is empty\n");

return;

printf("\nQueue is :\n\n");

for(i=front;i<=rear;i++)

printf("%d ",queue_arr[i]);

printf("\n\n");

OUTPUT : :

1.Insert
2.Delete

3.Display element at the front

4.Display all elements of the queue

5.Quit

Enter your choice : 1

Input the element for adding in queue : 1

1.Insert

2.Delete

3.Display element at the front

4.Display all elements of the queue

5.Quit

Enter your choice : 1

Input the element for adding in queue : 2

1.Insert

2.Delete

3.Display element at the front

4.Display all elements of the queue

5.Quit

Enter your choice : 1

Input the element for adding in queue : 3

1.Insert
2.Delete

3.Display element at the front

4.Display all elements of the queue

5.Quit

Enter your choice : 1

Input the element for adding in queue : 4

1.Insert

2.Delete

3.Display element at the front

4.Display all elements of the queue

5.Quit

Enter your choice : 4

Queue is :

1 2 3 4

1.Insert

2.Delete

3.Display element at the front

4.Display all elements of the queue

5.Quit

Enter your choice : 3

Element at the front is 1

2.Delete

3.Display element at the front

4.Display all elements of the queue

5.Quit

Enter your choice : 2

Deleted element is 1

1.Insert

2.Delete

3.Display element at the front

4.Display all elements of the queue

5.Quit

Enter your choice : 2

Deleted element is 2

1.Insert

2.Delete

3.Display element at the front

4.Display all elements of the queue

5.Quit

Enter your choice : 2

Deleted element is 3
1.Insert

2.Delete

3.Display element at the front

4.Display all elements of the queue

5.Quit

Enter your choice : 2

Deleted element is 4

1.Insert

2.Delete

3.Display element at the front

4.Display all elements of the queue

5.Quit

Enter your choice : 2

Queue Underflow

EX .NO: PALINDROME

DATE:

#include <stdio.h>

void isPalindrome(char* string)

char *ptr, *rev;

while (*ptr != '\0') {

++ptr;

--ptr;

for (rev = string; ptr >= rev;) {

if (*ptr == *rev) {

--ptr;

rev++;

else

break;

if (rev > ptr)

printf("String is Palindrome");

else

printf("String is not a Palindrome");

int main()

{
 char str[1000] = "madam";

isPalindrome(str);

return 0;

Output

String is Palindrome