ALM-4

REG NO:2100030612
NAME:Y.MAHIMA
ROLL NO:48
1. Given an array arr[] of 10 elements, Develop a C function code to
search for a given element x in arr[] by using linear search and show
index position of x as an output.

#include<stdio.h>
int search(int arr[], int n, int x)
{
int i;
for (i = 0; i < n; i++)
if (arr[i] == x)
return i;
return -1;
}
int main(void)
{
int arr[] = { 2, 3, 4, 10, 40 };
int x = 10;
int n = sizeof(arr) / sizeof(arr[0]);
int result = search(arr, n, x);
if(result==-1)
printf("Element is not present in array");
else
printf("Element is present at index %d", result);
return 0;
}
OUTPUT:

4. Define a structure named as Queue. Define the operation such as Enqueue(

), Dequeue( ) and Display( ) to insert an element, to delete an element and to
display the element in the Queue. Develop a menu driven program perform
the above operations on a Queue.

Ans;
Enqueue();
Putting items in queue is called enqueue
Dequeue();
Removing items from the queue is called dequeue.
Program:
#include <stdio.h>
void enqueue();
void dequeue();
void display();
int queue[10],front,rear,i,choice,n=10;
int main()
{
printf ("*#* ARRAY IMPLEMENTATION USING QUEUE *#*\n");
front=-1;
 rear=-1;
while(1)
{
printf("\nMENU\n");
printf("----\n");
printf("1.Enqueue\n2.Dequeue\n3.Display\n");
printf("Enter your choice:");
scanf("%d",&choice);
switch(choice)
{
case 1: enqueue();
break;
case 2: dequeue();
break;
case 3: display();
break;
default:printf("Sorry, invalid choice!\n");
break;
}
}
}
void enqueue()
{
int element;
if(rear==n-1)
printf("Queue is full");
else{
printf("Enter the element to be inserted:");
scanf("%d",&element);
if(front==-1)
front++;
rear++;
queue[rear]=element;
printf("\nElement is inserted\n");
}
}
void dequeue()
{
if(front==-1 || front>rear)
printf("Stack is empty\n");
else{
printf("%d deleted ",queue[front]);
front++;
 }
}
void display()
{
if(front==-1 || rear==-1)
printf("Stack is empty");
else
for(i=front;i<=rear;i++){
printf("%d ",queue[i]);
}
}

Output:

2.
#include<stdio.h>
int main()
{
int n;
printf("enter no of token number ");
scanf("%d",&n);
int a[n];
int i;
for(i=0;i<n;i++)
{
printf("enter token number");
scanf("%d",&a[i]);
}
for(i=0;i<n;i++)
{
if(a[i]%2==0)
printf("meet Diwakar\n");
 else
printf("meet amrutha\n");
Output:
3.
#include<stdio.h>
struct details
{
long int studentnumber;
char studentname[20];
char branch[10];
int year;
int feedisplay;
};
int main()
{
int n;
printf("enter n value");
scanf("%d",&n);
struct details s[n];
int i;
for(i=0;i<n;i++)
{
printf("enter student number ");
scanf("%ld",&s[i].studentnumber);
printf("enter student name ");
scanf("%s",s[i].studentname);
printf("enter student branch ");
scanf("%s",s[i].branch);
printf("student year");
scanf("%d",&s[i].year);
printf("enter student fee ");
scanf("%d",&s[i].feedisplay);
}
for(i=0;i<n;i++)
{
printf("%ld\t",s[i].studentnumber);
printf("%s\t",s[i].studentname);
printf("%s\t",s[i].branch);
printf("%d\t",s[i].year);
printf("%d\n",s[i].feedisplay);
}
return 0;
Output: