Answer:
Option b is correct answer.
Explanation:
The connotative meaning is a word's implied or secondary meaning, in addition to its literal meaning.
Connotative meaning gives an idea or a feel that invokes for a person other than literal context of the word.
Connotation tells us weather the word used is in positive context or the negative one. For example, the words childish and youthful have same denotations but connotative meaning of childish is negative while youthful lies in positive context.
i hope it will help you.
Answer:
The complete Matlab code along with step by step explanation is provided below.
Matlab Code:
function Req=ParallelR(Number)
Number=input('Please enter the number of resistors: ');
if Number>10 | Number<=0
disp('Invalid input')
return
end
R=0;
for i=1:Number
r=input('Please enter the value of resistor: ');
R=R+1/r;
end
Req=1/R;
end
Explanation:
Parallel resistance is given by
First we get the input from the user for how many parallel resistors he want to calculate the resistance.
Then we check whether the user has entered correct number of resistors or not that is from 1 to 10 inclusive.
Then we run a for loop to get the resistance values of individual resistors.
Then we calculated the parallel resistance and keep on adding the resistance for N number of resistors.
Output:
Test 1:
Please enter the number of resistors: 3
Please enter the value of resistor: 10
Please enter the value of resistor: 20
Please enter the value of resistor: 30
ans = 60/11
Test 2:
Please enter the number of resistors: 11
Invalid input
Test 3:
Please enter the number of resistors: 0
Invalid input
B- find and replace can replace any word in the document with another.
Answer:
Firewalls, Antiviruses, Malware, Antispyware,
Explanation:
Answer:
C. FIFO
Explanation:
The first-in, first-out (FIFO) page replacement algorithm is a low-overhead algorithm that requires work on the part of the operating system. On a page fault, the frame that has been in memory the longest is replaced.
Using FIFO algorithm implies that
a page which was brought into memory first will be removed first since variable was initialized very early. it is in the set of first in pages that will be removed.
It is the simplest page replacement algorithm. The operating system keeps track of all pages in the memory in a queue, the oldest page is in the front of the queue. When a page needs to be replaced page in the front of the queue is selected for removal that is first in first out.
A memory page containing a heavily used variable that was initialized very early and is in constant use is removed, then the page replacement algorithm used is called First In First Out.
