Add 2 64 bit numbers on a 32 bit machine
- 3 Answers
- 16408 Views
- EMC, Hyderabad Central University, NetApp, I also Faced
- E-Mail Answers
Answers were Sorted based on User's Feedback
Answer / ravi
add 32 bit part of each number first and and then other
32 bit part use the carry register as well in the process
| Is This Answer Correct ? | 55 Yes | 3 No |
What are the different types of errors?
What is %d called in c?
WHAT IS LOW LEVEL LANGUAGE?
What is alloca() and why is its use discouraged?
Can variables be declared anywhere in c?
#include<stdio.h> int main(){ int a[]={1,2,3,5,1}; int *ptr=a+4; int y=ptr-a; printf("%d",y); }
Write a code to generate a series where the next element is the sum of last k terms.
FORMATTED INPUT/OUTPUT functions are a) scanf() and printf() b) gets() and puts() c) getchar() and putchar() d) all the above
what do you mean by enumeration constant?
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 }
When should a type cast be used?
What 'lex' does?
C 
