Interested to Buy Any Domain ? << Click Here >> for more details...
Which command is more efficient?
*(ptr+1) or ptr[1]
- 3 Answers
- 7596 Views
- I also Faced
- E-Mail Answers
Answer Posted / priya
*(ptr+1)
| Is This Answer Correct ? | 5 Yes | 2 No |
Post New Answer View All Answers
Explain how are portions of a program disabled in demo versions?
Write a C program to help a HiFi’s Restaurant automate its breakfast billing system. Your assignment should implement the following items: a. Show the customer the different breakfast items offered by the HiFi’s Restaurant. b. Allow the customer to select more than one item from the menu. c. Calculate and print the bill to the customer. d. Produce a report to present your complete program and show more sample output. Assume that the HiFi’s Restaurant offers the following breakfast menu: Plain Egg $2.50 Bacon and Egg $3.45 Muffin $2.20 French Toast $2.95 Fruit Basket $3.45 Cereal $0.70 Coffee $1.50 Tea $1.80
Explain the term printf() and scanf() used in c language?
What is the ANSI C Standard?
what are the program that using a two dimensional array that list the odd numbers and even numbers separately in a given 10 inputs values
Explain how do you view the path?
What is hash table in c?
Write a program to swap two numbers without using a temporary variable?
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.
What is a char c?
Explain what is the difference between a free-standing and a hosted environment?
What are the types of data files?
What is d scanf?
HOW TO SOLVE A NUMERICAL OF LRU IN OS ??????
What is atoi and atof in c?
