electrofriends.com > C Programs

C Program for Simple DSC order Priority QUEUE Implementation using Structure

Saturday, June 9th, 2012  »  Posted By  »  Total 0 Comment

C Program for Simple DSC order Priority QUEUE Implementation using Structure. Source: Dr. G T Raju, Professor & Head, Dept. of CSE, RNSIT 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 [...]

C Program to convert Prefix Expression into INFIX

Saturday, June 9th, 2012  »  Posted By  »  Total 1 Comment

C Program to convert Prefix Expression into INFIX. Source: Dr. G T Raju, Professor & Head, Dept. of CSE, RNSIT 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 [...]

C Program for Infix to Prefix Conversion

Saturday, June 9th, 2012  »  Posted By  »  Total 2 Comments

C Program for Infix to Prefix Conversion. Source: Dr. G T Raju, Professor & Head, Dept. of CSE, RNSIT 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 [...]

What is EMBEDDED SYSTEMS

Thursday, February 17th, 2011  »  Posted By  »  Total 2 Comments

Embed means hidden , Similar word :Small Glass planes are embeded over the compound walls. But coming to electronics, this is a electronic system which is hidden inside a device ,whose identity is not shown to the outside world,and involve in a perticular single application. May be from remote controller to spaceship. Everywhere we see [...]

C++ program to implement stack using Linked List

Thursday, February 3rd, 2011  »  Posted By  »  Total 1 Comment

#include <iostream.h> template<class T> class Node { friend LinkedStack<T>; private: T data; Node<T> *link; }; template<class T> class LinkedStack { public: LinkedStack() {top = 0;} ~LinkedStack(); int IsEmpty() const {return top == 0;} T Top() const; LinkedStack<T>& Add(const T& x); LinkedStack<T>& Delete(T& x); private: Node<T> *top; }; template<class T> LinkedStack<T>::~LinkedStack() {// Stack destructor.. Node<T> *next; [...]

C++ program to implement Stack using Formula Based Representation

Thursday, February 3rd, 2011  »  Posted By  »  Total 1 Comment

#include<iostream.h> #include<constream.h> template<class T> class Stack { public: Stack(int MaxStackSize); ~Stack(){delete[] S;} int IsEmpty()const{return top==-1;} int IsFull()const{return top==MaxTop;} T Peek()const; void Push(T); T Pop(); void Display(); private: int top; //current top of stack int MaxTop; //max val for top T *S; //element array }; template<class T> Stack<T>::Stack(int MaxStackSize) { //stack constructor MaxTop=MaxStackSize-1; S=new T[MaxStackSize]; top=-1; [...]

C++ program to multiply two polynomials maintained as linked lists

Thursday, February 3rd, 2011  »  Posted By  »  Total 4 Comments

#include <iostream.h> class poly { private : struct polynode { float coeff ; int exp ; polynode *link ; } *p ; public : poly( ) ; void poly_append ( float c, int e ) ; void display_poly( ) ; void poly_multiply ( poly &p1, poly &p2 ) ; void padd ( float c, int [...]

C++ program to add two polynomials maintained using Linked Lists

Thursday, February 3rd, 2011  »  Posted By  »  Total 4 Comments

#include <iostream.h> class poly { private : struct polynode { float coeff ; int exp ; polynode *link ; } *p ; public : poly( ) ; void poly_append ( float c, int e ) ; void display_poly( ) ; void poly_add( poly &l1, poly &l2 ) ; ~poly( ) ; } ; poly :: [...]

C++ program to implement B-Trees

Wednesday, February 2nd, 2011  »  Posted By  »  Total 17 Comments

#include <iostream.h> #include <stdlib.h> #include <alloc.h> const int MAX = 4 ; const int MIN = 2 ; struct btnode { int count ; int value[MAX + 1] ; btnode *child[MAX + 1] ; } ; class btree { private : btnode *root ; public : btree( ) ; void insert ( int val ) [...]

C++ program to implement AVL Tree & its Operations

Wednesday, February 2nd, 2011  »  Posted By  »  Total 6 Comments

#include <iostream.h> #include <stdlib.h> #include<constream.h> #define FALSE 0 #define TRUE 1 struct AVLNode { int data ; int balfact ; AVLNode *left ; AVLNode *right ; } ;   class avltree { private : AVLNode *root ; public : avltree( ) ; AVLNode* insert ( int data, int *h ) ; static AVLNode* buildtree ( [...]

Pages:12345»
Question and Answer
C/C++ Unix & Linux Wordpress
Source codes
C C++ Java

Free email signup

Email: