Latest Answer: Can we use logarithm."logarithm of a number-logarithm of 3".Taking antilog gives the result ...
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: First Question's Ans :Create a FIFO list of 4 digits.start from the root of the BST and keep on insrting the nodes in the FIFO till either there is no left subtree of the BST is left and the FIFO is not empty. IF FIFO is empty and there is not node ...
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: There are various Sorting techniques They are Internal and External Sorting.Various Internal sorting tecniques are as follows: Bubble sortInsertion sortSelection sortQuick sortMerge sortHeap sortRadix sortbucket sortShell sortFor small input ...
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
If a function y=f ( x ) has an inverse function, then f ( x ) cannot be 1. symmetric about x-axis 2. an odd function 3. symmetric about y-axis 4. an even function
View page << Previous 1 [2] 3 4 5 6 7 8 9 10 Next >>
Go Top
