c programs | Student Projects

What are C Tokens?

Chitra — Tue, 03 Jun 2014 08:33:18 +0000

C programs contains many elements which are identified by the compiler as Tokens.
Tokens can be categorized as
1. Keywords
2. Variables
3. Constants
4. Special characters
5. Operators

C Token example program:

int main()
{
 int x, y, sum;
 x = 5, y = 10;
 sum = x + y;
 Printf (“Sum = %d \n”, sum);
}

From above program C Tokens can be categorized as follows,
main – identifier, which is usually used by linker as the entry point of the regular program
{,}, (,) – delimiter
int – keyword
x, y, sum – Variables
+, = – Operators
main, {, }, (, ), int, x, y, sum – tokens

The post What are C Tokens? first appeared on Student Projects.

C program to insert Student Records to a Sequential File

Ansten Lobo — Sat, 09 Jun 2012 11:41:46 +0000

Source: Dr. G T Raju, Professor & Head, Dept. of CSE, RNSIT

#include 
typedef struct
{
    int usn;
    char name[25];
    int m1,m2,m3;
}STD;
STD s;
void display(FILE *);
int search(FILE *,int);
void main()
{
    int i,n,usn_key,opn;
    FILE *fp;
    printf(" How many Records ? ");
    scanf("%d",&n);
    fp=fopen("stud.dat","w");
    for(i=0;iThe post C program to insert Student Records to a Sequential File first appeared on Student Projects.

C program to implement queue operations

Drithi — Tue, 05 Jun 2012 09:43:43 +0000

Below is the C program to implement various queue operations,

#include
#include
#define max 5
int q[10],front=0,rear=-1;
void main()
{
    int ch;
    void insert();
    void delet();
    void display();
    clrscr();
    printf("\nQueue operations\n");
    printf("1.insert\n2.delete\n3.display\n4.exit\n");
    while(1)
    {
        printf("Enter your choice:");
        scanf("%d",&ch);
        switch(ch)
        {
        case 1: insert();
            break;
        case 2: delet();
            break;
        case 3:display();
            break;
        case 4:exit();
        default:printf("Invalid option\n");
        }
    }
}

void insert()
{
    int x;
    if(rear==max-1)
        printf("Queue is overflow\n");
    else
    {
        printf("Enter element to be insert:");
        scanf("%d",&x);
        q[++rear]=x;
    }
}
void  delet()
{
    int a;
    if((front==0)&&(rear==-1))
    {
        printf("Queue is underflow\n");
        getch();
        exit();
    }
    a=q[front++];
    printf("Deleted element is:%d\n",a);
    if(front>rear)
    {
        front=0;
        rear=-1;
    }
}

void display()
{
    int i;
    if(front==0&&rear==-1)
    {
        printf("Queue is underflow\n");
        getch();
        exit();
    }
    for(i=front;i<=rear;i++)
        printf("\t%d",q[i]);
    printf("\n");
}
getch();

The post C program to implement queue operations first appeared on Student Projects.

C Program which performs stack operations

Drithi — Tue, 05 Jun 2012 08:49:00 +0000

Following program performs various stack operations,

 
#include
#include
#include
#include
#define max 20

int top=-1,s[max];
void push(int n)
{
    if(top==max-1)
    {
        puts("stack is over flown");
        return;
    }
    else
    {
        top=top+1;
        s[top]=n;
    }
}
void pop()
{
    int del;
    if(top==-1)
    {
        puts("stack is underflown");
        return;
    }
    else
    {
        del=s[top];
        printf("\n poped element is %d",del);
        top=top-1;
    }
}
void display()
{
    int i;
    if(top==-1)
        puts("stack is empty");
    else
    {
        for(i=top;i>=0;i--)
            printf("\t%d",s[i]);
    }
}
void main()
{
    int opt,n;
    do
    {
        printf("\n 1.push");
        printf("\n 2.pop");
        printf("\n 3.display");
        printf("\n 4.exit");
        printf("enter ur option");
        scanf("%d",&opt);
        switch(opt)
        {
        case1:printf("\n enter any element to push");
            scanf("%d",&n);
            break;
        case2:pop();
            break;
        case3:display();
            break;
        case4:exit(0);
            break;
        }
    }
    while(1);
}

The post C Program which performs stack operations first appeared on Student Projects.

C program for sorting a Linked List

Editorial Team — Sun, 04 Apr 2010 16:34:49 +0000

C program for sorting a Linked List.

#include
#include
#include
#include

void main (int argc,char * argv[])
{
	DIR * directory_pointer;
	struct dirent* entry;
	struct File list 
	{
		char filename[64];
		struct File * new;
	}
	start,*node,* previous, * new;
	if((directory_pointer=opendir(argv[1]))==NULL)
		printf("Error opening %s\n", argv[1]);
	else
	{
		start.next + NULL;
		while (entry = readdir (directory_pointer))
		{
			/* Find the correct location */
			previous= Start ;;
			node = start.next;
			while ((node) &&(strcmp(entry->d_name,node->filename)>0))
			{
				node = node ->next;
				previous + previous->next;
			}
			new =(struct File List *) malloc(size File List));
			if(new += = NULL)
			{
				printf("Insufficient memory to store list\n");
				exit(1);
			}
			new ->next =node;
			previous ->next =new;
			strcpy(new->filename,entry->d_name);
		}
		closedir(directory_pointer);
		node = start.next;
		while (node)
		{
			printf("%s\n", node->filename);
			node = node->next;
		}
	}
}

The post C program for sorting a Linked List first appeared on Student Projects.

C++ program to calculate the factorial of a number using recursion.

Editorial Team — Sun, 04 Apr 2010 12:56:18 +0000

Write a program to calculate the factorial of a number using recursion.

#include
#include
void main()
{
	int n,fact;
	int rec(int); clrscr();
	cout<<"Enter the number:->";
	cin>>n;
	fact=rec(n);
	cout<The post C++ program to calculate the factorial of a number using recursion. first appeared on Student Projects.

C++ program to print student details using constructor and destructor

Editorial Team — Fri, 12 Mar 2010 18:22:49 +0000

AIM:

A program to print student details using a constructor and destructor.

ALGORITHM:

Start the process
Invoke the classes
Call the read() function
- Get the inputs name, roll number and address
Call the display() function
- Display the name, roll number, and address of the student
Stop the process

PROGRAM

#include 
using namespace std;

class student
{
	private: char name[20],add[20];
	  	int roll,zip;
	public: student ( ); //Constructor
		~student( ); //Destructor
		void read( );
		void disp( );			
};

student :: student( )
{
	cout<<"Student class constructor called."<>name;
	cout<<"Enter the student roll no: “;
	cin>>roll;
	cout<<"Enter the student address: ";
	cin>>add;
	cout<<"Enter the Zipcode: ";
	cin>>zip;
}

void student :: disp( )
{
	cout<<"Studet details"<





Output:



Student class constructor called.

Enter the student Name: Rajesh
Enter the student roll no: 1234
Enter the student address: Bangalore
Enter the Zipcode: 560001

Studet details
Student Name   :Rajesh
Roll no is     :1234
Address is     :Bangalore
Zipcode is     :560001

Student class destructor called.



The post C++ program to print student details using constructor and destructor first appeared on Student Projects.



C++ program to implement circular queue ADT using an array
Editorial Team — Thu, 11 Mar 2010 14:21:47 +0000
/* Write a C++ program to implement circular queue ADT using an array */
#include
#include
#include
using namespace std;
class cqueue
{
   int q[5],front,rare;
   public:
      cqueue()
      {
	 front=-1;
	 rare=-1;
      }
      void push(int x)
      {
	 if(front ==-1 && rare == -1)
	 {
	   q[++rare]=x;
	   front=rare;
	   return;
	 }
	 else if(front == (rare+1)%5 )
	 {
	    cout <<" Circular Queue over flow";
	    return;
	 }
	 rare= (rare+1)%5;
	 q[rare]=x;
     }

     void pop()
     {
	if(front==-1 && rare==	-1)
	{
	  cout <<"under flow";
	  return;
	}
	else if( front== rare  )
	{
	  front=rare=-1;
	  return;
	}
	front= (front+1)%5;
     }
   



 void display()
    {
      int i;
      if( front <= rare)
      {
	for(i=front; i<=rare;i++)
	cout << q[i]<<" ";
      }
      else
      {
	 for(i=front;i<=4;i++)
	 {
	   cout <> ch;
switch(ch)
{
case 1: cout<<"enter element";
	cin >> ch;
	q1.push(ch); break;

case 2: q1.pop(); break;
case 3: q1.display(); break;
case 4: exit(0);
}
}
}

OUTPUT
1.INSERT   2.DELETE   3.DISPLAY    4.EXIT

Enter ur choice1

enter element4
1.INSERT   2.DELETE   3.DISPLAY    4.EXIT

Enter ur choice1

enter element5
1.INSERT   2.DELETE   3.DISPLAY    4.EXIT

Enter ur choice1

enter element3
1.INSERT   2.DELETE   3.DISPLAY    4.EXIT

Enter ur choice3

4 5 3
1.INSERT   2.DELETE   3.DISPLAY    4.EXIT

Enter ur choice2
1.INSERT   2.DELETE   3.DISPLAY    4.EXIT

Enter ur choice3

5 3
1.INSERT   2.DELETE   3.DISPLAY    4.EXIT

Enter ur choice4
The post C++ program to implement circular queue ADT using an array first appeared on Student Projects.


C++ programs to implement the Queue ADT using an array
Editorial Team — Wed, 10 Mar 2010 17:30:22 +0000
/* Write C++ programs to implement the Queue ADT using an array */
#include
#include
#include
using namespace std;

class queue
{
              int queue1[5];
              int rear,front;
      public:
              queue()
                {
                     rear=-1;
                     front=-1;
                }
              void insert(int x)
               {
                   if(rear >  4)
                    {
                       cout <<"queue over flow";
                       front=rear=-1;
                       return;
                    }
                    queue1[++rear]=x;
                    cout <<"inserted" <> ch;
              switch(ch)
                {
                  case 1:    cout <<"enter the element";
                           	 cin >> ch;
                             qu.insert(ch);
                             break;
                  case 2:  qu.delet();  break;
                  case 3:  qu.display();break;
                  case 4: exit(0);
                  }
          }
return (0);
}

OUTPUT

1.insert  2.delet  3.display  4.exit

Enter ur choice1

enter the element21

inserted21
1.insert  2.delet  3.display  4.exit

Enter ur choice1

enter the element22

inserted22
1.insert  2.delet  3.display  4.exit

Enter ur choice1

enter the element16

inserted16
1.insert  2.delet  3.display  4.exit

Enter ur choice3

21 22 16 
1.insert  2.delet  3.display  4.exit

Enter ur choice2

deleted21
1.insert  2.delet  3.display  4.exit

Enter ur choice3

22 16
1.insert  2.delet  3.display  4.exit

Enter ur choice
The post C++ programs to implement the Queue ADT using an array first appeared on Student Projects.


C++ programs to implement the Stack ADT using an array
Editorial Team — Wed, 10 Mar 2010 17:22:49 +0000
/* Write C++ programs to implement the Stack ADT using an array */
#include
#include
#include
using namespace std;
class stack
{
             int stk[5];
             int top;
      public:
             stack()
              {
                top=-1;
               }
             void push(int x)
              {
                 if(top >  4)
                       {
                           cout <<"stack over flow";
                           return;
                       }
                 stk[++top]=x;
                 cout <<"inserted" <=0;i--)
                    cout <> ch;
             switch(ch)
              {
               case 1:  cout <<"enter the element";
                        cin >> ch;
                        st.push(ch);
                        break;
               case 2:  st.pop();  break;
               case 3:  st.display();break;
               case 4:  exit(0);
               }
         }
return (0);
}

OUTPUTS

1.push  2.pop  3.display  4.exit

Enter ur choice2

stack under flow
1.push  2.pop  3.display  4.exit

Enter ur choice1

enter the element2

inserted2
1.push  2.pop  3.display  4.exit

Enter ur choice1

enter the element3

inserted3
1.push  2.pop  3.display  4.exit

Enter ur choice2

deleted3
1.push  2.pop  3.display  4.exit

Enter ur choice1

enter the element5

inserted5
1.push  2.pop  3.display  4.exit

Enter ur choice3

5 2
1.push  2.pop  3.display  4.exit

Enter ur choice4
The post C++ programs to implement the Stack ADT using an array first appeared on Student Projects.