Golgappa.net | Golgappa.org | BagIndia.net | BodyIndia.Com | CabIndia.net | CarsBikes.net | CarsBikes.org | CashIndia.net | ConsumerIndia.net | CookingIndia.net | DataIndia.net | DealIndia.net | EmailIndia.net | FirstTablet.com | FirstTourist.com | ForsaleIndia.net | IndiaBody.Com | IndiaCab.net | IndiaCash.net | IndiaModel.net | KidForum.net | OfficeIndia.net | PaysIndia.com | RestaurantIndia.net | RestaurantsIndia.net | SaleForum.net | SellForum.net | SoldIndia.com | StarIndia.net | TomatoCab.com | TomatoCabs.com | TownIndia.com
Interested to Buy Any Domain ? << Click Here >> for more details...


How can I ensure that integer arithmetic doesnt overflow?


No Answer is Posted For this Question
Be the First to Post Answer

Post New Answer

More C Interview Questions

What is static and volatile in c?

0 Answers  


What is operator precedence?

0 Answers  


What are pointers really good for, anyway?

0 Answers  


What is a segmentation fault?

2 Answers  


What is a function simple definition?

0 Answers  


what are the facialities provided by you after the selection of the student.

0 Answers   TCS,


6)swap(int x,y) { int temp; temp=x; x=y; y=temp; } main() { int x=2;y=3; swap(x,y); } after calling swap ,what are yhe values x&y?

3 Answers  


can we declare a function in side the structure?

2 Answers   HCL,


Define function ?Explain about arguments?

2 Answers   Geometric Software, Infosys,


what is the output of the program and explain why?? #include<stdio.h> void main ( ) { int k=4,j=0: switch (k) { case 3; j=300; case 4: j=400: case 5: j=500; } printf (ā€œ%d\nā€,j); }

14 Answers   Oracle,


Given an array A[n+m] of n+m numbers, where A[1] ... A[n] is sorted and A[n+1] ... A[n+m] is sorted. Design a linear time algorithm to obtain A[1...n+m] sorted using only O(1) extra space. Time Complexity of your algorithm should be O(n) and Space Complexity O(1).

0 Answers  


main() { float a=3.2e40; printf("%d",a); }

9 Answers   Satyam,


Categories