PRACTICAL FILE – DATA STRUCTURES

UNIVERSITY INSTITUTE OF ENGINEERING AND TECHNOLOGY,

KURUKSHETRA UNIVERSITY,
KURUKSHETRA
(SESSION: 2022-2026)

SUBMITTED TO: SUBMITTED BY:

Mr. VIJAY PREETI
252202060
CSE-A 3RD Sem
 PROGRAM 1

Q1. Write a program for Binary search methods.

Source code:
#include<iostream>
using namespace std;
int binarySearch( int array[], int x, int low, int high){
while(low<=high){
int mid= low + (high-low)/2;
if( array[mid]==x)
return mid;
if (array[mid]<x)
low= mid+1;
else
high=mid-1;
}
return -1;
}
int main(void){
int array[7];
cout<<"Enter the elements of a sorted array:";
for(int i=0;i<7;i++){
cin>>array[i];
}
int x;
cout<<endl<<"Enter the number to be searched:";
cin>>x;
int n = sizeof(array)/sizeof(array[0]);
int result= binarySearch(array,x,0,n-1);
if(result == -1)
 cout<<endl<<"Not found";
else
cout<<"Element is found at index"<<result;
}
Output:
 PROGRAM 2

Q2. Write a program for insertion sort, selection sort, and bubble sort.
Source code:
Insertion Sort-
#include<iostream>
using namespace std;
void printArray(int *array, int size){
for(int i=0; i<size; i++)
cout<<array[i]<<" ";
cout<<endl;
}
void insertionSort(int array[], int size)
{
for(int step = 1; step<size; step++)
{
int key = array[step];
int j = step-1;
while(key<array[j] && j>=0)
{
array[j+1] = array[j];
--j;
}
array[j+1] = key;
}
}
int main(){
int data[]= {30,20,40,70,10,60,50};
int size = sizeof(data)/sizeof(data[0]);
insertionSort(data,size);
cout<<"Sorted array in ascending order (by Insertion Sort):\n";
printArray(data,size);
}
Output:
Source Code:
Selection sort-
#include<iostream>
using namespace std;
void swap(int *a, int *b){
int temp= *a;
*a = *b;
*b = temp;
}

void printArray(int array[], int size)

{
for(int i=0; i<size; i++){
cout<<array[i]<<" ";}
cout<<endl;
}
void selectionSort(int array[],int size){
for(int step = 0; step<size-1; step++){
int min_idx = step;
for(int i = step+1; i<size; i++){
if (array[i]<array[min_idx])
min_idx = i;
}
swap(&array[min_idx], &array[step]);
}
}
int main()
{
int data[] = {89,23,56,14,69,47};
int size= sizeof(data)/sizeof(data[0]);
 selectionSort(data,size);
cout<<"Sorted array in Ascending Order (by Selection Sort):\n";
printArray(data,size);
}
Output:
Source Code:
Bubble sort-
#include<iostream>
using namespace std;
void bubbleSort(int array[], int size)
{
for(int step = 0; step<size-1; step++)
{
for(int i=0; i<size-step-1; i++){
if (array[i]>array[i+1])
{
int temp = array[i];
array[i]= array[i+1];
array[i+1] = temp;
}
}
}
}

void printArray(int array[], int size)

{
for(int i=0; i<size; i++){
cout<<" "<<array[i];
}
cout<<"\n";
}
int main()
{
int data[] = {-15,17,91,3,82,-27};
 int size = sizeof(data)/sizeof(data[0]);

bubbleSort(data,size);
cout<<"Sorted Array in Ascending Order(bu Bubble Sort):\n";
printArray(data,size);
}
Output:
 PROGRAM 3

Q3 Write a program to implement Stack and its operation.

Source Code:
#include<iostream>
#include<stack>
using namespace std;
int main()
{
stack<int> stack;
stack.push(4);
stack.push(9);
stack.push(18);
stack.push(12);
stack.push(13);
stack.push(30);
stack.push(1);
stack.pop();
stack.pop();

while(!stack.empty()){
cout<<stack.top()<<" ";
stack.pop();
}
}
Output:
 PROGRAM 4

Q4. Write a program for quick sort.

Source Code:
#include<iostream>
using namespace std;
void swap(int *a, int *b)
{ int t = *a;
*a = *b;
*b = t; }
void printArray(int array[], int size)
{ int i;
for(i=0;i<size;i++)
cout<<array[i]<<" ";
cout<<endl; }
int partition(int array[], int low, int high)
{ int pivot = array[high];
int i = (low-1);
for(int j=low; j<high; j++)
{ if(array[j]<=pivot)
{ i++;
swap(&array[i], &array[j]); }
}
swap(&array[i+1], &array[high]);
return(i+1); }
void quickSort(int array[],int low, int high)
{ if(low<high)
{ int pi = partition(array,low,high);
quickSort(array, low, pi-1);
quickSort(array, pi+1, high); }
}
int main()
{
int data[] = { 15,18,5,29,6,98,49};
int n = sizeof(data)/sizeof(data[0]);
cout<<"Unsorted Array: \n";
printArray(data, n);
quickSort(data, 0, n-1);
cout<<"Sorted array in ascending order: \n";
printArray(data, n);
}
Output:
 PROGRAM 5

Q5. Write a program for merge sort.

Source Code:
#include<iostream>
using namespace std;
void merge(int arr[],int p,int q, int r)
{
int n1= q-p+1;
int n2= r-q;
int L[n1],M[n2];

for(int i=0;i<n1;i++)
L[i] = arr[p+i];
for(int j=0;j<n2;j++)
M[j] = arr[q+1+j];

int i,j,k;
i = 0;
j = 0;
k = p;

while(i<n1 && j<n2)

{
if(L[i] <= M[j]){
arr[k] = L[i];
i++;
}
else{
 arr[k] = M[j];
j++;
}
k++;
}
while(i<n1)
{
arr[k]= L[i];
i++;
k++;
}
while(j<n2)
{
arr[k]=M[j];
j++;
k++;
}
}

void mergeSort(int arr[], int l, int r)

{
if(l<r)
{
int m = l+ (r-l)/2;
mergeSort(arr,l,m);
mergeSort(arr,m+1,r);
merge(arr,l,m,r);
}
}
void printArray(int arr[], int size)
{
for(int i=0; i<size; i++)
cout<<arr[i]<<" ";
cout<<endl;
}
int main()
{
int arr[] = { 1000,466,288,256,19,678,987};
int size = sizeof(arr)/sizeof(arr[0]);
mergeSort(arr,0,size-1);
cout<<"Sorted array:\n";
printArray(arr,size);
return 0;
}
Output:
 PROGRAM 6

Q6. Write a program to understand Queue and its operation.

Source Code:
#include<iostream>
#include<queue>
using namespace std;
void display_queue(queue<string>q)
{
while(!q.empty()){
cout<<q.front()<<",";
q.pop();
}
cout<<endl;
}
int main() {
queue<string>birds;
birds.push("Sparrow");
birds.push("Cuckoo");
birds.push("Humming bird");
birds.push("Woodpecker");
cout<<"Initial Queue: ";
display_queue(birds);
birds.pop();
birds.pop();
cout<<"Final Queue: ";
display_queue(birds);
return 0;
}
Output:
 PROGRAM 7

Q7. Write a program to implement circular queue and its operation.

Source Code:
#include<iostream>
using namespace std;
class Queue
{
int rear,front;
int size;
int *arr;
public:
Queue(int s)
{
front = rear = -1;
size = s;
arr = new int[s];
}
void enQueue(int value);
int deQueue();
void displayQueue();
};
void Queue::enQueue(int value)
{
if((front == 0 && rear == size-1)|| (rear == (front-1)%(size-1)))
{
cout<<"\nQueue is Full";
}
else if(front == -1)
{
 front = rear = 0;
arr[rear] = value;
}
else if(rear == size-1 && front != 0)
{
rear = 0;
arr[rear] = value;
}
else
{
rear++;
arr[rear] = value;
}
}
int Queue::deQueue()
{
if(front == -1)
{
cout<<"\nQueue is Empty";
return INT_MIN;
}
int data = arr[front];
arr[front] = -1;
if(front == rear)
{
front = -1;
rear = -1;
}
else if(front == size-1)
front = 0;
 else
front++;
return data;
}

void Queue::displayQueue()
{
if(front == -1)
{
cout<<"\nQueue is Empty";
}
cout<<"\nElements in Circular Queue are:";
if(rear>=front)
{
for(int i=front; i<=rear; i++)
cout<<arr[i]<<" ";
}
else
{
for(int i=front;i<size;i++)
cout<<arr[i]<<" ";
for(int i=0; i<=rear; i++)
cout<<arr[i]<<" ";
}
}
int main()
{
Queue q(4);
q.enQueue(18);
q.enQueue(22);
 q.enQueue(26);
q.enQueue(40);
q.displayQueue();
cout<<"\nDeleted value = "<<q.deQueue();
q.displayQueue();
q.enQueue(-44);
q.displayQueue();
q.enQueue(48);
return 0;
}
Output: