I'm pretty sure it's D. Provide discount software for the underprivileged.
Answer:
message confidentiality
Two or more hosts communicate securely, typically using encryption. The communication cannot be monitored (sniffed) by non trusted hosts. The communication between trusted parties is confidential.
message integrity
The message transported has not been tampered with or altered. A message has integrity when the payload sent is the same as the payload received.
Sending a message confidentially does not guarantee data integrity. Even when two nodes have authenticated each other, the integrity of a message could be compromised during the transmission of a message.
Yes, you can have integrity of a message without confidentiality. One can take a hash or sum of the message on both sides to compare. Often we share downloadable files and provide data integrity using md5 hash sums.
Explanation:
Answer:
Goal-based decision making is goal generation together with goal-based planning
This decomposition of decision making in goal generation and planning raises several
questions, such as:
– How to represent beliefs? How to represent obligations? In this paper we represent
beliefs and obligations by rules, following the dominant tradition in deontic logic
(see e.g. [26,27]).
– How to develop a normative decision theory based on belief and obligation rules?
In this paper we introduce a qualitative decision theory, based on belief (B) and
obligation (O) rules.
Answer:
A. 31 bits
B. 13 bits, 18 bits
C. 256k
Explanation:
A.
We have total size of physical memory as 2gb
This means that 2¹ x 2³⁰
Using the law of indices,
= 2³¹
So physical address is equal to 31 bits
B.
We get page size = 8kb = 2³
1 kb = 2¹⁰
2³ * 2¹⁰ = 2¹³
So page replacement = 13 bits
Page frame number
= physical address - replacement bits
= 31 - 13
= 18 bits
C.
The number of frames is given as
2¹⁸ = 2⁸ x 2¹⁰ = 256K
So number of frames = 256K
D
Logical add space is 256K
Page size= physical pages = 8kb
Logical address layout= 28biys
Page number = 15 bits
Displacement = 12 bits
256k/8k = 32 pages in address space process