electrofriends.com » Advanced programs http://electrofriends.com ...bringing innovative minds together Tue, 07 Feb 2012 08:43:06 +0000 en hourly 1 http://wordpress.org/?v=3.0.6 Binary Search http://electrofriends.com/articles/computer-science/c-tutorials/binary-search/ http://electrofriends.com/articles/computer-science/c-tutorials/binary-search/#comments Mon, 15 Aug 2011 17:43:26 +0000 chitra http://electrofriends.com/?p=1591 A binary search 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:

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
37
38
39
40

#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();
}
]]> http://electrofriends.com/articles/computer-science/c-tutorials/binary-search/feed/ 2 Priority schedueling with & without preemtion, with aging, with different arrival times http://electrofriends.com/source-codes/software-programs/c/c-advanced-programs/priority-schedueling-preemtion-aging-arrival-times/ http://electrofriends.com/source-codes/software-programs/c/c-advanced-programs/priority-schedueling-preemtion-aging-arrival-times/#comments Mon, 30 May 2011 09:10:19 +0000 rayan daou http://electrofriends.com/?p=1490 
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
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220

#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(i<size-1)
    {
        p[i]=p[i+1];
        i++;
    }
    return;
}
 
bool nonew(process p[],int size)
{ 
    for(int i=0;i<size;i++)
    {
        if(p[i].status==0 )return false;
    }
    return true;
}
 
bool noready(process p[],int size)
{
    for(int i=0;i<size;i++)
        if(p[i].status==1)
            return false;
    return true;
}
 
int ready(process p[],int size)
{ 
    int min=0;
    for(int i=0;i<size;i++)
        if(p[i].status==1&&p[i].priorty<p[min].priorty)
            min=i;
    return min;
}
 
void NonPreemtive(process p[],int size)
{ 
    int i,j,minpr,current=p[0].arrival;
    for(i=0;i<size-1;i++)
    {
        printf("p%d from %d to %d\n",p[i].index,current,current+p[i].burst);
        current=current+p[i].burst;
        if (p[i+1].arrival==current)
        {
            continue;
        }
        else{
            if(p[i+1].arrival>current){
                current=p[i+1].arrival;}
            else{ j=i+1;
            minpr=p[j].priorty;
            for(j=i+1;j<size;j++)
            { 
                if(p[j].arrival<current){
                    if (p[j].priorty<minpr){
                        minpr=p[j].priorty;
                        swap(&p[i+1],&p[j]);
                    }
                }
            }
            }
        }
}
    printf("p%d from %d to %d\n",p[i].index,current,current+p[i].burst);
}
 
void NonPreemtiveAging(process p[],int size)
{
    int i,j,minpr,current=p[0].arrival;
    for(i=0;i<size-1;i++)
    { 
        printf("p%d from %d to %d\n",p[i].index,current,current+p[i].burst);
        current=current+p[i].burst;
        if (p[i+1].arrival==current)
        {
            continue;
        }
        else{
            if(p[i+1].arrival>current){
                current=p[i+1].arrival;
            }
            else{ j=i+1;
            minpr=p[j].priorty-(current-p[j].arrival)/5;
            for(j=i+1;j<size;j++)
            { 
                if(p[j].arrival<current){
                    if (p[j].priorty-(current-p[j].arrival)/5<minpr)
                    {
                        minpr=p[j].priorty-(current-p[j].arrival)/5;
                        swap(&p[i+1],&p[j]);
                    }
                }
            }
            }
        }
    }
    printf("p%d from %d to %d\n",p[i].index,current,current+p[i].burst);
}
 
void Preemtive(process p[],int size)
{
    int i=0,current=p[0].arrival,j,test;
    while(size!=0)
    {
        printf("p%d from %d to ",p[i].index,current);
        if(nonew(p,size)){
            printf("%d\n",current+p[i].burst);
            current=current+p[i].burst;
            deletep(p,size,i);
            size--;
            if(size==0) break;
            i=ready(p,size);
            continue;
        }
        else{test=0;
        for(j=0;j<size;j++)
        {
            if(p[j].arrival<current+p[i].burst)    
            {
                if(p[j].status==1)continue;
                if(p[j].priorty<p[i].priorty)
                {
                    printf(" %d\n",p[j].arrival);
                    p[i].burst=p[i].burst-(p[j].arrival-current);
                    p[i].status=1;
                    current=p[j].arrival;
                    test=1;
                    i=j;
                    break;
                }else p[j].status=1;
            }else if(p[j].arrival==current+p[i].burst)p[j].status=1;
        }
        if(test==1)continue;
        printf("%d\n",current+p[i].burst);
        current=current+p[i].burst;
        deletep(p,size,i);
        size--;
        if (!noready(p,size))
        {
            i=ready(p,size);
        }
        else {
            current=p[i].arrival;}
        }
    }
    return;
}
 
void main()
{
    process p[5];
    int i,c;
    printf("Welcome\n");
    printf( "Choose the mode of scedueling:\npress 1 for non preemtive\npress 2 for non preemtive with aging\npress 3 for preemptive\n");
    scanf("%d",&c);
    for (i=0;i<5;i++)
    {
        printf("\nenter the arrival time of p %d:",i);
        scanf("%d",&p[i].arrival);
        printf("enter the burst time of p %d:",i);
        scanf("%d",&p[i].burst);
        printf("enter the priorty of p %d:",i);
        scanf("%d",&p[i].priorty);
        p[i].status=0;
        p[i].index=i;
    }
    bublesort(p,5);
    printf("\nsorted:\nprocess arrival time burst time priorty\n");
    for (i=0;i<5;i++)
    {
        printf( " p%d %d %d %d\n",p[i].index,p[i].arrival,p[i].burst,p[i].priorty);
    }
    if(c==1)
        NonPreemtive(p,5);
    else{
        if(c==2) NonPreemtiveAging(p,5);
        else if (c==3)Preemtive(p,5);
    }
    getch();
}
]]> http://electrofriends.com/source-codes/software-programs/c/c-advanced-programs/priority-schedueling-preemtion-aging-arrival-times/feed/ 0 C program to implement tower of Hanoi problem http://electrofriends.com/source-codes/software-programs/c/c-advanced-programs/c-program-to-implement-tower-of-hanoi-problem/ http://electrofriends.com/source-codes/software-programs/c/c-advanced-programs/c-program-to-implement-tower-of-hanoi-problem/#comments Sun, 04 Apr 2010 17:28:33 +0000 Ranjith http://electrofriends.com/?p=1158 To implement tower of Hanoi problem.

#include<stdio.h> 	  
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);
}
]]> http://electrofriends.com/source-codes/software-programs/c/c-advanced-programs/c-program-to-implement-tower-of-hanoi-problem/feed/ 6 C program for sorting a Linked List http://electrofriends.com/source-codes/software-programs/c/c-advanced-programs/c-program-for-sorting-a-linked-list/ http://electrofriends.com/source-codes/software-programs/c/c-advanced-programs/c-program-for-sorting-a-linked-list/#comments Sun, 04 Apr 2010 16:34:49 +0000 Ranjith http://electrofriends.com/?p=1151 C program for sorting a Linked List.

#include<stdio.h>
#include<dirent.h>
#include<malloc.h>
#include<string.h>
 
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;
		}
	}
}
]]> http://electrofriends.com/source-codes/software-programs/c/c-advanced-programs/c-program-for-sorting-a-linked-list/feed/ 0 C program to Implement Morse code to text conversion and vice-versa. http://electrofriends.com/source-codes/software-programs/c/c-advanced-programs/c-program-to-implement-morse-code-to-text-conversion-and-vice-versa/ http://electrofriends.com/source-codes/software-programs/c/c-advanced-programs/c-program-to-implement-morse-code-to-text-conversion-and-vice-versa/#comments Sun, 04 Apr 2010 15:52:44 +0000 Ranjith http://electrofriends.com/?p=1146 C program to Implement Morse code to text conversion and vice-versa.

#include<stdio.h>
#include<conio.h>
#include<string.h>
#include<process.h>
 
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();
 }
]]> http://electrofriends.com/source-codes/software-programs/c/c-advanced-programs/c-program-to-implement-morse-code-to-text-conversion-and-vice-versa/feed/ 0 C program for Syntax Analyzer http://electrofriends.com/source-codes/software-programs/c/c-advanced-programs/c-program-for-syntax-analyzer/ http://electrofriends.com/source-codes/software-programs/c/c-advanced-programs/c-program-for-syntax-analyzer/#comments Mon, 29 Mar 2010 16:54:13 +0000 Ranjith http://electrofriends.com/?p=1128 C program for Syntax Analyzer

#include<stdio.h>
#include<conio.h>
#include<string.h>
#include<ctype.h>
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<n;i++)
    {
      ch=tolower(name[i]);
      for(j=0;j<9;j++)
      {
        if(ch==op[j])
         {
           open[k]=i;
           o[k]=ch;
           k++;
         }
      }
   }
   for(i=0;i<k;i++)
    {
      count=open[i];
      ch=tolower(name[count-1]);
      chh=tolower(name[count+1]);
      if(isalpha(ch)&&isalpha(chh)||isdigit(chh))
       ++inc;
     }
   if(k==inc)
  printf("\n %s is a valid syntax",name);
 else
  printf("\n %s is an invalid syntax",name);
  getch();
}
]]> http://electrofriends.com/source-codes/software-programs/c/c-advanced-programs/c-program-for-syntax-analyzer/feed/ 1 C program for Shortest Job Next http://electrofriends.com/source-codes/software-programs/c/c-advanced-programs/c-program-for-shortest-job-next/ http://electrofriends.com/source-codes/software-programs/c/c-advanced-programs/c-program-for-shortest-job-next/#comments Mon, 29 Mar 2010 16:51:08 +0000 Ranjith http://electrofriends.com/?p=1126 C program for Shortest Job Next

 #include<stdio.h>
 #include<conio.h>
 #include<math.h>
 void main()
 {
   int s,t[20],temp,n,x[20],w[20],i,j,c,d,b[20];
   float avgw,avgt;
   clrscr();
   printf("\n Enter no.of job:");
   scanf("%d",&n);
   printf("enter the job:");
   for(i=1;i<=n;i++)
    {
      scanf("%d",&b[i]);
      x[i]=i;
    }
   for(i=1;i<=n-1;i++)
   {
    for(j=i+1;j<=n;j++)
    {
      if(b[i]>b[j])
      {
        temp=b[i];
        b[i]=b[j];
        b[j]=temp;
        s=x[i];
        x[i]=x[j];
        x[j]=s;
      }
   }
 }
   c=0;
   d=0;
   for(i=1;i<=n;i++)
    {
       w[i]=w[i-1]+b[i-1];
       t[i]=b[i]+t[i-1];
       w[1]=0;
       t[1]=b[1];
       c+=w[i];
       d+=t[i];
    }
  avgw=(float)c/n;
  avgt=(float)d/n;
 printf("job \t waiting time \t service time \t turn around time \t \n :");
 for(i=1;i<=n;i++)
  {
     printf("%d \t %d \t ",x[i],b[i]);
     printf("%d \t %d \t",w[i],t[i]);
     printf("\n");
  }
     printf("average wait time %f \n",avgw);
     printf("average turn around %f \n",avgt);
     getch();
}
]]> http://electrofriends.com/source-codes/software-programs/c/c-advanced-programs/c-program-for-shortest-job-next/feed/ 0 C program for Round Robin http://electrofriends.com/source-codes/software-programs/c/c-advanced-programs/c-program-for-round-robin/ http://electrofriends.com/source-codes/software-programs/c/c-advanced-programs/c-program-for-round-robin/#comments Mon, 29 Mar 2010 16:48:08 +0000 Ranjith http://electrofriends.com/?p=1124 C program for Round Robin

 
#include<stdio.h>
#include<conio.h>
#include<iostream.h>
int t,n,s,bt[10],ct[10],ta[10],w[10],lat[10],wav,taav;
int allover()
 {
   for(int i=0;i<n;i++)
   if(ct[i]>0)
   return 0;
   return 1;
 }
void select(int p)
 {
   w[p]+=t-lat[p];
   if(ct[p]>=s)
   {
     ct[p]-=s;
     t+=s;
   }
 else
  {
    t+=ct[p];
    ct[p]=0;
  }
   if(ct[p]==0)
    ta[p]=t;
   lat[p]=t;
 }
void main()
 {
   int p=0;t=0;taav=0;wav=0;
   clrscr();
   printf("Enter the number of process : ");
   scanf("%d",&n);
   printf("\n Enter the time slice : ");
   scanf("%d",&s);
   printf("\nEnter the burst time of processes \n ");
   for(int i=0;i<n;i++)
   {
     printf("\n process %d : ",i+1);
     scanf("%d",&bt[i]);
     ct[i]=bt[i];
     lat[i]=0;
   }
 while(!allover())
  {
    if(ct[p]!=0)
   select(p);
   p=(p+1)%n;
  }
 printf("\n\n Process    Burst time   Wait time    Turn around \n\n");
 for(i=0;i<n;i++)
  {
    printf("\n %d\t\t%d\t\t%d\t\t%d",i+1,bt[i],w[i],ta[i]);
    wav+=w[i];
    taav+=ta[i];
  }
 wav/=n;
 taav/=n;
 printf("\n\nAverage waiting time : %d ",wav);
 printf("\n\nAverage turn around time : %d ",taav);
 getch();
}
]]> http://electrofriends.com/source-codes/software-programs/c/c-advanced-programs/c-program-for-round-robin/feed/ 4 C program for Priority Scheduling http://electrofriends.com/source-codes/software-programs/c/c-advanced-programs/c-program-for-priority-scheduling/ http://electrofriends.com/source-codes/software-programs/c/c-advanced-programs/c-program-for-priority-scheduling/#comments Mon, 29 Mar 2010 16:43:12 +0000 Ranjith http://electrofriends.com/?p=1122 C program for Priority Scheduling

#include<stdio.h>
#include<conio.h>
#include<iostream.h>
void main()
 {
   clrscr();
   int x,n,p[10],pp[10],pt[10],w[10],t[10],awt,atat,i;
   printf("Enter the number of process : ");
   scanf("%d",&n);
   printf("\n Enter process : time priorities \n");
   for(i=0;i<n;i++)
    {
      printf("\nProcess no %d : ",i+1);
      scanf("%d  %d",&pt[i],&pp[i]);
      p[i]=i+1;
    }
  for(i=0;i<n-1;i++)
   {
     for(int j=i+1;j<n;j++)
     {
       if(pp[i]<pp[j])
       {
         x=pp[i];
         pp[i]=pp[j];
         pp[j]=x;
         x=pt[i];
         pt[i]=pt[j];
         pt[j]=x;
         x=p[i];
         p[i]=p[j];
         p[j]=x;
      }
   }
}
w[0]=0;
awt=0;
t[0]=pt[0];
atat=t[0];
for(i=1;i<n;i++)
 {
   w[i]=t[i-1];
   awt+=w[i];
   t[i]=w[i]+pt[i];
   atat+=t[i];
 }
printf("\n\n Job \t Burst Time \t Wait Time \t Turn Around Time   Priority \n");
for(i=0;i<n;i++)
  printf("\n %d \t\t %d  \t\t %d \t\t %d \t\t %d \n",p[i],pt[i],w[i],t[i],pp[i]);
awt/=n;
atat/=n;
printf("\n Average Wait Time : %d \n",awt);
printf("\n Average Turn Around Time : %d \n",atat);
getch();
}
]]> http://electrofriends.com/source-codes/software-programs/c/c-advanced-programs/c-program-for-priority-scheduling/feed/ 21 C program for Pass-1 Assembler http://electrofriends.com/source-codes/software-programs/c/c-advanced-programs/c-program-for-pass-1-assembler/ http://electrofriends.com/source-codes/software-programs/c/c-advanced-programs/c-program-for-pass-1-assembler/#comments Mon, 29 Mar 2010 16:37:43 +0000 Ranjith http://electrofriends.com/source-codes/software-programs/c/c-advanced-programs/c-program-for-pass-1-assembler/ C program for Pass-1 Assembler

#include<iostream.h>
#include<conio.h>
#include<stdio.h>
#include<stdlib.h>
#include<string.h>
int symi=0,lc=0,len=1,dc=0,start=0;
struct pgm
 {
   char line[80];
 } s[100];
struct symtab
 {
   char name[10];
   int add;
 } sym[100];
void show(char* a,char* b,char* c)
 {
   printf("%8s %5s %6s \n",a,b,c);
 }
void check(char s[])
 {
   if(!strcmpi(s,"START"))
   {
     start=1;
     show("","START","1");
     return;
   }
   if(!strcmpi(s,"END"))
    {
      show("","END","1");
      return;
    }
    if(!strcmpi(s,"EQU"))
     {
       show("","EQU","1");
       return;
    }
   if(!strcmpi(s,"DS"))
    {
      show("","DS","1");
      return;
    }
  if(!strcmpi(s,"ORG"))
   {
   show("","ORG","1");
   return;
 }
if(!strcmpi(s,"DC"))
 {
   show("","DC","1");
   return;
 }
if(start)
 {
   start=0;
   lc=atoi(s);
   return;
 }
if(dc)
 {
   dc=0;
   len=atoi(s);
   show("","DS",s);
   return;
 }
for(int i=0;i<symi;i++)
 {
    if(strcmp(sym[i].name,s)==0)
    return;
 }
if(s[0]=='\'')
 {
   char p[2];
   sprintf(p,"LIT : %s",s);
   show(p,"-","-");
   return;
 }
strcpy(sym[symi++].name,s);
show(s,"-","-");
return;
}
void main()
 {
   char t[20];
   int i=0,j=0,k=0;
   cout<<"Enter the Program code:";
   do
    {
     gets(s[i].line);
    }
   while(strcmpi(s[i++].line,"end"));
   printf("Systab Optab Length \n");
   printf("---------------------");
   k=-1;
   do
     {
       k++;
       for(i=0;s[k].line[i]!='\o';i++,j++)
      {
        if(s[k].line[i]==' ')
        {
          t[j]='\o';
          j=-1;
          check(t);
        }
       else
         t[j] = s[k].line[i];
     }
       t[j]='\o';
       j=0;
      check(t);
  }
while(strcmpi(s[k].line,"End"));
getch();
}
]]> http://electrofriends.com/source-codes/software-programs/c/c-advanced-programs/c-program-for-pass-1-assembler/feed/ 11