-
Data Structure - character that repeats itself
Given a string of characters (let us say there are about 100 characters or more in the string), what is the most efficient method to use for finding out the character that repeats itself the most?Is it possible for us to use some kind of data structure for this?, if this is so,which is the best one that needs to be used?
-
scanf("%s",&A.name);
printf("Enter your age: ");
scanf("%d",&A.age);
printf("Name=%s Age=%d",A.name,A.age);
}">What would be the output of the following progam?union check{ char name[10]; int age;}A;void main(){ printf("Enter your name: "); scanf("%s",&A.name);printf("Enter your age: "); scanf("%d",&A.age);printf("Name=%s Age=%d",A.name,A.age);}
-
function f(x) is continuous
The function f(x) is continuous in [0,1], such that f(0)=-1, f(1/2)=1 and f(1)=-1, We can conclude that 1. f attains the value zero at least twice in [0,1] 2. f attains the value zero exactly once in [0,1] 3. f is non-zero in [0,1] 4. f attains the value zero exactly twice in [0,1]