No one has voted on any posts yet. Votes from other community members are used to determine a member's reputation amongst their peers.
|
[CODE]#include<iostream.h> #include<conio.h> #include<process.h> const int max=5; class stack { int s[max]; int top; int temp; public: stack (int j,int p){top=j;temp=p;} void push(int item); void pop(); void display(); }; void stack::push(int item) { if(top<4) { top++; s[top]=item; } else { cout<<"\nStack is full!"; } } void stack::pop() { if(top>-1) { cout<<"\nThe … 
|
|
|
#include<iostream.h> #include<conio.h> #include<process.h> const int max=5; class stack { int s[max]; int top; int temp; public: stack (int j,int p){top=j;temp=p;} void push(int item); void pop(); void display(); }; void stack::push(int item) { if(top<4) { top++; s[top]=item; } else { cout<<"\nStack is full!"; } } void stack::pop() { if(top>-1) { cout<<"\nThe … 
|
|
|
[code=cplusplus] #include<iostream.h> #include<conio.h> #include<process.h> const int max=5; class queue { int r; int f; int q[max]; int temp; public: queue(int l,int m,int p){r=l;f=m;temp=p;} void insertrear(int item); void deletefront(); void display(); }; void queue::insertrear(int item) { if(r<(max-1)) { r++; q[r]=item; } else { cout<<"\nQ is full"<<endl; } } void queue::deletefront() { … 
|
|
|
can anyone write a program tofind sum of 2 numbers using friend function and programti implement digital clock
|
|
|
Hello can some one say how to use tracing in turbo c and to show the trace like we do manully is their any function how do watch options work plz say me i am a student and beginner in c guys help me experts professional and any one plz
|