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

Explain about directory structure, Normal 0 false false fal...

Normal 0 false false false EN-IN X-NONE X-NONE MicrosoftInternetExplorer4

Explain fifo page replacement, FIFO page replacement This is the easie...

FIFO page replacement This is the easiest page replacement algorithm. At this juncture the 1 st page entering is the 1 st to leave that is the oldest page leaves. To execute

Write an equation for this seek time, Q. The accelerating search for descr...

Q. The accelerating search for described in subsequent exercise is typical of hard-disk drives. By contrast floppy disks and several hard disks manufactured before the mid-1980s t

Explain acyclic-graph directories, Acyclic-graph directories An acyclic...

Acyclic-graph directories An acyclic graph permits directories to have shared subdirectories and files. The similar file or subdirectory may be in two dissimilar directories. A

Operating system strectures, with the aid of diagrams describe the followin...

with the aid of diagrams describe the following os structures monolithic , layered, client server

Explain fifo page replacement, Explain FIFO page replacement A FIFO rep...

Explain FIFO page replacement A FIFO replacement algorithm associates with every page the time when that page was brought into memory. When a page must be changed, the oldest p

Calculate the average waiting time, Calculate the Average Waiting Time ...

Calculate the Average Waiting Time CPU burst time points out the time, the process needs the CPU. The subsequent are the set of processes with their respective CPU burst time (

What is turnaround time, What is turnaround time? Turnaround time is th...

What is turnaround time? Turnaround time is the interval from the time of submission to the time of completion of a process. It is the sum of the periods exhausted waiting to g

Explain about disk scheduling with neat diagram, Explain about disk schedul...

Explain about disk scheduling with neat diagram? FCFS Scheduling SCAN scheduling C-SCAN scheduling SSTF scheduling LOOK 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