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.
One can structure of a table change in sql and the general types of changes that are possible is that:
- One can use the MODIFY STRUCTURE to alter the structure of the current table that one is in and this is done by adding or deleting fields.
- One can also change or alter a field name, width, or that of the data type and this is done by Issuing the MODIFY STRUCTURE command that tends to opens the Table designer, an interactive place in which a person can create or change the structure of a table.
<h3>How can we modify the structure of a table in SQL?</h3>
The SQL ALTER TABLE command is known to be the tool that is often used to alter the structure of an existing table.
Note that it is one that can helps to add or delete columns, make or destroy indexes, alter the type of existing columns, and others.
Hence, One can structure of a table change in sql and the general types of changes that are possible is that:
- One can use the MODIFY STRUCTURE to alter the structure of the current table that one is in and this is done by adding or deleting fields.
- One can also change or alter a field name, width, or that of the data type and this is done by Issuing the MODIFY STRUCTURE command that tends to opens the Table designer, an interactive place in which a person can create or change the structure of a table.
Learn more about table structure from
brainly.com/question/26125587
#SPJ1
Answer:
B repeat a chunk of code until the condition is true im 88% sure
Answer
Tool Box
Explanation
A tool box is a window that contains icons and buttons that are tools in the program. The tools helps in quick access to common operations GIMP is image manipulation program. Ii is normally a free and open source graphic editor which is used for the purposes of drawing , editing doing many more specialized tasks.To show the tool box in GIMP you just need to use edit preferences then select toolbox to enable or disable .
The process you need to follow to start your own fashion clothing brand are:
- Find a need in the market.
- Create a business plan
- Find your target audience.
- Begin designing
- Identify a clothing manufacturer.
- Select a brand name, logo, and market profile
- Select a price point for your items.
- Start the marketing process.
- Put done some realistic sales and distribution goals.
- Begin a soft launch, and also search for more investment and partnerships.
<h3>What is clothing line?</h3>
A clothing brand or a clothing line is known to be made up of a composition of apparel made for a target audience and sold mostly in retail locations and via stores.
Note that The process you need to follow to start your own fashion clothing brand are:
- Find a need in the market.
- Create a business plan
- Find your target audience.
- Begin designing
- Identify a clothing manufacturer.
- Select a brand name, logo, and market profile
- Select a price point for your items.
- Start the marketing process.
- Put done some realistic sales and distribution goals.
- Begin a soft launch, and also search for more investment and partnerships.
Learn more about clothing brand from
brainly.com/question/24264007
#SPJ1
