Answer:
for(String s:words)
if(s.endsWith("ing"))
System.out.println(s);
Explanation:
Create an enhanced for loop that iterates through the words array
Check if an element in words ends with "ing" using endsWith() method (Since it is said that strings are lowercase letters, we do not need to check it)
If you find one that ends with "ing", print the element
Answer:
The output is:
R
M
N
Explanation:
The code snippet print the beginning letter of each word in the given name.
In the for loop snippet:
first the program check if startWord is true and it is true, then it print the value of the character at index 0. Then it check if value of character is empty. If it is empty, startWord is initialized to true else it is initialized to false.
The loop only print a character when the value of i are 0, 8 and 11 which are also the beginning character of a word.
The answer in the space provided is the Diffie-Hellman Key
Exchange. This is entitled to be the first published key algorithm in which has
a limit in which the exchange occurs in secret values and that its purpose was
to enable two users to have an exchange of key in a secure manner in means of
using it for a subsequent symmetric encryption in terms of messages.
Answer:
b) Bounded Waiting
Explanation:
int currentThread = 1;
bool thread1Access = true;
bool thread2Access = true;
thread1 { thread2 {
While (true) {
While (true)
{
while(thread2Access == true)
{
while(thread1Access == true)
{
If (currentThread == 2) {
If (currentThread == 1)
{
thread1Access = false; thread2Access = false;
While (currentThread == 2);
While (currentThread == 1);
thread1Access = true; thread2Access = true;
} }
/* start of critical section */ /* start of critical section */
currentThread = 2 currentThread = 1
… ...
/* end of critical section */ /* end of critical section */
thread1Access = false; thread2Access = false;
… ...
} }
} }
} }
It can be seen that in all the instances, both threads are programmed to share same resource at the same time, and hence this is the bounded waiting. For Mutual exclusion, two threads cannot share one resource at one time. They must share simultaneously. Also there should be no deadlock. For Progress each thread should have exclusive access to all the resources. Thus its definitely the not the Progress. And hence its Bounded waiting.
Answer:
The correct Answer is (b) FSB
Explanation:
The chipset is the "superglue" that bonds the microprocessor to the rest of the motherboard and so to the rest of the computer. On a computer, it consists of two basic parts -- the Northbridge and the southbridge. All of the numerous modules of the computer communicate with the CPU over the chipset.
The northbridge joins straight to the processor via the front side bus (FSB). A memory controller is situated on the northbridge, which gives the CPU fast access to the memory. The northbridge also attaches to the AGP or PCI Express bus and to the memory himself.
