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
Latest Answer: There is no way for less that O(n) solution as we have to traverse the string atleast once.By traversing only once we can find the solutionKeep another variable which tracks the current highest occured character. ...
Latest Answer: void dvdby3(int n){int count=0,rem;while(n>0){rem=n;//remindern=n-3;count++;}} ...
I had following question paper for data structures on 29th Oct, 2007. There were total 10 questions in the engineering paper to be done in 1 hr. I remember only 9 of those:1. A binary search tree was given.
Latest Answer: Ans for 1: The node number 4 contains the 4th smallest value. ...
Latest Answer: Suppose we read a sentence using scanf e.g. "My name is ABC" in a string.Printing this string using a printf statement prints "My".Go for another successive scanf.It reads from the input stream... which still is having ...
Latest Answer: Definitionint * ii is definitionsince we can store a address without allocating memory*i is definition since we can assign *i = 4 ;Definitionchar *cc is definition since it can store a address of a character*c is definition since it can store a characterNow, ...
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);}
Latest Answer: On the contrary the volatile memory is the one which get washed off when power is swithched off eg. RAM. ...
These are some sorting techs,bubble sortquick sortinsertion sortselection sortmerge sortheap sorttell me any more sorting is found..... ad which is best....
Latest Answer: HEAP sort is the best algorithmO(n log n) time for best, avg and worst caseO(1) spacelet me know if any other sorting algorithm present if that exceeds the limit i gave ...
The anti-aliasing technique which allows shift of 1/4, 1/2 and 3/4 of a pixel diameter enabling a closer path of a line is 1. pixel phasing 2. filtering 3. intensity compensation 4. sampling technique
View page << Previous 1 2 [3] 4 5 6 7 8 9 10 Next >>
Go Top
