Conversion of binary to hex, Operating System

Assignment Help:

Take the binary number and divide it into groups of 4 bits starting from the right hand side , if no group of 4 exists fill out leading 0's, then convert each group of 4 to a hex number directly e.g. 
 
      11111102 -> hex direct
      111   1110 add leading zero
      0111   1110
 
      111  -> 7H
 
      1110 -> 1410 ->EH
 
      11111102 -> 7EH
 
This is easily achieved in reverse by converting hex straight to binary i.e. divide the hex number into single hex digits from the right hand side and convert to binary each digit e.g.
 
    7EH -> binary direct
 
        7 -> 1112
 
        E -> 1410 ->11102
 
        7EH -> 11111102


Related Discussions:- Conversion of binary to hex

What are the methods for handling deadlocks, What are the methods for handl...

What are the methods for handling deadlocks? The deadlock problem can be dealt with in one of the three ways: a. Use a protocol to prevent or avoid deadlocks, ensuring that

Deadlock prevention, While it is hard to resolve a deadlock which has been ...

While it is hard to resolve a deadlock which has been detected, fortunately it is fairly easy to prevent deadlocks from ever happening. The key is that the conditions above for dea

Online Q & A System, It uses unix commands such as forks and pipe .I need s...

It uses unix commands such as forks and pipe .I need solution to this project

What are the three main activities of an operating system, What are the thr...

What are the three main activities of an operating system in regard to memory management? Keep track of which parts of memory are now being used and by whom. Decide which pr

Define properties of distributed operating system, Define properties of Dis...

Define properties of Distributed operating system Distributed:- This system distributes computation among several physical processors. The processors do not share memory or a

Define request edge and assignment edge, Define request edge and assignment...

Define request edge and assignment edge. Answer:  A directed edge from process Pi to resource type R j is denoted by Pi->j; it signifies that process Pi requested an instance

Explain hierarchical paging method, Hierarchical paging method Most mo...

Hierarchical paging method Most modern computer systems maintain a large logical-address space. In this situation the page table itself turns into excessively large. To remedy

Describe swapping technique in unix systems, Describe swapping technique in...

Describe swapping technique in UNIX systems. Swapping is used to control memory contention among processes. If there is excessively much memory contention, processes are swappe

Write Your Message!

Captcha
Free Assignment Quote

Assured A++ Grade

Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!

All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd