Answer:
Internal:
#CPU; That retrieves &execute instructions.
#Modem; Modulates& demodulates electric signals.
#RAM;Gives application a place to store &access data on a short time periods.
External:
#Mouse; Transmits commands and controlling movements.
#Moniter; Device used to display video output from computer.
#Printer; Accepts text, graphics to the paper.
Explanation:
Hope this will help you.
Equal sign (=)
hope so !!!
The unique reason why assembler language is preferred to high level language is that It is said to be memory efficient and it is one that requires less memory.
<h3>Why is assembly language better than other kinds of high level?</h3>
It implies means that the programs that one uses to write via the use of high-level languages can be run easily on any processor that is known to be independent of its type.
Note that it is one that has a lot of better accuracy and an assembly language is one that carries out a lot of better functions than any high-level language, in all.
Note also that the advantages of assembly language over high-level language is in terms of its Performance and accuracy as it is better than high-level language.
Hence, The unique reason why assembler language is preferred to high level language is that It is said to be memory efficient and it is one that requires less memory.
Learn more about assembler language from
brainly.com/question/13171889
#SPJ1
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.
Answer:
PMPs are typically referred to interchangeably.
Explanation:
