#include "stdio.h"
#include "conio.h"
int fr[3];
void main()
{
	void display();

	int p[20]={1,0,7,1,0,2,1,2,3,0,3,2,4,0,3,0,2,1,0,7},i,j,fs[3];
	int index,k,l,flag1=0,flag2=0,pf=0,frsize=3;
	clrscr();
	for(i=0;i<3;i++)
	{
		fr[i]=-1;
	}
	for(j=0;j<20;j++)
	{
		flag1=0,flag2=0;
		for(i=0;i<3;i++)
		{
			if(fr[i]==p[j])
			{
				flag1=1;
				flag2=1;
				break;
			}
		}
		if(flag1==0)
		{
			for(i=0;i<3;i++)
			{
				if(fr[i]==-1)
				{
					fr[i]=p[j];
					flag2=1;
					break;
				}
			}
		}
		if(flag2==0)
		{
			for(i=0;i<3;i++)
				fs[i]=0;
			for(k=j-1,l=1;l<=frsize-1;l++,k--)
			{
				for(i=0;i<3;i++)
				{
					if(fr[i]==p[k])
						fs[i]=1;
				}
			}
			for(i=0;i<3;i++)
			{
				if(fs[i]==0)
					index=i;
			}
			fr[index]=p[j];
			pf++;
		}
		display();
	}
	printf("\n no of page faults :%d",pf);
	getch();
}
void display()
{
	int i;
	printf("\n");
	for(i=0;i<3;i++)
		printf("\t%d",fr[i]);
}

The post Least Recently Used Paging Algorithm first appeared on Student Projects.

#include 
#include 
char opnds[50][80],oprs[50];
int  topr=-1,topd=-1;
pushd(char *opnd)
{
    strcpy(opnds[++topd],opnd);
}
char *popd()
{
    return(opnds[topd--]);
}

pushr(char opr)
{
    oprs[++topr]=opr;
}
char popr()
{
    return(oprs[topr--]);
}
int empty(int t)
{
    if( t == 0) return(1);
    return(0);
}

main()
{
    char prfx[50],ch,str[50],opnd1[50],opnd2[50],opr[2];
    int i=0,k=0,opndcnt=0;
    gets(prfx);
    printf(" Given Prefix Expression : %s\n",prfx);
    while( (ch=prfx[i++]) != '\0')
    {
        if(isalnum(ch))
        {
            str[0]=ch; str[1]='\0';
            pushd(str); opndcnt++;
            if(opndcnt >= 2)
            {
                strcpy(opnd2,popd());
                strcpy(opnd1,popd());
                strcpy(str,"(");
                strcat(str,opnd1);
                ch=popr();
                opr[0]=ch;opr[1]='\0';
                strcat(str,opr);
                strcat(str,opnd2);
                strcat(str,")");
                pushd(str);
                opndcnt-=1;
            }
        }
        else
        {
            pushr(ch);
            if(opndcnt==1)opndcnt=0;  /* operator followed by single operand*/
        }
    }
    if(!empty(topd))
    {
        strcpy(opnd2,popd());
        strcpy(opnd1,popd());
        strcpy(str,"(");
        strcat(str,opnd1);
        ch=popr();
        opr[0]=ch;opr[1]='\0';
        strcat(str,opr);
        strcat(str,opnd2);
        strcat(str,")");
        pushd(str);
    }
    printf(" Infix Expression: ");
    puts(opnds[topd]);
}

The post C Program to convert Prefix Expression into INFIX first appeared on Student Projects.

main()
{
    int n,a[50],key,opn,i,pos;
    do
    {
        clrscr();
        printf(" \n\n Press 1 -> Binary Search , 2-> Towers of Hanoi 3-> Quit\n");
        scanf("%d",&opn);
        switch(opn)
        {
        case 1: printf(" How Many Elements?");
            scanf("%d",&n);
            printf(" Read all the elements is ASC order \n");
            for(i=1;i<=n;i++)
                scanf("%d",&a[i]);
            printf(" Read the Key Element\n");
            scanf("%d",&key);
            pos=BS(a,key,1,n);
            if(pos)	 printf(" Success: %d found at %d \n", key,pos);
            else	 printf(" Falure: %d Not found in the list ! \n",key);
            break;
        case 2: printf("\n\n How Many Disks ?");
            scanf("%d", &n);
            printf("\n\n Result of Towers of Hanoi for %d Disks \n",n);
            tower(n,'A','B','C');
            printf("\n\n Note: A-> Source, B-> Intermediate, C-> Destination\n");
            break;
        case 3: printf(" Terminating \n"); break;
        default: printf(" Invalid Option !! Try Again !! \n");
        }
        printf(" Press a Key. . . ");  getch();
    }while(opn != 3);
}
int BS(int a[], int key,int low,int high)
{
    int mid;
    if(low > high) return 0; /* failure */
    else
    {
        mid=(low+high)/2;
        if(a[mid]== key) return mid; /* Success */
        if(key < a[mid]) return(BS(a,key,low,mid-1));
        return(BS(a,key,mid+1,high));
    }
}
tower(int n, char src, char intr, char dst)
{
    if(n > 0)
    {
        tower(n-1,src,dst,intr);
        printf("Move disk %d from %c to %c \n", n,src,dst);
        tower(n-1,intr,src,dst);
    }
}

The post C Program for Binary Search and Towers of Hanoi using Recursion first appeared on Student Projects.

#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;i
The post C program to insert Student Records to a Sequential File first appeared on Student Projects.
]]>
					
					https://studentprojects.in/software-development/c-tutorials/c/c-advanced/c-program-to-insert-student-records-to-a-sequential-file/feed/
			0
		
		
			
		
		
		https://studentprojects.in/software-development/c-tutorials/c/c-advanced/c-program-which-performs-stack-operations/
					https://studentprojects.in/software-development/c-tutorials/c/c-advanced/c-program-which-performs-stack-operations/#comments
		
		
		Tue, 05 Jun 2012 08:49:00 +0000
				
		
		
		
		
		
		
		http://studentprojects.in/?p=3121

					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;

The post C Program which performs stack operations first appeared on Student Projects.
]]>
										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.
]]>
					
					https://studentprojects.in/software-development/c-tutorials/c/c-advanced/c-program-which-performs-stack-operations/feed/
			1
		
		
			
		
		
		https://studentprojects.in/software-development/c-tutorials/c/c-advanced/binary-search/
					https://studentprojects.in/software-development/c-tutorials/c/c-advanced/binary-search/#comments
		
		
		Mon, 15 Aug 2011 17:43:26 +0000
				
		
		
		
		http://studentprojects.in/?p=1591

					A binarysearch program locates the position of an item in a sorted array. Logic: The Binary search starts by testing the element at the middle of the array. Let us consider an array ‘a’ with all elements arranged in ascending order. Let low and high are the lower and upper indices of the array ‘a’, respectively. We want to search an item

The post Binary Search first appeared on Student Projects.
]]>
										A binarysearch program locates the position of an item in a sorted array.

Logic: The Binary search starts by testing the element at the middle of the array. Let us consider an array ‘a’ with all elements arranged in ascending order. Let low and high are the lower and upper indices of the array ‘a’, respectively. We want to search an item K in it. To do this, we calculate a middle index with the values of low and high, let it be mid. Then we compare if K=a[mid] or not.
If it is true, then search is done. Otherwise, the search is to be repeated on left or right half depending on the K<a[mid] or K>a[mid], respectively. In case of low =high and K a[mid], the search terminates unsuccessfully.

Example 1:
Consider the following elements stored in an array,

Example 2:
Consider the following elements stored in an array,

Program:
#include"stdio.h"
#include"conio.h"
void main()
{
	int a[25], i, n, K, flag = 0, low, high, mid;
	clrscr();
	printf("Enter the number of elementsn");
	scanf("%d", &n);
	printf("Enter the elementsn");
	for(i = 0; i<n; i++)
	{
		scanf("%d",&a[i]);
	}
	printf("Enter the key to be searchedn");
	scanf("%d",&K);
	low = 0;
	high = n - 1;
	while(low <= high)
	{
		mid = (low+high)/2;
		if(a[mid] == K)
		{
			flag = 1;
			break;
		}
		else if(K<a[mid])
			high = mid-1;
		else
			low = mid + 1;
	}
	if(flag == 1)
	{
		printf("Key element is found");
	}
	else
	{
		printf("Key element not found");
	}
	getch();
}
The post Binary Search first appeared on Student Projects.
]]>
					
					https://studentprojects.in/software-development/c-tutorials/c/c-advanced/binary-search/feed/
			2
		
		
			
		
		
		https://studentprojects.in/software-development/c-tutorials/c/c-advanced/priority-schedueling-preemtion-aging-arrival-times/
					https://studentprojects.in/software-development/c-tutorials/c/c-advanced/priority-schedueling-preemtion-aging-arrival-times/#respond
		
		
		Mon, 30 May 2011 09:10:19 +0000
				
		http://studentprojects.in/?p=1490

					#include"stdio.h" #include"conio.h" typedef struct{ int arrival; int burst; int priorty; int index; int status; }process; void swap(process *x,process *y) { process temp; temp = *x; *x = *y; *y = temp; } void bublesort(process p[], int n) { int i,j; for(i=0;ip[j+1].priorty)) swap(&p[j],&p[j+1]); } void sortpr(process p[],int n) { int i,j; for(i=0;i

The post Priority schedueling with & without preemtion, with aging, with different arrival times first appeared on Student Projects.
]]>
										
#include"stdio.h"
#include"conio.h"
typedef struct{

    int arrival;
    int burst;
    int priorty;
    int index;
    int status;
}process;

void swap(process *x,process *y)
{
    process temp;
    temp = *x;
    *x = *y;
    *y = temp;
}

void bublesort(process p[], int n)
{

    int i,j;
    for(i=0;i<(n-1);i++)
        for(j=0;j<(n-(i+1));j++)
            if(p[j].arrival > p[j+1].arrival||(p[j].arrival==p[j+1].arrival&&p[j].priorty>p[j+1].priorty))
                swap(&p[j],&p[j+1]);
}

void sortpr(process p[],int n)
{
    int i,j;
    for(i=0;i<(n-1);i++)
        for(j=0;j<(n-(i+1));j++)
            if(p[j].priorty > p[j+1].priorty)
                swap(&p[j],&p[j+1]);
}

void deletep(process p[],int size,int index)
{ 
    int i=index;
    while(icurrent){
                current=p[i+1].arrival;}
            else{ j=i+1;
            minpr=p[j].priorty;
            for(j=i+1;jcurrent){
                current=p[i+1].arrival;
            }
            else{ j=i+1;
            minpr=p[j].priorty-(current-p[j].arrival)/5;
            for(j=i+1;j
The post Priority schedueling with & without preemtion, with aging, with different arrival times first appeared on Student Projects.
]]>
					
					https://studentprojects.in/software-development/c-tutorials/c/c-advanced/priority-schedueling-preemtion-aging-arrival-times/feed/
			0
		
		
			
		
		
		https://studentprojects.in/software-development/c-tutorials/c/c-advanced/c-program-to-implement-tower-of-hanoi-problem/
					https://studentprojects.in/software-development/c-tutorials/c/c-advanced/c-program-to-implement-tower-of-hanoi-problem/#comments
		
		
		Sun, 04 Apr 2010 17:28:33 +0000
				
		
		
		
		http://studentprojects.in/?p=1158

					To implement tower of Hanoi problem. #include void hanoi_tower(char,char,char,int); void hanoi_tower(char peg1,char peg2,char pege3,int n) { if(n

The post C program to implement tower of Hanoi problem first appeared on Student Projects.
]]>
										To implement tower of Hanoi problem.

#include 	  
void hanoi_tower(char,char,char,int);
void hanoi_tower(char peg1,char peg2,char pege3,int n)
{
	if(n<=0)
        printf("\n Illegal Entry");
        if(n==1)
			printf ("\n Move disk from %c to %c", pege1,pege3);
		else
		{
		   hanoi_tower(peg1,peg3,peg2,n-1);
		   hanoi_tower(peg1,peg2,peg3,1);
		   hanoi_tower(peg2,peg1,peg3,n-1);
		}
}
Void main ()
{
    int n;
    printf("\n Input the number of dise:);
    scanf("%d", &n);
    printf("\n Tower of Hanoi for 5th DISC", n);
    hanoi_tower('x','y','z',n);
}
The post C program to implement tower of Hanoi problem first appeared on Student Projects.
]]>
					
					https://studentprojects.in/software-development/c-tutorials/c/c-advanced/c-program-to-implement-tower-of-hanoi-problem/feed/
			7
		
		
			
		
		
		https://studentprojects.in/software-development/c-tutorials/c/c-advanced/c-program-to-implement-morse-code-to-text-conversion-and-vice-versa/
					https://studentprojects.in/software-development/c-tutorials/c/c-advanced/c-program-to-implement-morse-code-to-text-conversion-and-vice-versa/#comments
		
		
		Sun, 04 Apr 2010 15:52:44 +0000
				
		
		
		
		
		
		
		http://studentprojects.in/?p=1146

					C program to Implement Morse code to text conversion and vice-versa. #include #include #include #include void main() { char str[25],str1[100]; clrscr(); fflush(stdin); printf("enter the String"); gets(str); int j=0; for(int i=0;i

The post C program to Implement Morse code to text conversion and vice-versa. first appeared on Student Projects.
]]>
										C program to Implement Morse code to text conversion and vice-versa.

#include
#include
#include
#include

void main()
{
	char str[25],str1[100];
	clrscr();
	fflush(stdin);
	printf("enter the String");
	gets(str);

	int j=0;
	for(int i=0;i<=strlen(str);++)
	{
		switch(toupper(str[i]))
		{
		  case 'A':
		  str1[j++]='.';
		  str1[j]='.';
		  break;
		  
		  case 'b':
		  str1[j++]='.';
		  str1[j++]='.';
		  str1[j++]='.';
		  str1[j]='.';
		  break;

		  case 'c':
		  str1[j++]='.';
		  str1[j++]='.';
		  str1[j++]='.';
		  str1[j]='.';
		  break;

		  case 'D':
		  str1[j++]='.';
		  str1[j++]='.';
		  str1[j]='.';
		  break;

		  case 'E':
		  str1[j]='.';
		  break;

		  case 'F':
		  str1[j++]='.';
		  str1[j++]='.';
		  str1[j++]='.';
		  str1[j]='.';
		    break;

		  case 'G':
		  str1[j++]='.';
		  str1[j++]='.';
		  str1[j]='.';
		  break;

		  case 'H':
		  str1[j++]='.';
		  str1[j++]='.';
		  str1[j++]='.';
		  str1[j]='.';
		    break;

		   case 'I':
		  str1[j++]='.';
		  str1[j]='.';
		    break;

		case 'J':
		  str1[j++]='.';
		  str1[j++]='.';
		  str1[j++]='.';
		  str1[j]='.';
		    break;

		case 'K':
		  str1[j++]='.';
		  str1[j++]='.';
		  str1[j]='.';
		    break;

		case 'L':
		  str1[j++]='.';
		  str1[j++]='.';
		  str1[j++]='.';
		  str1[j]='.';
		  break;

		case 'M':
		  str1[j++]='-';
		    str1[j]='-';
		    break;

		case 'N':
		  str1[j++]='-';
		  str1[j]='.';
		    break;

		case 'O':
		  str1[j++]='-';
		  str1[j++]='-';
		  str1[j]='.';
		    break;

		case 'P':
		  str1[j++]='.';
		  str1[j++]='-';
		  str1[j++]='-';
		  str1[j]='.';
		    break;

		case 'Q':
		  str1[j++]='-';
		  str1[j++]='-';
		  str1[j++]='.';
		  str1[j]='.';
		    break;

		case 'R':
		  str1[j++]='.';
		  str1[j++]='-';
		  str1[j]='.';
		    break;

		case 'S':
		  str1[j++]='.';
		  str1[j++]='.';
		  str1[j]='.';
		    break;

		case 'T':
		  str1[j]='-';
		    break;
			
		case 'U':
		  str1[j++]='.';
		  str1[j++]='.';
		  str1[j]='.';
		    break;

		case 'V':
		  str1[j++]='.';
		  str1[j++]='.';
		  str1[j++]='.';
		  str1[j]='-';
		    break;

		case 'W':
		  str1[j++]='.';
		  str1[j++]='-';
		  str1[j]='-';
		    break;

		case 'X':
		  str1[j++]='-';
		  str1[j++]='.';
		  str1[j++]='.';
		  str1[j]='-';
		    break;

		case 'y':
		  str1[j++]='-';
		  str1[j++]='.';
		  str1[j++]='-';
		  str1[j]='.';
		    break;

		case 'Z':
		  str1[j++]='.';
		  str1[j++]='.';
		  str1[j++]='.';
		  str1[j]='.';
		    break;

		case '0':
		  str1[j++]='-';
		  str1[j++]='-';
		  str1[j++]='-';
		  str1[j++]='-';
		  str1[j]='-';
		    break;
			
		case '1':
		  str1[j++]='.';
		  str1[j++]='.';
		  str1[j++]='-';
		  str1[j++]='-'; 
		  str1[j]='-';
		    break;

		case '2':
		  str1[j++]='.';
		  str1[j++]='.';
		  str1[j++]='.';
		  str1[j]='.';
		    break;

		case 'F':
		  str1[j++]='.';
		  str1[j++]='.';
		  str1[j++]='.';
		  str1[j++]='.';
		  str1[j]='.';
		    break;

		case '3':
		  str1[j++]='.';
		  str1[j++]='.';
		  str1[j++]='.';
		  str1[j++]='-';
		  str1[j]='.';
		    break;

		case '4':
		  str1[j++]='.';
		  str1[j++]='.';
		  str1[j++]='.';
		  str1[j++]='.';
		  str1[j]='-';
		    break;

		case '5':
		  str1[j++]='.';
		  str1[j++]='.';
		  str1[j++]='.';
		  str1[j++]='.';
		  str1[j]='.';
		    break;

		case '6':
		  str1[j++]='.';
		  str1[j++]='.';
		  str1[j++]='.';
		  str1[j++]='.';
		  str1[j]='-';
		    break;

		case '7':
		  str1[j++]='.';
		  str1[j++]='.';
		  str1[j++]='.';
		  str1[j++]='.';
		  str1[j]='-';
		    break;

		case '8':
		  str1[j++]='.';
		  str1[j++]='.';
		  str1[j++]='.';
		  str1[j++]='.';
		  str1[j]='-';
		    break;

		case '9':
		  str1[j++]='-';
		  str1[j++]='-';
		  str1[j++]='-';
		  str1[j++]='-';
		  str1[j]='.';
		    break;

		case '.':
		  str1[j++]='.';
		  str1[j++]='.';
		  str1[j++]='.';
		  str1[j++]='.';
		  str1[j++]='.';
		  str1[j]='-';
		    break;

		case ',':
		  str1[j++]='.';
		  str1[j++]='.';
		  str1[j++]='.';
		  str1[j++]='.';
		  str1[j++]='.';
		  str1[j]='-';
		    break;

		case ':':
		  str1[j++]='.';
		  str1[j++]='.';
		  str1[j++]='.';
		  str1[j++]='.';
		  str1[j++]='.';
		  str1[j]='-';
		    break;

		case '?':
		  str1[j++]='.';
		  str1[j++]='.';
		  str1[j++]='.';
		  str1[j++]='.';
		  str1[j++]='.';
		  str1[j]='-';
		    break;

		/* case '\';
		  str1[j++]='.';
		  str1[j++]='.'; 
		  str1[j++]='.';
		  str1[j++]='.';
		  str1[j++]='.';
		  str1[j]='-';
		    break; */

		case '-':
		  str1[j++]='-';
		  str1[j++]='.';
		  str1[j++]='.';
		  str1[j++]='.';
		  str1[j++]='.';
		  str1[j]='-';
		    break;

		case ';':
		  str1[j++]='-';
		  str1[j++]='.';
		  str1[j++]='.';
		  str1[j++]='.';
		  str1[j++]='-';
		  str1[j]='.';
		    break;

		case '(':
		  str1[j++]='.';
		  str1[j++]='.';
		  str1[j++]='.';
		  str1[j++]='.';
		  str1[j++]='.';
		  str1[j]='-';
		    break;

		case ')':
		  str1[j++]='.';
		  str1[j++]='.'; 
		  str1[j++]='.';
		  str1[j++]='.';
		  str1[j++]='.';
		  str1[j]='-';
		    break;

		case ']':
		  str1[j++]='-';
		  str1[j++]='.';
		  str1[j++]='.';
		  str1[j++]='-';
		  str1[j++]='-';
		  str1[j]='-';
		    break;

		case '[':
		  str1[j++]='-';
		  str1[j++]='.';
		  str1[j++]='.';
		  str1[j++]='-';
		  str1[j++]='-';
		  str1[j]='.';
		    break;

		case '}':
		  str1[j++]='-';
		  str1[j++]='.';
		  str1[j++]='-';
		  str1[j++]='-';
		  str1[j++]='.';
		  str1[j]='-';
		    break;
			
		case '{':
		  str1[j++]='-';
		  str1[j++]='.';
		  str1[j++]='-';
		  str1[j++]='-';
		  str1[j++]='.';
		  str1[j]='-';
		    break;

		case '"':
		  str1[j++]='.';
		  str1[j++]='.';
		  str1[j++]='.';
		  str1[j++]='.';
		  str1[j++]='.';
		  str1[j]='-';
		    break;

		case '+':
		  str1[j++]='.';
		  str1[j++]='.';
		  str1[j++]='.';
		  str1[j++]='.';
		  str1[j++]='.';
		  str1[j]='-';
		    break;

		case '/':
		  str1[j++]='.';
		  str1[j++]='.';  
		  str1[j++]='.';
		  str1[j++]='.';
		  str1[j++]='.';
		  str1[j]='-';
		    break;

		case '%':
		  str1[j++]='.';
		  str1[j++]='.';
		  str1[j++]='.';
		  str1[j++]='.';
		  str1[j++]='.';
		  str1[j]='-';
		    break;

		case '&':
		  str1[j++]='.';
		  str1[j++]='.';
		  str1[j++]='.';
		  str1[j++]='.';
		  str1[j++]='.';
		  str1[j]='-';
		    break;

		case '$':
		  str1[j++]='.';
		  str1[j++]='.';
		  str1[j++]='.';
		  str1[j++]='.';
		  str1[j++]='.';
		  str1[j]='-';
		    break;

		case '*':
		  str1[j++]='.';
		  str1[j++]='.';
		  str1[j++]='.';
		  str1[j++]='.';
		  str1[j++]='.';
		  str1[j]='-';
		    break;

		case '^':
		  str1[j++]='.';
		  str1[j++]='.';
		  str1[j++]='.';
		  str1[j++]='.';
		  str1[j++]='.';
		  str1[j]='-';
		    break;

		case '#':
		  str1[j++]='.';
		  str1[j++]='.';  
		  str1[j++]='.';
		  str1[j++]='.';
		  str1[j++]='.';
		  str1[j]='-';
		    break;

		case '@':
		  str1[j++]='.';
		  str1[j++]='.';
		  str1[j++]='.';
		  str1[j++]='.';
		  str1[j++]='.';
		  str1[j]='-';
		    break;

		case '=':
		  str1[j++]='.';
		  str1[j++]='.';
		  str1[j++]='.';
		  str1[j++]='.';
		  str1[j]='';
		    break;
		}
	    j++;
	}
	str1[j-1]='\0';
	puts(str1);
	getch();
 }
The post C program to Implement Morse code to text conversion and vice-versa. first appeared on Student Projects.
]]>
					
					https://studentprojects.in/software-development/c-tutorials/c/c-advanced/c-program-to-implement-morse-code-to-text-conversion-and-vice-versa/feed/
			5
		
		
			
		
		
		https://studentprojects.in/software-development/c-tutorials/c/c-advanced/c-program-for-syntax-analyzer/
					https://studentprojects.in/software-development/c-tutorials/c/c-advanced/c-program-for-syntax-analyzer/#comments
		
		
		Mon, 29 Mar 2010 16:54:13 +0000
				
		
		
		
		
		http://studentprojects.in/?p=1128

					C program for Syntax Analyzer #include #include #include #include void main() { int i,j,k=0,count,inc=0,n; char name[30],open[30],ch,chh,o[30]; char op[20]={'=','+','-','*','/','%','^','&','|'}; clrscr(); textcolor(3); cprintf("--Syntax Analyser--"); printf("\n"); printf("\n Enter Syntax"); printf("\n"); scanf("%s",name); n=strlen(name); for(i=0;i

The post C program for Syntax Analyzer first appeared on Student Projects.
]]>
										C program for Syntax Analyzer

#include
#include
#include
#include
void main()
 {
    int i,j,k=0,count,inc=0,n;
   char name[30],open[30],ch,chh,o[30];
   char op[20]={'=','+','-','*','/','%','^','&','|'};
   clrscr();
   textcolor(3);
   cprintf("--Syntax Analyser--");
   printf("\n");
   printf("\n Enter Syntax");
   printf("\n");
   scanf("%s",name);
   n=strlen(name);
   for(i=0;i
The post C program for Syntax Analyzer first appeared on Student Projects.
]]>
					
					https://studentprojects.in/software-development/c-tutorials/c/c-advanced/c-program-for-syntax-analyzer/feed/
			7