First we calculate total using cumulative class %.
class % for 1st class = cumulative % for first class = 50% and
class % for 1st class = class f for 1st class / Total = 50%
or, class f for 1st class/Total = 0.5
or, Total = class f for 1st class/ 0.5 = 129 / 0.5 = 258
Now, we get the class frequency for 2nd class.
class f for 2nd class = cumulative f for 2nd class - class f for 1st class
or, class f for 2nd class = 214- 129 = 85
Now, we get the class frequency for 3rd class.
class f for 3rd class = Total - class f for 2nd class - class f for 1st class
class f for 3rd class = 258 - 85 - 129 = 44.
Now we calculate class % for each class:
For 1st class we have already calculated it.
class % for 2nd class = class f for 2nd class / total
or, class % for 2nd class = 85 / 258 = 32.95
Similarly class % for 3rd class = 44 / 258 = 17.05
Cumulative f is calculated as:
Cumulative f for any class = sum of class f upto that class
so,
Cumulative f for 1st class = 129
Cumulative f for 2nd class = 129 + 85 = 214
Cumulative f for 3rd class = 129 + 85 + 44 = 258
Cumulative % for any class = sum of class % upto that class
so,
Cumulative % for 1st class = 50
Cumulative % for 2nd class = 50 + 32.95 = 82.95
Cumulative % for 3rd class = 50 + 32.95 + 17.05 = 100
fill the empty spaces f Cumulative % Cumulative% 50.0 129 Language Proficiency 1 Language 2 Languages...
please fill out the empty spaces Name: Da ĐH3 H3 2)#30+
So, unary languages are just sets on integer numbers 10 3 numi - num2< ....j: the empty word c corresponds to 0, the word | to 1, the word || to 2 etc... In other words, an unary language L is an infinite boolean seguence (b(0), b(1),.., b(i), ), where b(i) = 1 iff i E L. An unary language is regular iff there exist numbers i,T such that bj) b(j +T) for all j 2 i. Is it true...
Question 1: Every language is regular T/F Question 2: There exists a DFA that has only one final state T/F Question 3: Let M be a DFA, and define flip(M) as the DFA which is identical to M except you flip that final state. Then for every M, the language L(M)^c (complement) = L( flip (M)). T/F Question 4: Let G be a right linear grammar, and reverse(G)=reverse of G, i.e. if G has a rule A -> w B...
Given the numbers below, fill in the cumulative frequency columns. X f cf 9 1 8 2 7 4 6 5 5 7 4 5 3 5 2 4 1 2
6&7 The questions below are based on the table below. Fill in the blank spaces first. The questions below are based on the table below. Fill in the blank spaces first. The question below is based on the table below. Fill in the blank spaces first. Amount of Labor Total Product 11 24 38 40 Marginal Product of Labor (MP) Value ofMPL if Product (VMP) Product Price-4 What is the Total Product for L-3? What is the MPL for L...
Exercise 4.1.1: Prove that the following are not regular languages a) (0"1n|n 2 1). This language, consisting of a string of 0's followed by an cqual-length string of 1's, is the language Loi we considered informally at the beginning of the scction. Here, you should apply the pumping lemma in the proof. b) The set of strings of balanced parentheses. These are the strings of char- acters "(" and " that can appear in a well-formed arithmetic expression *c) O"IO"...
Determining whether languages are finite, regular, context free, or recursive 1. (Each part is worth 2 points) Fill in the blanks with one of the following (some choices might not be used): a) finite b) regular but not finite d) context-free but not deterministic context-free e) recursive (that is, decidable) but not context-free f) recursively enumerable (that is, partially decidable) but not recursive g) not recursively enumerable Recall that if M is a Turing machine then "M" (also written as...
2. A school offers three language classes: Spanish (S), French (F), and German (G). There are 100 students total, of which 28 take S, 26 take F, 16 take G, 12 take both S and F, 4 take both S and G, 6 take both F and G, and 2 take all three languages. (1) Compute the probability that a randomly selected student (a) is not taking any of the three language classes; (b)takes exactly one of the three language...
(a) Give 2 strings that are members of language specified by the regular expression (0+ 1)∗ but are not members of the language specified by 0∗ + 1∗ . Then give 2 strings that are members of both languages. Assume the alphabet is Σ = {0, 1}. (b) For each of the following languages specified by regular expressions, give 2 strings that are members and 2 strings that are not members (a total of 4 strings for each part). Assume...
(I point) f(z)-,2+1-1 < z < 0 (i) find P(-0.5sX<0.25). (a) Find the cumulative distribution function F(z). Fill in the blanks below. F(z) EE when x when when when x> (b) Evaluate P(Xc0.75X20.25) (c) 35% of the time, X exceeds what value? (d) l Estimate the location of the mean/expected value of X. Once you have done so, find the E(X)