Answer:
%Program prompts user to input vector
v = input('Enter the input vector: ');
%Program shows the value that user entered
fprintf('The input vector:\n ')
disp(v)
%Loop for checking all array elements
for i = 1 : length(v)
%check if the element is a positive number
if v(i) > 0
%double the element
v(i) = v(i) * 2;
%else the element is negative number.
else
%triple the element
v(i) = v(i) * 3;
end
end
%display the modified vector
fprintf('The modified vector:\n ')
disp(v)
Answer:
attached below is the detailed solution and answers
Explanation:
Attached below is the detailed solution
C(iii) : versus the parameter C
The parameter C is centered in a nonlinear equation, therefore the standard locus will not apply hence when you use a polynomial solver the roots gotten would be plotted against C
Answer:
See explaination
Explanation:
Please kindly check attachment for the step by step solution of the given problem
Answer:
At the point when the quantity of bit strings is not exactly the quantity of processors, at that point a portion of the processors would stay inert since the scheduler maps just part strings to processors and not client level strings to processors. At the point when the quantity of part strings is actually equivalent to the quantity of processors, at that point it is conceivable that the entirety of the processors may be used all the while. Be that as it may, when a part string obstructs inside the portion (because of a page flaw or while summoning framework calls), the comparing processor would stay inert. When there are more portion strings than processors, a blocked piece string could be swapped out for another bit string that is prepared to execute, in this way expanding the use of the multiprocessor system.When the quantity of part strings is not exactly the quantity of processors, at that point a portion of the processors would stay inert since the scheduler maps just bit strings to processors and not client level strings to processors. At the point when the quantity of bit strings is actually equivalent to the quantity of processors, at that point it is conceivable that the entirety of the processors may be used at the same time. Be that as it may, when a part string hinders inside the piece (because of a page flaw or while summoning framework calls), the relating processor would stay inert. When there are more portion strings than processors, a blocked piece string could be swapped out for another bit string that is prepared to execute, along these lines expanding the usage of the multiprocessor framework.
