Answer:
Canvas.
Explanation:
The canvas API is used to create a place where you can display graphics on a webpage. You can also display video,games and animations there on the fly .You can do this without the need for a plug-in.
It is largely focused on 2-D graphics.This API uses canvas element of HTML.
<canvas>....</canvas>.
1. <u>Comments</u> notes that can be attached to cells to add additional information that is not printed on the worksheet network drive.
2. <u>Footer</u> text and/or graphics that print at the bottom of each page headers.
3. <u>Headers</u> text and/or graphics that print at the top of each page rows.
4. <u>Margins</u> the white space left around the edges of the paper when a worksheet is printed comments.
5. <u>Network drive</u> location at a workplace for storing computer files footer.
6. <u>Rows</u> go across (horizontal) margins.
7. <u>Template</u> a file format used to create new files that contain the same data as the template.
<u>Explanation:</u>
On the off chance that you need to add a header or footer to all sheets, select each sheet by right-clicking one of the sheet tabs at the base of the Excel screen and clicking "Select All Sheets" in the spring up menu. It's genuinely basic to put an Excel header on all pages of all worksheets in your record.
A header is a line of content that shows up at the highest point of each page of a printed worksheet. You can change the direction of a worksheet, which is the situation of the substance with the goal that it prints either vertically or on a level plane on a page.
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.
Answer:
rocket league
Explanation: cars and balls
Explanation:SAN(Storage area network) technology is the network technology that is used for the accessing of the block level network towards the storage units. It is made up of the storage components, switches etc.
RAID(Redundant Array of Independent Disks) and IP(internet protocol) is used as the precursor because they work better than the SAN. They have the ability to solve the issue that occur in the SAN technology like complexity,and other faulty issues.They maintain the fault tolerance quality and maintaining the network.