Posts
 
Reputation
Joined
Last Seen
0 Reputation Points
Unknown Quality Score

No one has voted on any posts yet. Votes from other community members are used to determine a member's reputation amongst their peers.

0 Endorsements
~666 People Reached
Favorite Forums
Favorite Tags

5 Posted Topics

Member Avatar for abcd_nima

hai there!am a beginner in java.am familiar with c,c++ and object oriented programming principles.someone please suggest me a book or a student friendly site(online materials preffered) that i can refer to ,and improve my java skills.as a beginner i would also like to know the basic differences b/n c++ that …

Member Avatar for peter_budo
0
118
Member Avatar for abcd_nima

Is it possible for a function to return a string,an array of characters to the calling function? i mean something like char f1() { char www="nima"; return(www); } if not,please tell me how is this possible?

Member Avatar for ArkM
0
135
Member Avatar for abcd_nima

someone please help me to write a program that would replace all occurances of a substring in a string ,with a given string.if the input string is "the the the the",& if the substring to be deleted & the substring to be substituted are "th",&"ase" respectievely then the output should …

Member Avatar for Salem
0
101
Member Avatar for abcd_nima

iam a 1st yr b.e stucent.i was attending my c.p lab viva.i was asked to write a program that would exchange 2 variables without using a third variable.i could'nt do it.i know how to exchange the values by using a third variable.someone please answer this question.

Member Avatar for hammerhead
0
191
Member Avatar for baliw53

1)declare the 2-d array say a[3][3].initialisation can be done like this [code=c]for(i=0;i<=2;i++) { for(j=0;j<=2;j++) { scanf("%d",&a[i][j]); } } /*to print the sum of row elements*/ for(i=0;i<=2;i++) { s=0; for(j=0;j<=2;j++) { s=s+a[i][j]; printf("\t%d",s); } } /*to print the coloumn sum*/ for(j=0;j<=2;j++) { s=0; for(i=0;i<=2;i++) { s=s+a[i][j]; } }[/code] pls see to …

Member Avatar for baliw53
0
121

The End.