Consider a potential business problem that would require a computer program solution. How could an algorithm be used to solve a problem that a business may encounter?
`Hey,
Note: Brother if you have any queries related the answer please do comment. I would be very happy to resolve all your queries.
To decide, you need to think about the problem to be solved and the available data, and ask questions about feasibility, intuition, and expectations.
Start by distinguishing between automation problems and learning problems. Machine learning can help automate your processes, but not all automation problems require learning.
Automation without learning is appropriate when the problem is relatively straightforward. These are the kinds of tasks where you have a clear, predefined sequence of steps that is currently being executed by a human, but that could conceivably be transitioned to a machine. This sort of automation has been happening in businesses for decades. Screening incoming data from an outside data provider for well-defined potential errors is an example of a problem ready for automation. (For example, hedge funds automatically filtering out bad data in the form of a negative value for trading volume, which can’t be negative.) On the other hand, encoding human language into a structured dataset is something that is just a tad too ambitious for a straightforward set of rules.
For the second type of problems, standard automation is not enough – they require learning from data. And we now venture into the arena of machine learning. Machine learning, at its core, is a set of statistical methods meant to find patterns of predictability in datasets. These methods are great at determining how certain features of the data are related to the outcomes you are interested in.
Kindly revert for any queries
Thanks.
Consider a potential business problem that would require a computer program solution. How could an algorithm...
How much time does the following "algorithm" require as a function Problem 4.1. of n? for i 1 to n do for j 1 to n do for k 1 to n3 do Express your answer in 6 notation in the simplest possible form. You may consider that each individual instruction (including loop control) is elementary
Please find the complexity of the algorithm used to solve the problem below. Also find the approximate problem size we could solve in time t, given that we double the speed of the original machine. Thank you Suppose that a computer can run an algorithm on a problem of size 1,024 in time t. We do not know the complexity of the algorithm. We note that when we run the same algorithm on a computer 8 times faster, in the...
Describe a business problem that would require a dummy variable in a regression Describe a business problem that would require a moderating effect Explain which moderating effect and what the business meaning of that effect was
Jave eclipse Wanna help Program 1 Algorithm Problem statement: Write a Java program to add up the digits of a number entered by the user and output the result. You may not use an array top perform this task. The program should be able to handle an integer of any size. For example, if the number 1256 was entered, the sum would be: SumOfDigits = 1 + 2 + 5 + 6 = 14 Solution: The following Algorithm could be...
Please help me with this answer. Performance Comparison for Dijkstra Algorithm and Bellman-Ford Algorithm Problem Description The shortest path problem is one of most important problems in graph theory and computer science in general. Shortest path problem is one of typical optimization problems. Given a graph G = (V,E), the goal is to nd a minimum cost path from s → t, s,t ∈ V . This variant is called one-to-one shortest path problem. Other variants are one-to-all (compute shortest...
5. How would you adapt Dijkstra’s algorithm to solve the single-destination shortest paths problem? In other words, find the shortest path from each node to a single destination node. Consider this question for both (a) undirected and (b) directed graphs.
please use matlab only
COMPUTER PROBLEMS 8.6 1. Write a computer program to solve this initial-value problem using the Taylor-series method. Include terms in h, h2, and h and continue the solution tor 1. Let h 0.01 x1 = t + x1+x2 i xd-1)=0.43 avl
COMPUTER PROBLEMS 8.6 1. Write a computer program to solve this initial-value problem using the Taylor-series method. Include terms in h, h2, and h and continue the solution tor 1. Let h 0.01 x1 =...
Word Bank:
a) python
b) computer science
c) algorithm
d) program
e) interpreter
f) compiler
g) syntax
h) semantics
i) value
J) variable
k) operator
l) operand
m) expression
n) statement
o) input
p)output
q)call
r) arguments
s) library
t) bug
u) variable scope
v) local variable
w)global variable
x) variable lifetime
y) relational operators
z) logical operators
1) Compares operands and results in a bool: 2) The duration of a variable's existence: 3) A list of instructions to solve...
If you could provide a step by step on how to solve this problem, I would greatly appreciate it...thanks! The concentration of iodide ions in a saturated solution of lead (II) iodide is _____M. The solubility product constant of PbI2 is 1.4x10-8.
Prove that your algorithm works!
6.) Dynamic Consider a modification of the rod-cutting problem in which, in addition to a price p, for each rod, each cut incurs a fixed cost of c. The revenue associated with a solution is now the sum of the prices of the pieces minus the costs of making the cuts. Give a dynamic-programming algorithm to solve this modified problem. Prove that your algorithm works.