Answer:
Operating system is the software that is used to control different hardware of computers and handle scheduled tasks.
It also handles the interrupts from some external devices, or from some software. The interrupts are handled through Interrupt service routine. When some external event occurs the following steps has been taken by OS to perform the operation
- In first step, an external event has been occurred, and request to the cpu to perform operation.
- This request invoke ISR (Interrupt service routine), to perform the operation.
- The interrupts are stored in stack on the priority basis.
- The CPU performs the operation on Interrupt as per request of ISR.
- After Completing operation, CPU return to its initial task.
C. Integrate is the answer PLZ MARK AS BRAINLIEST
Answer:
The answer to this question is the option "B".
Explanation:
In this question, the answer is option B which is 1,000 because the kernel is a central part of an operating system. kernel manages the computer and the hardware operations. most especially memory and CPU time. It also sheared a memory variable is allocated to thread blocks. That's why the answer to this question is 1,000.
<span>Answer - Hotspots</span>
<span>
</span>
<span>Public places where you can wirelessly
connect to the internet are known as Wi-Fi hotspots. Common Wi-Fi hotspot locations
(where wireless internet connection is offered) include such places as cafes,
hotels, airports, and libraries. These businesses usually create hotspots for
the use of their customers.</span>
Answer: True
Explanation:
Subset sum problem and Knapsack problem can be solved using dynamic programming.
In case of Knapsack problem there is a set of weights associative with objects and a set of profits associated with each object and a total capacity of knapsack let say C. With the help of dynamic programming we try to include object's weight such that total profit is maximized without fragmenting any weight of objects and without exceeding the capacity of knapsack, it is also called as 0/1 knapsack problem.
Similar to knapsack problem, in subset sum problem there is set of items and a set of weights associated with the items and a capacity let say C, task is to choose the subset of items such that total sum of weights associated with items of subset is maximized without exceeding the total capacity.
On the basis of above statements we can say that subset sum problem is generalization of knapsack problem.
