Other Programming & Computer Science Answers

Imagine that you would like to predict if your favorite table will be free at your favorite restaurant. The only additional piece of information you can collect, however, is if it is sunny or not
sunny. You collect paired samples from visit of the form (is sunny, is table free), where it is either
sunny (1) or not sunny (0) and the table is either free (1) or not free(0).
(a) [10 marks] How can this be formulated as a maximum likelihood problem?
(b) [10 marks] Assume you have collected data for the last 10 days and computed the maximum
likelihood solution to the problem formulated in (a). If it is sunny today, how would you predict if
your table will be free?
(c) [5 marks] Imagine now that you could further gather information about if it is morning,
afternoon, or evening. How does this change the maximum likelihood problem?

I got an error in converting keras to core ml

( AttributeError: module 'coremltools.converters.keras' has no attribute 'convert' )

I want to know how to fix this problem with details

thanks

Write a Qbasic program to read in the radius r of a circle, centered at the origin. then read in the coordinate pair(x, y) of a point and determine that point lies within the circle.

Write a program in Qbasic assigning 11=1, 12=2, 13=3, 13=4, 15=5 and 16=6. Have your program print this integers in the following ways.
A.) In a single row
B.) In two rows, contain(11,12,13) and (14.15,16) using two PRINT statement but only one FORMAT statement.
C.) In two rows as above, but with only one PRINT statement

Write a program in Qbasic that reads the name(last and first) and phone numbers as a single string and returns the list in alphabetical order

Using Binary Tree insertion what do you do if your home address does not exist

Write a grammar for boolean expressions made up of propositions connected
through the following logical operators: AND, OR, NOT. A proposition
can be a single token or two tokens connected through one of the relational
operators: <, <=, =, <>, >=, >. A token is either an identifier or a number.
All logical operators are left associative. NOT has the highest precedence,
followed by AND, followed by OR.

Once you have defined the production rules of your grammar, show the steps
involved in a bottom-up (LR) parsing of the input expression "i>=0 AND NOT p".

Consider the following grammar in BNF:

<S> ::= 0 <A> | 1 <A>
<A> ::= 0 <B>
<B> ::= 1 <A> | 1

Which of the following sentences are in the language generated
by this grammar? For those that are in the language, show a possible
derivation. For the others, explain why they cannot be generated using the
rules of the grammar.
a. 10101
b. 10110
c. 001010

f(x)=sinx+cscx²y+2xy

Accespt basic_pay from an employee, calculate salary of him/her a per the following formulas ansd display it on the screen

1 grade_pay is double of basic _pay
2 performance_allowance is 70% of basic_pay
3 attendance_allowance is RM 200
4 housing_allowance is 20% of basic_pay
5 salary=grade_pay + performance_allowance + attendance_allowance + husing_allowance

I should write it with pseudocode and flowchart