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

C Interview Questions
Questions Answers Views Company eMail

What is extern storage class in c?

1000

What is variables in c?

1054

What is null pointer constant?

1168

What does volatile do?

981

What is the difference between volatile and const volatile?

990

What is the use of volatile?

1083

When should volatile modifier be used?

1015

Can a variable be both constant and volatile?

1125

What is volatile variable how do you declare it?

1102

Where is volatile variable stored?

1089

What are lookup tables in c?

1005

What is a lookup table in c?

1124

What is table lookup in c?

1100

Can we increase size of array in c?

971

What is a dynamic array in c?

1161


Post New C Questions

Un-Answered Questions { C }

How do you view the path?

1128


At a shop of marbles, packs of marbles are prepared. Packets are named A, B, C, D, E …….. All packets are kept in a VERTICAL SHELF in random order. Any numbers of packets with these names could be kept in that shelf as in this example: bottom of shelf ---> [AAAJKRDFDEWAAYFYYKK]-----Top of shelf. All these packets are to be loaded on cars. The cars are lined in order, so that the packet could be loaded on them. The cars are also named [A, B, C, D, E,………….]. Each Car will load the packet with the same alphabet. So, for example, car ‘A’ will load all the packets with name ‘A’. Each particular car will come at the loading point only once. The cars will come at the loading point in alphabetical order. So, car ‘B’ will come and take all the packets with name ‘B’ from the shelf, then car ‘C’ will come. No matter how deep in the shelf any packet ‘B’ is, all of the ‘B’ packets will be displaced before the ‘C’ car arrives. For that purpose, some additional shelves are provided. The packets which are after the packet B, are kept in those shelves. Any one of these shelves contains only packets, having the same name. For example, if any particular shelf is used and if a packet with name X is in it, then only the packets having names X will be kept in it. That shelf will look like [XXXXXXX]. If any shelf is used once, then it could be used again only if it is vacant. Packets from the initial shelf could be unloaded from top only. Write a program that finds the minimum total number of shelves, including the initial one required for this loading process.

2189


Which one would you prefer - a macro or a function?

1087


Is c pass by value or reference?

1041


Which programming language is best for getting job 2020?

1052


What is a protocol in c?

1009


Why do we write return 0 in c?

1063


What is the process of writing the null pointer?

1028


What is static and volatile in c?

1226


Is it possible to execute code even after the program exits the main() function?

1342


If you know then define #pragma?

1108


how to count no of words,characters,lines in a paragraph.

4430


Calculate 1*2*3*____*n using recursive function??

2042


Is it better to bitshift a value than to multiply by 2?

1094


Do pointers need to be initialized?

1086