Answer:
yes
Explanation:
it provides a design approach to a specific type of problem
Answer:
polynomial-bounded algorithms
Explanation:
There are two algorithm complexities and they are time and space complexities. They can be denoted with the big-O notation. The big-o notation for a time and space complexity gets the worst-case time and space respectively.
The time complexity gets the measure of the execution time of an algorithm. When the time function is a polynomial ( k^n + k^n-1 ...) then the algorithm is said to be a polynomial-bounded algorithm.
Answer: personal area network
Explanation:
it can connect personal devices to make network, the personal network are phone,laptop,printer and soon in order to communicate.
To post a picture you just need to click on the clipper looking thing
Answer: Information MIS infrastructure
Explanation: Information MIS infrastructure is the company model that is used for supporting the task functioning . The main aim of this tool is to be used in backing -up , plan of diasater recovery and plan of business continuity.
These objectives are achieved by availability, portability , scalability , accessibility, maintainability etc characteristic. Francis is also involved in information MIS infrastructure by maintaining the payroll, records,history of employment etc, securing the information,etc.
