All categories

4 years ago

How does limiting a company's scope benefit the company?

2 answers:

8 0

If a company only focuses on a few things,they become a niche player in the market,therefore can demand a higher price because they are experts at only a few things.

fgiga [73]4 years ago

4 0

Answer:

It makes it easier to produce a high quality product.

Explanation:

You might be interested in

The =COUNT function calculates what value?

kirill [66]

Answer:

adds up the values in the range of cells provided

Explanation:

3 0

3 years ago

Read 2 more answers

Write 2 paragraphs. 1 comparing Shrek the movie and Shrek the musical and another contrasting them.

kvv77 [185]

The movie was way better, though the actors in tge musical did a good job. Shrek

8 0

3 years ago

Read 2 more answers

My friend Leo wants to have an emergency plan for his final exams on University of Southern Algorithmville. He has N subjects to

leonid [27]

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.

6 0

3 years ago

Write a function called 'game_of_eights()' that accepts a list of numbers as an argument and then returns 'True' if two consecut

MrRa [10]

Answer:

In Python:

def main():

n = int(input("List items: "))

mylist = []

for i in range(n):

listitem = input(", ")

if listitem.isdecimal() == True:

mylist.append(int(listitem))

else:

mylist.append(listitem)

print(game_of_eights(mylist))

def game_of_eights(mylist):

retVal = "False"

intOnly = True

for i in range(len(mylist)):

if isinstance(mylist[i],int) == False:

intOnly=False

retVal = "Please, enter only integers"

if(intOnly == True):

for i in range(len(mylist)-1):

if mylist[i] == 8 and mylist[i+1]==8:

retVal = "True"

break

return retVal

if __name__ == "__main__":

main()

Explanation:

The main begins here

def main():

This gets the number of list items from the user

n = int(input("List items: "))

This declares an empty list

mylist = []

This iterates through the number of list items

for i in range(n):

This gets input for each list item, separated by comma

listitem = input(", ")

Checks for string and integer input before inserting item into the list

if listitem.isdecimal() == True:

mylist.append(int(listitem))

else:

mylist.append(listitem)

This calls the game_of_eights function

print(game_of_eights(mylist))

The game_of_eights function begins here

def game_of_eights(mylist):

This initializes the return value to false

retVal = "False"

This initializes a boolean variable to true

intOnly = True

This following iteration checks if the list contains integers only

for i in range(len(mylist)):

If no, the boolean variable is set to false and the return value is set to "integer only"

if isinstance(mylist[i],int) == False:

intOnly=False

retVal = "Please, enter only integers"

This is executed if the integer contains only integers

if(intOnly == True):

Iterate through the list

for i in range(len(mylist)-1):

If consecutive 8's is found, update the return variable to True

if mylist[i] == 8 and mylist[i+1]==8:

retVal = "True"

break

This returns either True, False or Integer only

return retVal

This calls the main method

if __name__ == "__main__":

main()

7 0

3 years ago

What is the base for a hexadecimal number system?

miskamm [114]

The base for a hexadecimal number system is 16

5 0

3 years ago