Answer:
The correct answer to the following question will be "Θ(n2)
". The further explanation is given below.
Explanation:
If we're to show all the objects that exist from either the first as well as the second vector, though not all of them, so we'll have to cycle around the first vector, so we'll have to match all the objects with the second one.
So,
This one takes:
= 
And then the same manner compared again first with the second one, this takes.
=
Therefore the total complexity,
= Θ(n2)
Have a look at the man page for printf:
man 3 printf
Event is an action that causes something to happen
Answer:
a. new, running, waiting, ready, and terminated.
Explanation:
The process in a computer system can have different states and these are:
-New: When the process is created.
-Ready: When the process is waiting to be executed.
-Running: When the process is chosen to be executed.
-Waiting: When the process is expecting for something to happen.
-Terminated: When the process is not running anymore.
According to this, the answer is that the possible states of a process are: new, running, waiting, ready, and terminated.
