Use a partitioning argument to explain why G2 for testing indepen- dence cannot increase after combining two rows (or two columns) of a contingency table. (Hint: Argue that G² for full table = G² for col- lapsed table + G2 for table of the two rows that are combined in the collapsed table.)

Describe the role of cookies in web applications and their potential security risks.

Consider the following set of frequent 3-itemsets: {1, 2, 3}, {1, 2, 4}, {1, 2, 5}, {1, 3, 4}, {2, 3, 4}, {2, 3, 5} a) List all candidate 4-itemsets that can be generated by combining any two 3-itemsets from the above list. b) Prune your list of the candidate 4-itemsets using the Apriori principle and list candidate 4-itemsets that survive the candidate pruning step. (Hint: a candidate 4-itemset cannot be frequent if any of its subset is not frequent. Also, note that any 3-itemset that is not in the above list is not frequent.)

Q3. Compute the distance vector tables for each node, until they reach a settled state. Present your tables in the style used in the example and shown below, with each iteration appearing in a separate column. [15 marks] Iteration 1 Iteration 2 and so on... cost to Node Node А в с A A C A A 6 A 00 B 00 C 00 00 Node Node A B C D A C D B B A A 00 B 6 1 3 C D I and so on... 8 3. 8 8