Comments for The Code Cracker

Comment on Dining Philosophers Problem by awana

awana — Wed, 02 May 2012 06:49:52 +0000

Thanks a lot, great code!

Comment on Open Hashing Modular Technique by deepikareddy

deepikareddy — Fri, 27 Apr 2012 07:02:20 +0000

very bad

Comment on Change Case in C by Bihan

Bihan — Sat, 07 Apr 2012 07:29:59 +0000

#include
#include
#include

main(){
char a[100];
int l,i,t[100];
printf(“Enter the string: “);
scanf(“%[^\n]” ,&a);/*READING STRING FROM KEYBOARD*/
l= strlen(a);
for (i=0;i96 && t[i]64 && t[i]<91)
t[i]= t[i]+32;

}
printf("The word in changed case: ");

for (i=0;i<=l;i++)/*Printing the word*/
{
a[i] = t[i];
printf("%c" ,a[i]);
}

getch();

}

Comment on Program to find HCF and LCM by shravanskie

shravanskie — Thu, 05 Apr 2012 11:32:53 +0000

thanks a lottttttt …..

Comment on Program to find HCF and LCM by shravanskie

shravanskie — Thu, 05 Apr 2012 11:31:53 +0000

thnks a lot guys :p………..

Comment on BFS and DFS by amit

amit — Mon, 02 Apr 2012 03:38:31 +0000

it is really very tough to read this code. please improve your skills. use better variable names and please write explanatory comments.

Comment on Matrix Inverse Code as Module using Pointers by fienefie

fienefie — Fri, 30 Mar 2012 05:17:34 +0000

where is the InvMat.h?

Comment on C Program for Circular Linked List by GURU

GURU — Wed, 28 Mar 2012 13:01:37 +0000

god program but to display list, usless using while we can also use do..while….coz it will save one line of code n will also print contain of list is there is only one node in list….

Comment on traversing a graph through BFS and DFS by GURU

GURU — Wed, 28 Mar 2012 12:55:02 +0000

buddy the code fails when i m using following graph :
total nodes : 7
node pairs:
1,3
1,5
1,8
3,6
5,6
8,9
6,7
9,7

although its a valid graph…..i hav asignment of this graph…
will u help me?????

Comment on Dining Philosophers Problem by madhav

madhav — Wed, 28 Mar 2012 07:54:34 +0000

Where can i get the Algorithm for this programs