Answer / amit khurana

#include<stdio.h>
#include<conio.h>
#include<string.h>
void main()
{
char arr[10]={0},x[1000],y[10][100],i,j,k=1,count=0,a1;
int l,a,temp;
clrscr();
gets(x);
l=strlen(x);
for(i=0;i<=l;i++)
{
if(x[i]==' '&&count==0)
{
for(j=0;j<=i-1;j++)
y[0][j]=x[j];
y[0][j]='\0';
a=i+1;
count++;
}
else if(x[i]==' ')
{
for(a1=0,j=a;j<=i-1;j++,a1++)
y[k][a1]=x[j];
y[k][a1]='\0';
a=i+1;
k++;
}
else if(x[i]=='\0')
{
for(a1=0,j=a;j<=i-2;j++,a1++)
y[k][a1]=x[j];
y[k][a1]='\0';
a=i+1;
k++;
}
}
for(i=0;i<=k-2;i++)
{
for(j=i+1;j<=k-1;j++)
{
if(strcmp(y[i],y[j])==0)
arr[i]++;
}
}
temp=arr[0];
for(i=1;i<=9;i++)
if(temp<arr[i])
temp=arr[i];
for(i=0;i<=9;i++)
if(temp==arr[i])
break;
printf("maximum repeated string is %s",y[i]);
getch();
}

How many types of functions are there in c?

0 Answers  

---

Are the variables argc and argv are always local to main?

0 Answers  

---

1.What is a Data Structure? Explain its need? 2.What is a Directed Graph? Write an algorithm to find whether a Directed Graph is connected or not? 3.Explain the process of converting a Tree to a Binary Tree.

4 Answers   Ignou, TCS,

---

What are keywords c?

0 Answers  

---

code for selection sort?

1 Answers  

---

What’s the special use of UNIONS?

0 Answers   ADP,

---

what is diference between return 0 and return NULL??

3 Answers  

---

Write a program to generate a pulse width frequency of your choise,which can be variable by using the digital port of your processor

0 Answers   TATA, TCS,

---

Why is struct padding needed?

0 Answers  

---

Is linux written in c?

0 Answers  

---

what is the diffrenet bettwen HTTP and internet protocol

0 Answers  

---

What is the meaning of this decleration? unsigned char (*pArray[10][10]); please reply.

1 Answers  

---