bigram count table, C(w2|w1) for the sentence "I saw Susie sitting in a shoe shine shop. Where Susie sits Susie shines, and where Susie shines Susie sits." Put w1 in the left hand column, and w2 in the top row. Include punctuation, clitics, and sentence start and end markers as individual tokens, and index words using their lemmatized forms

discrete structure  Consider the balanced parentheses problem from the tutorial 5. True or False: We could have equivalently proven the property P(n) that every balanced parentheses string S of length n has the same number of [ as ], for every n ≥ 0, by strong induction.   Question 5 options:   a) True   b) False

Q5B. Of the missing entries in the truth table, select each that should have an entry of False (F). p q r ¬p ¬p ∧ r ( ¬p ∧ r ) ∨ q  T T T F F T T T F F F (A) T F T F F F T F F F (B) F F T T T T T F T F T F (C) F F T T (D) T F F F T F F   Question 5 options:   A   B   C   D

c) How can metadata be used to improve services and customer experiences?

Horizontal sequence :RIVL Vertical sequence:FMK   Scoring rules: g/o = -3, g/e = -1, match or mismatch - from PAM250 substitution matrix below.  NW algorithm.    1. Complete the scoring matrix.    Scoring matrix with PAM250 scores:   R I V L F         M         K           2. Set up, initialize and complete the NW matrix.  3. Retrace, align and score alignment(s).             Use the arrows and circles for the matrix and path(s).                                                                                                                                                                                                                                                                                                                                 R I V L             F           M           K           Align and score all optimal alignments here.  PLZ  the arrows and circles for the matrix and path(s) AND SHOW ALL possible Alignment

Consider the expression (6+3*4)/(7-1)  In order to evaluate the expression it must be converted to Postfixnotation. Describe the process of conversion, then use that processto convert the  above expression to Postfix. Note that if you don'tremember exactly how to process parenthesis, simply process them ina separate area until you get to the end of the parenthesized partof the expression. Then convert the expression to Postfix NOTE: You must show all work. Once you have your Postfix expression, now describe how to evaluateit. Then show the evaluation steps for the expression to generate afinal result. Again in order to get full credit you must show allwork.

Question 6 Which of the followings is a representation for the set {x | a < x < b} [a,b) (a,b] (a,b) [a,b] Moving to another question will save this response. ch

Let ∑={a,b} and T be the set of words in ∑* that have no consecutive a’s (i.e. there cannot be 2 or more a’s in a row). (a) Give a recursive definition for the set T. (b) Use your recursive definition to show that the string “abbaba” is in T. (c) Is your recursive definition uniquely determined? Explain why or why not.

Discrete Mathematics  Simplify each of the following expressions. Do not use the set difference operator in your simplifications. Note that the set U in the second item is the universal set, which includes all elements. Shade the indicated regions of the following Venn diagrams.   please see attached photo for more details

ewrite the following proposition as unambiguous English sentences. The relevant redicates are defined as follows: Again, let's let P be a set of all people a. A(x) means "x is teaching the Al course" b. T(x) means "x is taking Al course" c. F(x) means "x has a twitter account." d. C(x) means "x likes to read."