Program 1 // Library Book Management System #include <iostream> #include <string> using namespace std; struct Book { int id; string title; string author; Book* prev; Book* next; }; class Library { private: Book* head;...
Program 1 #include<iostream> #include<stdio.h> #define clrscr() system(“cls”) using namespace std; #define MAXSIZE 10 int dqueue[MAXSIZE]; int front=-1,rear=-1; void insertFront(); void insertRear(); void deleteFront(); void deleteRear(); void display(); int main() { int choice; do {...
Program 1 // Program to Convert infix to Postfix #include<iostream> #include<ctype.h> #define clrscr() system(“cls”) using namespace std; char stack[50]; int top = -1; void push(char ch) { stack[++top] = ch; } char pop() {...
Program 1 // Program for Quick Sort #include<stdio.h> #include<conio.h> #include<iostream> #define clrscr() system(“cls”) using namespace std; void quick_sort(int ar[],int l ,int h); int main() { clrscr(); int ar[500],n,low,high; int i; xyz:cout<<“\nEnter the limit”; cin>>n;...
Program 1 // Program for Queue LinkedList #include<iostream> #include<stdio.h> #define clrscr() system(“cls”) using namespace std; class node { public: int data; node *add; }; node *start=NULL,*new1,*temp,*rear,*front; void create(); void insert(); void delete1(); void display();...
Program 1 #include<iostream> #define clrscr() system(“cls”) using namespace std; int main() { int a[500],n,i,j,gap,temp; clrscr(); xyz:cout<<“\nEnter the limit of array”; cin>>n; if(n>500) { cout<<“\nInvalid limit enter again”; goto xyz; } else { cout<<“Enter elements...
Program 1 // Program for Merge Sort #include<iostream> #define clrscr() system(“cls”) using namespace std; void abc(int []); int main() { int a[500],b[500],c[1000],m,n,i,j,temp,k; clrscr(); again: cout<<“\nEnter limit of first array\n”; cin>>m; if(m>500) { cout<<“\nInvalid limit...
Program 1 //Program for Selection sort #include<iostream> #define clrscr() system(“cls”) using namespace std; class Sort { public: void selectionsort(int ar[],int n) { int i,temp,j,min,loc; for(i=0;i<n;i++) { min=ar[i]; loc=i; for(j=i+1;j<n;j++) { if(ar[j]<min) { min=ar[j]; loc=j;...
Program 1 // Program for Bubble sort #include<iostream> #define clrscr() system(“cls”) using namespace std; class Sort { public: void bubblesort(int ar[],int n) { int i,j,temp; for(i=0;i<n-1;i++) { for(j=0;j<n-i-1;j++) { if(ar[j]>ar[j+1]) { temp=ar[j]; ar[j]=ar[j+1]; ar[j+1]=temp;...
Program 1 // Program for linear sort #include<iostream> #define clrscr() system(“cls”) using namespace std; class Sort { public: void sort(int ar[],int n) { int i,j,temp; for(i=0;i<n;i++) { for(j=i+1;j<n;j++) { if(ar[j]<ar[i]) { temp=ar[i]; ar[i]=ar[j]; ar[j]=temp;...
