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
- 1 Answers
- 2804 Views
- I also Faced
- E-Mail Answers
Answer Posted / md mastan
Based on priority (or) precedence.
answer:a
| Is This Answer Correct ? | 0 Yes | 0 No |
Post New Answer View All Answers
What is non linear data structure in c?
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.
List at least 10 sorting methods indicating their average case complexity, worst case complexity and best case complexity.
When is the “void” keyword used in a function?
how to print the character with maximum occurence and print that number of occurence too in a string given ?
Explain how can I remove the trailing spaces from a string?
How do I swap bytes?
How are Structure passing and returning implemented by the complier?
a value that does not change during program execution a) variabe b) argument c) parameter d) none
What are c preprocessors?
Write a program to compute the similarity between two strings - The program should get the two strings as input - Then it will output one single number which is the percentage of similarity between the two strings
A routine usually part of the operation system that loads a program into memory prior to execution a) linker b) loader c) preprocessor d) compiler
What do you mean by Recursion Function?
How do c compilers work?
What are logical errors and how does it differ from syntax errors?
