WAP to insert, delete and traverse a queue

#include<iostream.h> #include<conio.h> void main() {   clrscr();   int queue[10],front=0,rear=0,n,item,ch;   char ...

Read More

WAP to insert a new element in an array

#include<iostream.h> #include<conio.h> void main() { clrscr(); int a[10],i,n,x,y; cout<<"enter the no. ...

Read More

WAP to find the location of an element of an array

#include<iostream.h> #include<conio.h> void main() { clrscr(); int a[10],i,n,x; cout<<"enter the no. of...

Read More

WAP to display elements of an array

#include<iostream.h> #include<conio.h> void main() {                        int a[10],i,n; cout<<"enter t...

Read More

WAP to delete an element from an array

#include<iostream.h> #include<conio.h> void main() { clrscr(); int a[100],i,n,x; cout<<"enter the no. o...

Read More

WAP to search an element from a linked list

#include<iostream.h> #include<conio.h> #include<process.h> class node {                 public:             ...

Read More

WAP to delete a node from a given location in linked list

#include<conio.h> #include<iostream.h> struct node { int data; node *next; }*p,*start,*save,*loc,*locp; int find...

Read More

WAP to delete a node from the beginning of the linked list

#include<iostream.h> #include<conio.h> class node {                      public: char data; node *next; }; v...

Read More

WAP to insert an element at any location in linked list

#include<iostream.h> #include<conio.h> class node {                      public: char data; node *next; }; v...

Read More

WAP to insert an element in the beginning of linked list

#include<iostream.h> #include<conio.h> class node {                 public:                                 int data...

Read More

WAP to create and traverse a linked list

#include<iostream.h> #include<conio.h> class node { public:   int data;   node *next;   }; void main() {   n...

Read More

WAP to sort an array using Quick Sort

#include <iostream.h> #include <conio.h> void main() {  void srt(int[],int,int);  int a[10],count=0,n,i;  clrscr()...

Read More

WAP to sort an array using selection sort

#include <iostream.h> #include <conio.h> #define MAX 10 class selsort {     int arr[MAX],n;     public:     vo...

Read More

WAP to search an element in array using binary search

#include<iostream.h> #include<conio.h> void main() { clrscr(); int a[100],n,i,j,item,temp;

Read More

WAP to sort the elements of linear array using bubble sort

#include<iostream.h> #include<conio.h> void main() {                clrscr(); int a[100],n,i,j,item,temp; cout<...

Read More

WAP to display Hello World in C++

#include <iostream.h> #include <conio.h> void main() { clrscr(); cout<<"Hello World" ; getch(); } ...

Read More