Answer:A) SQS
Explanation: Simple Queue Service (SQS) is Amazon based service that deals in queue that decouples the micro-services infrastructure or applications.It has the benefit of maintaining of the security, eliminating complexity, transmitting the data reliably etc.
It also provides the service of the storing the message, storing it and other functioning without the integrity in its security or any other resource need.Thus, option(a) is the correct option.
Answer:
These changes has the ability to decrease the size of a program, it
can do so by going ahead to reduce the instances in which the register contents “spill” into other registers or memory, it also does so by allowing more complex operations to be implemented in one instruction as agianst requiring multiple instructions.
On the other hand they are likely able to increase the size of a program by requiring adding bits to the opcode and register fields, thereby increasing memory width
Explanation:
See answer
Answer:
To communicate effectively, you need to avoid distractions and stay focused. Inconsistent body language. Nonverbal communication should reinforce what is being said, not contradict it. If you say one thing, but your body language says something else, your listener will likely feel that you're being dishonest.
Answer:
The symbols may or may not have meaning, but the machine does not need to know how the symbols are interpreted in order to manipulate the symbols in the right way.
Explanation:
The computer can change the symbols in the case when the computer understand but in actual following the cut-paste rules without having any understanding this is because the symbols might be have meaning or not but if we talk about the machine so actually they dont know how the symbols are interpreted and how it can be used so that it can be change in the accurate way
Answer: True
Explanation:
A language is said to be closed under a operation here the complement is the operation then if upon application of that operation to any members of that language always yields a member of that language.
regular languages are closed under complement. A proof of the statement is
If a regular language 'L' is regular then there is a DFA X recognizing that regular language 'L'. to show that L' (compliment) is regular we need to have another DFA X' recognizing L'.
The initial state and transition function of both the DFAs are same except their accepting state. Then we can say that X' accepts L'.
So, we can say that regular languages are closed under complement.
