Algorithms Answers

Questions answered by Experts: 652

Need a fast expert's response?

Submit order

and get a quick answer at the best price

for any assignment or question with DETAILED EXPLANATIONS!

Search

consider the following quadratic equation: 2x^2-40x+150=0. a trusted mathematician tells us that the roots for this equation are 15 and 75. however, when you try to solve it, the roots turns out to be 15 and 5. explain why 75 could be a solution while 5 is not


int main()

{

double disc;

double item1 = 201.99;

double item2 = 20.56;

string message;

disc = calcDisc(item1, item2);

message = calcDisc();

return 0;

}

The two function calls will ... ?



By using single layer perceptron algorithm classify the following patterns. Where X1 and X2

are inputs Y is the output. Learning rate is 0.5 , output is 1 if weighted sum >=0.5 otherwise

0 and weights w1 =0.2 and w2 = 0.3 [5]

X1 X2 Y

0 0 0

0 1 1

1 0 1

1 1 1


  1. There are huge secondary or standard datasets published in the internet for such case studies:

·        Case 1: Texts categorization in any dominoes.

·        Case 2: Images (detection/or recognition) in any dominoes.

·        Case 3: Signals classification in any dominoes.

 

Find ONE (1) of the secondary datasets from the internet. Name the secondary dataset that you have found.




By using single layer perceptron algorithm classify the following patterns. Where X1 and X2

are inputs Y is the output. Learning rate is 0.5 , output is 1 if weighted sum >=0.5 otherwise

0 and weights w1 =0.2 and w2 = 0.3 [5]

X1 X2 Y

0 0 0

0 1 1

1 0 1

1 1 1


1.Give the English description of the following regular expression.
i. r=a(a+b)∗ab
ii. r=a∗b+b∗a
iii. r=(aa+b)∗(bb+a)∗

2.Find the regular expression defining each of the following language over E=[a,b].
i. All strings that do not end in a double letters.
ii. all strings in which letter never triples
iii. All strings in which 'a' is triple or 'b' is triple.
  1. find a regular expression corresponding to each of the following over the alphabets Σ=[0,1]. the language of all strings ending with 1 and not contain 00


  1. the set of strings over Σ={a,b} in which there are at least two occurrence of b between any two occurrence of a




How do I complete compute f(0.3) for the data x 0 1 3 4 7 f 1 3 49 129 813 using Lagrange's interpolation formula?

Write down 3 positives and 3 negative test cases for all of the 45 testing techniques

 It is late at night, and you decided to get a glass of milk before bed. Try to a pseudocode describing the process of going to the kitchen and getting the milk.


b. Draw a flowchart to illustrate the above program


LATEST TUTORIALS
APPROVED BY CLIENTS