Convert the hex to binary, Operating System

Assignment Help:

  Convert the following from hex to binary and draw it on the memory map.

    RAM    = 0000 -> 00FF
    EPROM = FF00  -> FFFF

Answer:

  0000  0000 0000  0000 (0)    RAM start

  0000  0000  1111  1111 (255 byte)  RAM stop

  1111  1111  0000  0000 (63.75K)   Eprom start

  1111  1111  1111  1111 (64K)   Eprom stop
 
  The memory map is shown below:-

1646_Convert the hex to binary.png

  Due to the tri-state nature of the I.C's (Ram, Rom etc.) they may be placed in parallel and 'turned on ' when they are required. This process is termed decoding. There are two types of   decoding:-
 
    1. Partial decoding
    2. Absolute decoding


Related Discussions:- Convert the hex to binary

Changing the runlevel of system from 5 to 3 on startup, Front page We n...

Front page We need to continue or customization and documentation of our system. Currently our system boots into runlevel 5 and we need it to boot into runlevel 3. For future r

What is the use of boot block, What is the use of boot block? For a com...

What is the use of boot block? For a computer to begin running when powered up or rebooted it requires having an initial program to run. This bootstrap program tends to be easy

Define segmentation, Define Segmentation  The memory allocation method...

Define Segmentation  The memory allocation method subject to “external” fragmentation is Segmentation.

Batch system, what is a batch system give me answer in simple words so that...

what is a batch system give me answer in simple words so that i can understand

MULTITASKING, EXPLAIN MULTITASKING IN DETAIL

EXPLAIN MULTITASKING IN DETAIL

Conservative garbage collection, Conservative GC can be used for languages ...

Conservative GC can be used for languages such as C and C++, which were not explicitly designed for garbage collection. This is a non-copying technique. A conservative garbage coll

Define seek time and latency time, Define seek time and latency time. T...

Define seek time and latency time. The time taken by the head to move to the appropriate cylinder or track is known as seek time. Once the head is at right track, it must wait

What is a reference string, What is a reference string? An algorithm is...

What is a reference string? An algorithm is evaluated by running it on a particular string of memory references and computing the number of page faults. The string of memory re

What are the various disk-scheduling algorithms, What are the various disk-...

What are the various disk-scheduling algorithms? The several disk-scheduling algorithms are a. First Come First Served Scheduling b. Shortest Seek Time First Scheduling

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