A. Its a method to confine users to one side of a boundary
B. It can protect operating system from one user
C. It cannot protect users from each other
D. All of the mentioned

A. It is implemented via hardware register
B. It doesn’t protect users from each other
C. It good to protect os from abusive users
D. Its implementation is unrestricted and can take any amount of space in operating system.

A. It is a process of taking a program as if it began at address 0
B. It is a process of taking a program as if it began at address 0a
C. Fence cannot be used within relocation process
D. All of the mentioned

A. To each program address, the contents of fence register are added
B. To contents of fence register is subtracted from actual address of program
C. To each program address, the contents of fence register are not added
D. None of the mentioned

A. We need two registers one €?start’ and other €?end’
B. We need a variable register
C. A fence register has to be used known as base register.
D. None of the mentioned

A. They give starting address to a program
B. Program’s addresses are neatly confined to space between the base and the bound registers
C. They provide encrypted environment
D. This technique doesn’t protects a program’s address from modification by another user

A. Program makes all its data available to be accessed
B. It prohibits access to some
C. It creates rules who can access program memory
D. It separates program memory and data memory

A. Base/bound
B. Relocation technique
C. Fence method
D. Tagged architecture

A. Every word of machine memory has one or more extra bits
B. Extra bits are used to do padding
C. Extra bits are not used to identify rights to that word
D. It is very compatible to code upgrades

A. Tagged architecture
B. Segmentation
C. Fence method
D. None of the mentioned