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...


what is different between auto and local static? why should we use local static?


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

Post New Answer

More C Interview Questions

enum { SUNDAY, MONDAY, TUESDAY, }day; main() { day =20; printf("%d",); getch(); } what will be the output of the above program

1 Answers  


What is n in c?

0 Answers  


Describe how arrays can be passed to a user defined function

0 Answers  


why we need function pointers?

3 Answers  


difference between Low, Middle, High Level languages in c ?

0 Answers   Bosch, Infosys,


What is the purpose of void in c?

0 Answers  


What are the advantages of Macro over function?

1 Answers  


Write a code to reverse string seperated by spaces i/p str=India is my country o/p str=aidnI si ym yrtnuoc After writing code, optimize the code

1 Answers  


Can u return two values using return keyword? If yes, how? If no, why?

7 Answers  


Write a C program to convert an integer into a binary string?

1 Answers  


Explain what is the benefit of using #define to declare a constant?

0 Answers  


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  


Categories