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


Hierarchy decides which operator

a) is most important

b) is used first

c) is fastest

d) operates on largest numbers



Hierarchy decides which operator a) is most important b) is used first c) is fastest d) ..

Answer / md mastan

Based on priority (or) precedence.
answer:a

Is This Answer Correct ?    0 Yes 0 No

Post New Answer

More C Interview Questions

explain what is a newline escape sequence?

0 Answers  


Is c still used in 2019?

1 Answers  


Is c is a procedural language?

0 Answers  


How will you allocate memory to double a pointer?

1 Answers  


How to write a multi-statement macro?

0 Answers  


write a program to input 10 strings and compare without using strcmp() function. If the character of one string matches with the characters of another string , sort them and make it a single string ??? example:- str1="Aakash" st2="Himanshu" str="Uday" output:- Aakashimanshuday (please post the answer as quickly as possible)

0 Answers   Google,


How pointer is benefit for design a data structure algorithm?

2 Answers  


Can you please explain the difference between strcpy() and memcpy() function?

0 Answers  


What are the average number of comparisons required to sort 3 elements?

2 Answers   DRDO,


Write the test cases for checking a variable having value in range -10.0 to +10.0?

0 Answers   Bosch,


print 1-50 with two loop & two print Statement

2 Answers  


There is a 100-story building and you are given two eggs. The eggs (and the building) have an interesting property that if you throw the egg from a floor number less than X, it will not break. And it will always brake if the floor number is equal or greater than X. Assuming that you can reuse the eggs which didn't broke; you got to find X in a minimal number of throws. Give an algorithm to find X in minimal number of throws.

5 Answers   Yahoo,


Categories