Interested to Buy Any Domain ? << Click Here >> for more details...
what is the little endian and big endian?
- 1 Answers
- 3999 Views
- I also Faced
- E-Mail Answers
Answer / preeti singh
Little endian and big endian refer to the order in which
sequence of bytes are stored in computer memory. Big-endian
is the order in which the most significant byte is stored
first in the memory (at lowest storage address). Whereas
Little-endian is the order in which the least significant
byteis stored first in the memory. For e.g. in a big-endian
computer the hexadecimal number 3AFB would be stored as 3AFB
in memory (3A at memory address 4000 and FB at memory
address 4001), whereas in little endian the same hexadecimal
number 3AFB will be stored as FB3A (FB at memory address
4000 and 3A at memory address 4001)
| Is This Answer Correct ? | 4 Yes | 0 No |
What is bubble sort technique in c?
write a program to reverse a every alternetive words in a string in a place. EX: Input is "this is the line of text" Output should be "shit is eht line fo text" Please any one tell me code for that.
What are header files why are they important?
What is output redirection?
what is the associativity of bitwise OR operator?
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.
Example of friendly function in c++
What is quick sort in c?
Explain About fork()?
what is difference between array of characters and string
What does d mean?
Why is C called a middle-level language?
C 
