Answer:
b) A separate part of the program that performs a specific task.
Explanation:
A subroutine is a portion of the program that can be invoked to perform a specific task. Typically, it performs that task and returns execution control to the point immediately following its invocation. It may or may not maintain "history" or "state", and it may or may not throw exceptions.
A well-behaved subroutine will only operate on data passed to it, will not maintain any internal history or state, and will have only one exit.
Answer:
Google Drive
Explanation:
It is best he uses the Google Drive to shredded the video with his customers. He may choose to compress the file first using winZip, 7zip or zip softwares. The steps are highlighted below:
-On your computer, go to drive.google.com.
-Open or create a folder.
-To upload files and folders, drag them into the Google Drive folder.
-Share the link to your drive.
(...and remember to share password if folder is encrypted).
Cheers.
Meghan signs into zoom to attend a video call for her online class. She is using a SaaS cloud service.
What is cloud service?
A variety of services that are provided to businesses and customers on demand over the internet are referred to as "cloud services." With no internal infrastructure or hardware required, these services are intended to offer quick, economical access to resources and applications.
What is the main purpose of cloud services?
Access to computing resources and IT services should be simple and scalable, whether the cloud is private or public. The hardware and software elements necessary for the efficient use of a cloud computing architecture are included in cloud infrastructure.
What is a SaaS cloud service?
Using the software as a service (SaaS) paradigm, a cloud provider hosts programs and makes them accessible to customers online. The program will be hosted by a third-party cloud provider under this arrangement, which an independent software vendor (ISV) may agree to. Or the cloud provider may double as the software vendor for major organizations like Microsoft.
Learn more about cloud service: brainly.com/question/11014710
#SPJ4
Answer:
Greedy is an algorithmic paradigm that builds up a solution piece by piece, always choosing the next piece that offers the most obvious and immediate benefit. Greedy algorithms are used for optimization problems. An optimization problem can be solved using Greedy if the problem has the following property: At every step, we can make a choice that looks best at the moment, and we get the optimal solution of the complete problem.
If a Greedy Algorithm can solve a problem, then it generally becomes the best method to solve that problem as the Greedy algorithms are in general more efficient than other techniques like Dynamic Programming. But Greedy algorithms cannot always be applied. For example, the Fractional Knapsack problem (See this) can be solved using Greedy, but 0-1 Knapsack cannot be solved using Greedy.
The following are some standard algorithms that are Greedy algorithms.
1) Kruskal’s Minimum Spanning Tree (MST): In Kruskal’s algorithm, we create an MST by picking edges one by one. The Greedy Choice is to pick the smallest weight edge that doesn’t cause a cycle in the MST constructed so far.
2) Prim’s Minimum Spanning Tree: In Prim’s algorithm also, we create an MST by picking edges one by one. We maintain two sets: a set of the vertices already included in MST and the set of the vertices not yet included. The Greedy Choice is to pick the smallest weight edge that connects the two sets.
3) Dijkstra’s Shortest Path: Dijkstra’s algorithm is very similar to Prim’s algorithm. The shortest-path tree is built up, edge by edge. We maintain two sets: a set of the vertices already included in the tree and the set of the vertices not yet included. The Greedy Choice is to pick the edge that connects the two sets and is on the smallest weight path from source to the set that contains not yet included vertices.
4) Huffman Coding: Huffman Coding is a loss-less compression technique. It assigns variable-length bit codes to different characters. The Greedy Choice is to assign the least bit length code to the most frequent character. The greedy algorithms are sometimes also used to get an approximation for Hard optimization problems. For example, the Traveling Salesman Problem is an NP-Hard problem. A Greedy choice for this problem is to pick the nearest unvisited city from the current city at every step. These solutions don’t always produce the best optimal solution but can be used to get an approximately optimal solution.
DPI (Dots per inch), which is the resolution/detail that the printer can print.
Paper size, as you may want to print on a large range of media
Paper type, as conventional printers would print on standard paper, whilst different uses, such as photography, would benefit from printing on higher quality photo paper.
Connectivity, this can range from wireless over WiFi or Bluetooth, wired over Ethernet or USB, or even where you may have to connect a USB/SD card directly into the printer. All of these data transmission solutions would result in their own constraints and benefits.
