What is the diffences between Windows XP and Windows Visa
XP - works on 32 bit processor
Vista or Longhorn - 64 bit (recommended) for good
performance
Vista has a better GUI (Graphic User Interface) compared to
XP.
searches are more indexed than in XP.
--thats all i can remember for this moment.. hope it helps..
Regards,
Shruti
| Is This Answer Correct ? | 4 Yes | 1 No |
Print all numbers which has a certain digit in a certain position eg: number=45687 1 number=4 2 number=5 etc
what is compiler
4.weight conversion: Write a program that will read weight in pounds and convert it into grams.print both the original weight and the converted value.There are 454 grams in a pound.design and carry out a test plan for this program.
what is uses of .net
Why is c so powerful?
What is the difference between malloc() and calloc()?
Write a code to generate a series where the next element is the sum of last k terms.
You have given 2 array. You need to find whether they will create the same BST or not. For example: Array1:10 5 20 15 30 Array2:10 20 15 30 5 Result: True Array1:10 5 20 15 30 Array2:10 15 20 30 5 Result: False One Approach is Pretty Clear by creating BST O(nlogn) then checking two tree for identical O(N) overall O(nlogn) ..we need there exist O(N) Time & O(1) Space also without extra space .Algorithm ?? DevoCoder guest Posted 3 months ago # #define true 1 #define false 0 int check(int a1[],int a2[],int n1,int n2) { int i; //n1 size of array a1[] and n2 size of a2[] if(n1!=n2) return false; //n1 and n2 must be same for(i=0;i<n1-1;i++) { if( !( (a1[i]>a1[i+1]) && (a2[i]>a2[i+1]) ) ) return false; } return true;//assumed that each array doesn't contain duplicate elements in themshelves }
How do I access command-line arguments?
What are .h files and what should I put in them?
What is a file descriptor in c?
#define f(g,h) g##h main O int i=0 int var=100 ; print f ("%d"f(var,10));} what would be the output?