Solution:
It is important because, it has to do operation on so without, data structures and algorithms.
It performs these operation:
1)Take an input
2) Process it
3) Give back the output.
The input can be in any form, for ex while searching for directions on google maps, the starting point and the destination as input to google maps, while logging in to any social sites, We have to give our email and password as input and so on.
Similarly, in the third step, the computer application gives us output in some form or the other.
To make this process efficient, we need to optimize all the three steps.
There are alot of parts in a computer system. You have to be a little specific
Answer:
M1 is equal to $ 4 trillion
Explanation:
M1 money supplies are liquid money supplies like cash, checkable deposits, traveler's check etc. It is equal to;
M1= coins and currency in circulation + checkable (demand) deposit + traveler's check.
M2 money supply are less liquid and is equated as;
M2 = M1 + savings deposit + money market fund + certificates of deposit + other time deposits.
Savings = $7 trillion
Checkable deposit = $3 trillion
Money market fund = $1 trillion
Currency = $1 trillion
Certificates of deposit = $1 trillion
M1 = currency + checkable deposit
= $1 + $ 3
= $4 trillion.
Answer: clip art
Explanation:
- The clip arts are graphic images that are pre-made illustrations for the purpose of creating any medium (designs or art).
- It has no restrictions to use them, it can be used by anyone, hence its copyright-free.
- It comes in both electronic and printed form.
- But mostly they are designed and distributed and used by a person in an electronic form.
Hence, the complete statement is "Pre-made, copyright-free illustrations are called <u>clip art</u>".
Answer:
The answer is A
Explanation:
Basically, Shortest job first (SJF) is a scheduling policy that selects jobs on queue for execution within a short execution time.
From the definition of SJF above, it means that there are a lot of process on queue and the (SJF) job is to receive processes on queue to execute within a short execution time.
Therefore, if all the jobs or process arrives at the SJF at the same time, the SJF will forfeit one of its major purpose which is scheduling of jobs.
That will therefore not make Non-preemptive Shortest Job First (SJF) not function at its optimal point.
